Alp Eren Bütün

Native Optimal-Completion Fibers, Real-Time Pushdown Recognition, and Protected Paired-Session Comparisons

The paper develops the connection between optimal-completion geometry and physical pushdown realization, building on our earlier work on shortest-completion fibers, simplicial realization, and protected-obligation structures. It asks whether prescribed topological complexity can...

CCR-k Arithmetic Refinement: p-Adic Resonance, Ramification, and Arithmetic Density Laws

The paper develops the arithmetic refinement of our original CCR-k General Theory, which arose from the higher-order structure of chronological carry and exact pushdown normalization. Whereas the general theory establishes the higher-order transport equations and their Stirling-t...

Right-Turn Spectrum Languages: One-Pebble Completeness and Deterministic Dilation Obstructions

The paper develops a systematic impossibility theory for tree-language recognition, establishing fundamental limits on what restricted computational models can recognize. It introduces parametrized right-turn spectrum languages and proves an infinite family of impossibility theor...

Product Rigidity of Marked Periodic Nerves for Unequal Simplex-Strand Completion Fibers

The paper grows out of our research on the topology of optimal-completion fibers, particularly the displacement-marked structures and higher-rank phenomena arising from shortest-completion quotients. Its central question is whether the product topology observed in periodic nerve...