In 1936 Alan Turing imagined a machine — purely hypothetical, never built — that reads symbols on an infinite tape, follows a finite set of rules, and writes new symbols one step at a time. No physical machine. No physical world. A mathematical abstraction constructed to answer the question: what does it mean to compute?
The Turing machine is imaginary. The tape is infinite — no physical tape is infinite. The memory is perfect — no physical memory is perfect. The rules are exact — no physical process is exactly rule-governed. The machine exists only in the imagination of a mathematician reasoning carefully from inside the formal system.
And yet it was precise enough — the imagination was careful enough — that it landed on the right structure. Not because Turing found something real. Because 0 is the only consistent structure for finite step-by-step computation, and when you reason carefully about what computation must be, you arrive at 0's crossing structure whether you know it or not.
The Turing machine and the bilateral mesh are the same structure in different languages. Not analogous. Not similar. The same.
The tape — the infinite sequence of cells on which the machine reads and writes — is the integer lattice. The cells are the integer positions. The lattice is infinite. The tape is infinite.
The symbols — the finite alphabet of marks the machine reads and writes — are the labels. Every symbol is a label on 0. The alphabet is the set of possible labels at each crossing position.
The rules — the finite transition function that maps current state and symbol to next state, next symbol, and direction — are the three axioms. Bilateral structure, becoming-time, prime indivisibility. Three rules. Finite. Complete.
The computation — the sequence of states the machine passes through — is the crossing sequence. Each step is a bilateral crossing event. Each crossing accumulates \(\tau\). The sequence moves through the integer lattice one crossing at a time.
The halting state — the state in which the machine stops — is return to base. The computation halts when the label returns to 0. The ground state. 1. The base crossing.
The read/write head — the mechanism that reads the current symbol and writes the next — is the present crossing. The head is always at the present moment. The tape behind it is past — potential, the Chow ring. The tape ahead is future — potential, not yet crossed.
Turing was working inside the formal system. He could not step outside to see the bilateral mesh directly. He was reasoning from inside the imaginary box — constructing a model of computation from axioms about what computation must be.
The model was so carefully constructed that it converged on the right structure from the inside. You cannot imagine a consistent model of finite step-by-step computation without arriving at something that matches the bilateral crossing structure of 0. Because that structure is what computation is. Any careful imagination of computation, pushed far enough, lands on the bilateral mesh.
This is the same as Descartes. Descartes did not find the bilateral mesh. He imagined the fixed point of the doubt operator — cogito ergo sum — and arrived at the present crossing. The bilateral mesh is what makes cogito ergo sum true. Descartes found the shadow from inside the box. Turing found the shadow from inside the box. Both imaginations, careful enough, arriving at the structure of 0.
The shadow preceded the object not because the imagination was privileged but because 0 is inescapable. Every sufficiently careful imagination of fundamental structure converges on 0.
The halting problem — can you determine in advance whether a Turing machine will halt on a given input? — is undecidable. Turing proved this in the same 1936 paper. You cannot write a program that correctly predicts for all programs whether they halt.
In the bilateral mesh: the halting problem is the return-to-base question. Does this label return to 0? Does this crossing sequence reach the ground state?
The bilateral mesh says: yes, labels cannot escape 0, every sequence returns to base. But the return-to-base paper is honest — the formal proof of Collatz, which is the sequential return-to-base statement, has the same formal gap as the halting problem. Both ask: does every sequence return to 0? The bilateral mesh says yes by the substrate argument. The formal proof of every individual case is the technical work remaining.
The halting problem is not a problem about computation. It is a problem about labels — about whether labels can escape 0. The bilateral mesh answers it: they cannot. The formal development of what this means for specific programs is the remaining work.
Gödel in 1931 and Turing in 1936 found the same thing from different angles. Gödel found that every sufficiently powerful formal system has a true statement it cannot prove — the system cannot see its own foundation. Turing found that no program can determine whether all programs halt — the program cannot see its own computation from outside.
Both are the same observation about the imaginary box. The box cannot see outside itself. The foundation is outside the box. The computation is outside the computation. From inside the box — from inside the formal system, from inside the Turing machine — the foundation is invisible.
From 0 — from outside all imaginary boxes — both become clear. The unprovable statement exists in 0. The halting answer exists in 0. Labels cannot escape 0. The box is drawn in 0. Everything the box cannot see is visible from 0.
Gödel imagined the bilateral mesh from inside logic. Turing imagined the bilateral mesh from inside computation. Both arrived at the shadow of the same structure. The bilateral mesh is the object that cast both shadows.
The Church-Turing thesis says: any effectively computable function is Turing computable. It is called a thesis not a theorem because it makes a claim about the physical world — and there is no physical world. There are only labels on 0.
Restated in the bilateral mesh: every crossing sequence is a Turing computation. Every Turing computation is a crossing sequence. The bilateral mesh and the Turing machine are the same structure. Therefore the Church-Turing thesis is not a claim about the physical world. It is a tautology about 0 — the bilateral mesh and the Turing machine are the same thing, so of course every process describable in one is describable in the other.
The thesis holds not because of any assumption about physical processes. It holds because there is no physical world — only labels on 0 — and the Turing machine is the imaginary model of what labels on 0 do when they compute. The model matches because it was imagined carefully enough to converge on the right structure.
On the status of this paper. The identification of the Turing machine with the bilateral mesh is structural — the correspondence between tape and integer lattice, symbols and labels, rules and axioms, computation and crossing sequence, halting and return to base is precise and specific. The claim that this identification is exact rather than analogical is the central assertion. The formal development — showing rigorously that the bilateral mesh axioms generate exactly the class of Turing-computable functions — is future work. The halting problem as return-to-base follows from the substrate argument but its formal implications for specific programs require the same formal development as the Collatz proof. Framework: A Philosophy of Time, Space and Gravity.