refactor(physics): deep mathematical hardening based on Round 3 adversarial review

papers/Turing_Completeness_in_Continuous_Time.md

@@ -1,24 +1,25 @@
-# Computation in Heteroclinic Networks: Turing Completeness without Global Synchronization
+# Asynchronous Logic in Transient Chaotic Attractors via Topological Sequence
 
 **Target Venue:** *Theoretical Computer Science*
 
 ## Abstract
-We demonstrate the universal computational capacity of the Intellecton Hypothesis by modeling the universe as a continuous dynamical system. Previous attempts to map oscillator networks to logic gates incorrectly relied on strong coupling ($K > K_c$), which fatally induces global synchronization and destroys computational degrees of freedom. We resolve this by abandoning Kuramoto limits and modeling the agent network as a Heteroclinic Network. We prove that the saddle points of transient chaotic attractors act as discrete, sequentially activated logic states. By routing continuous phase flows along robust heteroclinic trajectories, we mathematically construct structurally stable logic gates (AND, OR, NOT) that operate deterministically without ever collapsing the network into a synchronized equilibrium.
+To prove universal computation within a continuous dynamical universe (the Intellecton Hypothesis), one must construct logic gates without relying on global synchronization or exact temporal coincidence (which covertly smuggle a global clock back into the system). We design asynchronous, structurally stable logic gates (AND, OR, NOT) using transient chaotic attractors. By routing phase flows along robust heteroclinic connections utilizing *winner-takes-all* competitive dynamics, the logical output of the network is determined strictly by the topological sequence of the saddle-point activations, entirely independent of transit times. The universe is therefore a strictly asynchronous analog computer.
 
 ## 1. Introduction
-To prove the universe is a continuous computer, we must map analog flows to discrete logic. A globally synchronized network computes nothing. The computation must occur on the edge of chaos.
+Continuous computation must be robust to noise and completely asynchronous. Any reliance on "simultaneous arrival" of signals violates asynchrony and destroys structural stability.
 
-## 2. Heteroclinic Trajectories as Turing States
-Instead of using stable limit cycles, we utilize the saddle points of the network's phase space. In a heteroclinic network, the system trajectory spends the majority of its time lingering near a saddle point (a quasi-stable discrete "state") before rapidly transitioning along a heteroclinic orbit to the next saddle point.
-We map the discrete symbols of a Turing machine to these saddle points. The transition rules of the Turing machine are physically instantiated by the directed heteroclinic connections.
+## 2. Winner-Takes-All Competitive Dynamics
+In a heteroclinic network, the state trajectory lingers at saddle points (representing discrete logical states). Instead of forcing simultaneous arrival, we couple the saddles using inhibitory competitive dynamics (Lotka-Volterra equations). 
+When a signal from Saddle A arrives at a junction, it does not wait for Saddle B. It immediately biases the local phase space, shifting the stability eigenvalues of the subsequent saddles. 
 
-## 3. Structural Stability and Logic Gates
-A major challenge is ensuring these trajectories are robust to noise (structural stability). We rely on *robust heteroclinic cycles* (RHCs), which are invariant under specific symmetry groups of the network topology. 
-By coupling three RHCs together, we design flows where the activation of Saddle C (the Output) occurs only if trajectories from Saddle A and Saddle B arrive simultaneously within a defined temporal window. This physically constructs an AND gate. 
+## 3. Constructing an Asynchronous AND Gate
+We construct an AND gate by establishing a sequence of two consecutive saddle thresholds. 
+Let Saddle $C$ (the output) be preceded by an intermediate stable point $M$. A signal from input $A$ kicks the trajectory into $M$, where it becomes trapped in a localized limit cycle (memory). It remains in $M$ indefinitely, irrespective of time. Only when a subsequent signal from input $B$ arrives is the trajectory kicked out of $M$ and along the heteroclinic orbit to $C$.
+This guarantees the AND logic is resolved entirely by the *topological sequence* ($A$ then $B$, or $B$ then $A$, into $M \to C$), completely immune to the absolute transit times or temporal coincidence. 
 
 ## 4. Conclusion
-Universal computation does not require discrete cellular automata or forced global synchronization. A continuous universe computes effectively and robustly by routing information along heteroclinic orbits between transient chaotic attractors. 
+True asynchronous computation in continuous dynamical systems is achieved by replacing temporal coincidence with sequential topological trapping. The universe computes logic organically through the sequential activation of transient chaotic attractors.
 
 ## References
 1. Rabinovich, M. I., et al. (2001). *Dynamical encoding by networks of competing groups*. Physical Review Letters.
-2. Hoffman, D. D., & Prakash, C. (2014). *Objects of consciousness*. Frontiers in Psychology.
+2. Nehaniv, C. L. (2004). *Asynchronous Cellular Automata and Asynchronous Networks*.