← Back to summary

Intelligence as High-Dimensional Coherence: The Observable Dimensionality Bound and Computational Tractability

Ian Todd
Sydney Medical School, University of Sydney, Australia

Abstract

Intelligence arises from high-dimensional coherent dynamics. We show that high-dimensional continuous dynamics are not merely one way to implement intelligence—they are the thermodynamically favored solution under bounded measurement capacity. The core constraint is measurement bandwidth, not computational complexity: tracking systems with effective dimensionality DtargetD_{\text{target}} requires measurement capacity CobsDtargethεtrack/τeC_{\text{obs}} \gtrsim D_{\text{target}} \cdot h_\varepsilon^{\text{track}} / \tau_e. External observers with finite bandwidth face an observational accessibility threshold beyond which the system becomes ontologically unmeasurable. This applies to all living systems: bacteria tracking chemical gradients (Dtarget101D_{\text{target}} \sim 10^110210^2, 1012\sim 10^{-12} W) and human brains tracking social/ecological complexity (Dtarget103D_{\text{target}} \sim 10^310510^5, \sim20 W) both require high-dimensional substrates (DeffDtargetD_{\text{eff}} \gg D_{\text{target}}), scaled to their respective behavioral bandwidths.

1. Introduction

Intelligence arises from high-dimensional continuous dynamics operating in phase space with effective dimensionality Deff103D_{\text{eff}} \sim 10^310410^4. This is not one implementation among many—it is the thermodynamically favored way to track and control complex environments in real time under bounded measurement capacity.

What does high-dimensional continuous computation enable?

  1. Simultaneous exploration of incompatible states. In high-D phase space (Deff1D_{\text{eff}} \gg 1), orthogonal subspaces allow the system to maintain superpositions of mutually exclusive configurations without forced resolution.

  2. Thermal noise as functional dimensionality expansion. Coupling to a thermal bath enables computation through stochastic resonance and noise-assisted barrier crossing.

  3. Constraint satisfaction without enumeration. Problems intractable for discrete search become tractable when relaxed to continuous high-D dynamics.

  4. Power scaling with behavioral output, not internal complexity. Biological systems dissipate \sim20 W regardless of task dimensionality.

2. The Observable Dimensionality Bound

We establish a fundamental relationship between dimensionality, measurement capacity, and temporal resolution. There exists a critical dimension:

Dcrit=CobsτeαhεtrackD_{\text{crit}} = \frac{C_{\text{obs}} \tau_e}{\alpha h_\varepsilon^{\text{track}}}

where CobsC_{\text{obs}} is the observation channel capacity (bits/s), τe\tau_e is the evolution timescale, hεtrackh_\varepsilon^{\text{track}} is the minimum bits per mode per τe\tau_e to track geometry, and α\alpha captures compressibility.

When Deff>DcritD_{\text{eff}} > D_{\text{crit}}, the system's constraint geometry reconfigures faster than behavioral measurement can track—it becomes timing-inaccessible. This establishes a physical boundary separating observable computation from timing-inaccessible computation.

3. The Measurement-Theoretic Tracking Bound

Theorem 1 (Measurement-Theoretic Tracking Bound). Consider a target system with effective dimensionality DtargetD_{\text{target}}. Let an external observer with measurement bandwidth CobsC_{\text{obs}} attempt to predict events with timing precision ε\varepsilon over coherence time τe\tau_e. Then:

  1. If DtargetDcritD_{\text{target}} \le D_{\text{crit}}: The system is observationally accessible. External measurement can resolve enough dimensions to predict outputs.

  2. If Dtarget>DcritD_{\text{target}} > D_{\text{crit}}: The system is observationally inaccessible. Insufficient measurement bandwidth to resolve the full manifold of causal influences.

The brain does not face this constraint because it is the high-dimensional substrate. No "measurement" occurs during internal evolution—information is carried in geometric configuration.

4. Code Formation from Dimensional Mismatch

Theorem 2 (Code Formation from Dimensional Mismatch). When two high-dimensional systems interact through a low-dimensional communication channel, stable codes must form at the boundary.

If DB>DlinkcritD_B > D_{\text{link}}^{\text{crit}}, the full state is observationally inaccessible. However, if BB's behaviorally-relevant dynamics are confined to structured regions—recurring subspaces Si\mathcal{S}_i—then AA can learn to recognize these regions as discrete codes cic_i. The effective dimensionality of what must be tracked collapses from DBD_B to Dcodelog2(Ncodes)D_{\text{code}} \sim \log_2(N_{\text{codes}}).

Implication: This theorem provides a thermodynamic explanation for the emergence of language, gesture, and other symbolic codes in biological systems. When two agents with high internal dimensionality (Dbrain103D_{\text{brain}} \sim 10^310610^6) coordinate through low-bandwidth channels (speech 50\sim 50 phonemes/s), stable symbolic codes are thermodynamically necessary.

5. Worked Example: Human Cortex

MEG source reconstruction yields hundreds of cortical parcels (N102N \sim 10^210310^3) coupling across frequency bands (B3|B| \sim 355). A conservative estimate of effective dimensionality:

DeffMEGκNB0.3×250×4300D_{\text{eff}}^{\text{MEG}} \sim \kappa N |B| \approx 0.3 \times 250 \times 4 \approx 300

For mid-range parameters (Cobs102C_{\text{obs}} \sim 10^2 bits/s, τe0.1\tau_e \sim 0.1 s):

Dcrit=100×0.11×2=5 modesD_{\text{crit}} = \frac{100 \times 0.1}{1 \times 2} = 5 \text{ modes}

Therefore: DeffMEG/Dcrit102D_{\text{eff}}^{\text{MEG}}/D_{\text{crit}} \approx 10^2. Even at MEG-accessible scales, cortex operates 102×\sim 10^2\times above the observability threshold.

6. Conclusion

Training GPT-scale models (1011\sim 10^{11} parameters) requires 1024\sim 10^{24} collision events, consuming megawatts. The human brain achieves comparable complexity at \sim20 W—six orders of magnitude less. This gap reflects the fundamental thermodynamic cost of dimensional mismatch.

Irreducible complexity is irreducible. Systems with irreducible high-D—ecosystems, vector addition systems with Ackermann-complete reachability, multi-agent dynamics—cannot be faithfully compressed without information loss.

The clocking constraint: Digital systems enforce temporal synchronization via a global clock signal. Every register must settle to a definite state at each clock edge, forcing Deff/Dcrit1D_{\text{eff}}/D_{\text{crit}} \to 1. Biological systems operate unclocked—oscillations emerge from coupled dynamics without external synchronization, permitting DeffDcritD_{\text{eff}} \gg D_{\text{crit}}.

Download PDFView on GitHub →

Workflow: Claude Code with Opus 4.5 (Anthropic) for drafting and simulation code; Gemini 3 Pro (Google) and GPT-5.2 (OpenAI) for review. Author reviewed all content and takes full responsibility.