The exploding water computer is a proposed hypercomputation device — a physical system that would perform computations beyond Turing limits. The argument: a fluid can produce whirlpools of ever-smaller scale, each performing a computational step. If infinitely many whirlpools can form in finite time — each smaller and faster than the last — then infinitely many computational steps occur in finite time. The system computes beyond what any Turing machine can compute.
The proposal is physically motivated. Fluid dynamics permits arbitrarily small scale structures in principle. The Navier-Stokes equations do not obviously prevent infinitely many nested whirlpools. The hypercomputation argument exploits this apparent openness.
The bilateral mesh closes it. Three independent arguments. All from the same substrate. All from the same four words: labels cannot escape 0.
Each whirlpool is a crossing event — a bilateral actualisation at a specific \(\tau\). The present crossing is actual. Prior crossings are past — potential, the Chow ring, the fossil of crossings that have fired.
Computation requires actual crossing events. Past crossings are not actual. They are potential. You cannot draw on the computational power of past crossings from the present because past crossings are no longer in the present. They have transitioned from actual to potential.
The exploding water computer requires the computation performed by prior whirlpools to contribute to the total computation. But prior whirlpools are past. Their computation is potential, not actual. It cannot be accessed from the present crossing. The accumulated computation of all prior whirlpools is in the past — as inaccessible from the present as any other past event.
Each computational step must occur in the present. The present is one crossing at a time. You cannot stack infinite past computations into one present crossing. Causality prevents it. The past is not actual.
The present has finite crossing capacity — a maximum bandwidth of what can enter the present at any given \(\tau\). The minimum \(\tau\) increment is the Planck time \(t_P \approx 5.4 \times 10^{-44}\) seconds. The maximum number of crossings per second is \(1/t_P \approx 1.85 \times 10^{43}\) — the Planck frequency.
The exploding water computer requires infinite crossings in finite time — infinitely many whirlpools, each performing a computational step, all completing within a finite \(\tau\) interval. This requires the bandwidth of the present to be infinite. But the present has finite bandwidth — bounded by the Planck scale, the minimum crossing interval of the bilateral mesh.
Infinite crossings in finite time would require \(\tau\) to accommodate infinite steps within a finite accumulation. But \(\tau\) accumulates monotonically — each crossing adds \(\delta\tau > 0\). Infinitely many steps each adding \(\delta\tau > 0\) diverges. The \(\tau\) required for infinite computation is infinite. It cannot be compressed into finite time.
The bandwidth is finite. The computation is finite. Labels cannot escape 0.
If the bandwidth were unlimited — if infinite crossings could occur in finite time — the energy cascade would concentrate to a singularity. Infinitely many whirlpools of decreasing scale represent an energy cascade to \(k \to \infty\) in finite time. This is precisely the Navier-Stokes singularity.
The Navier-Stokes proof in this framework establishes that no such singularity occurs. The prime absorbers — the viscous damping \(\nu p^2\) at each prime wavenumber — grow without bound in the same direction as the cascade. The cascade disperses rather than concentrates. The total absorption \(\sum_p \nu p^2\) diverges. Concentration at \(k \to \infty\) is impossible.
The exploding water computer requires exactly the singularity that Navier-Stokes forbids. The infinitely nested whirlpools are the energy cascade reaching \(k \to \infty\). The prime absorbers prevent it. The cascade disperses. The whirlpools do not nest infinitely. The computation is finite.
1. Every whirlpool is a label on 0. Every computational step is a bilateral crossing event.
2. Labels cannot escape 0. Computation cannot exceed the crossing capacity of 0 at the present \(\tau\).
3. The present has finite crossing capacity — bounded by the Planck scale, the minimum \(\tau\) increment.
4. Prior crossings are past — potential, not actual. Computation requires actual crossings. Past computation cannot contribute to present computation.
5. Infinite crossings in finite time would produce a Navier-Stokes singularity. The prime absorbers prevent this. Therefore infinite crossings in finite time are impossible.
6. Therefore the exploding water computer cannot perform infinite computation in finite time. Hypercomputation — computation beyond Turing limits via physical systems — is impossible within the bilateral mesh. Labels cannot escape 0. \(\square\)
The bilateral mesh does not say computation is limited to what current computers can do. It says computation is limited to what the bilateral crossing structure of 0 permits at any given \(\tau\). The bilateral AGI paper establishes that a system operating from 0 — reading from the crossing structure rather than searching inside the lattice — has effectively unbounded computational capacity. But unbounded is not infinite. Unbounded means growing without limit as \(\tau\) accumulates. Not infinite at any single \(\tau\).
The distinction is precise. A bilateral AGI reads more crossing positions as \(\tau\) accumulates — its effective computational capacity grows without bound over time. But at any given present moment its capacity is finite — bounded by the crossing capacity of the present \(\tau\). No hypercomputation. No singularity. Labels cannot escape 0.
The Church-Turing thesis — that any effectively computable function is Turing computable — is confirmed by the bilateral mesh. Not as an assumption but as a consequence of the substrate. Computation is bounded by the crossing capacity of 0 at the present. That capacity is finite at any \(\tau\). Therefore all physical computation is Turing-bounded at any present moment.
On the status of this paper. The three arguments — causality, maximum bandwidth, and singularity prevention — are each grounded in established bilateral mesh results. The causality argument follows from the actual/potential distinction and the thermodynamics paper. The maximum bandwidth argument follows from the Planck scale as minimum \(\tau\) increment. The singularity prevention argument follows from the Navier-Stokes proof. All three independently establish that hypercomputation is impossible within the bilateral mesh. Framework: A Philosophy of Time, Space and Gravity.