Depth Tower
A representation tower and a self-model iteration are different constructions. Neither gives a biological depth merely by counting layers or iterations. This page follows the typed mathematical kernel and the canonical hierarchy: L2 requires ; L3 additionally requires independent nonconstant metamodel predictions; L4 is a compatible all-order ideal.
The former universal equivalence between SAD and L-levels, cognitive ceiling SAD_MAX = 3, and identification of every depth increase with an catastrophe are withdrawn [✗]. An optional score still has a ceiling of three by its definition; this is not a theorem limiting cognition. T-142's old cognitive/spectral identification needs these corrections propagated to its own proof.
1. The problem
Canonical is normalised proximity to , not measured prediction accuracy. An implemented model and independent targets are extra inputs. The same can accompany different implemented models, and a model can have high fidelity to a constant target while doing no nontrivial metacognition.
2. Typed representations
Declare spaces , states , forgetting maps , and model maps . If is a coordinate chart of , state reconstruction must enforce positivity and trace one. The relative interior has real dimension 48; boundary strata and arbitrary neural representations are not automatically that chart.
The maps may be learned, but their domains, metrics and observation laws must be specified. Compression does not prove an optimal sufficient statistic for survival. A proposed information bottleneck additionally needs random variables, a task loss and a constraint; no universal learning optimum follows from seven coordinates alone.
3. Two meanings of depth
Certified depth [D/Pr]. For independently measured targets at each order, use the canonical with error and response variation . Define depth as the greatest prefix of passing certificates and compatibility tests, taking zero for an empty prefix. Missing data are unknown. This prevents a single isolated passing score from certifying every lower order.
Iteration score [D]. One may instead count iterations for which a declared scalar exceeds a declared threshold. Report the channel, initial state, score, indexing and threshold. Such a count is an engineering diagnostic until an independent depth bridge is established.
No SAD–L equivalence
A score determines L exactly only if the L-classification is constant on its fibres. Canonical uses ; a purity-only score omits integration and differentiation, and an iteration score omits the metamodel tests. There is no general SAD–L equivalence. A reconstruction score
can be negative, is undefined at , and depends on the chosen coordinates. It must not be substituted for canonical .
Powers and compatibility
For one self-map, is an iteration identity [T]. It does not imply commutativity of a heterogeneous tower. The equation
is a compatibility condition [D], to be imposed or tested. It is not forced by state preservation or by CPTP contractivity.
Correct spectral formula
For a fixed linear diagonalizable channel with spectral projectors ,
A general linear channel may require Jordan terms. A projection onto stationary modes is an asymptotic statement requiring decay of the other modes and absence of nontrivial peripheral oscillations; it is not the formula for every finite iterate. A state-dependent model is nonlinear and has no such global channel spectral formula merely by being state preserving.
For the bare Fano dephasing and nonzero initial off-diagonal norm,
For canonical ,
Neither expression is fidelity or reflective competence. The detection rule gives the bare-channel bound [T]. It depends on a chosen detection threshold and is not universally three. If the initial off-diagonal norm is zero the ratio is undefined, rather than a depth certificate.
What the former critical-purity arithmetic proves
Explicitly stipulate the score
Then, by rearrangement,
For , these numbers are . Since , this stipulated score never reaches order four, and its maximum three is attained for . This algebra is [T conditional on the score definition]. The prefactor can exceed one and is neither the normalised survival ratio nor canonical . No Fano theorem identifies it with self-model accuracy.
Also implies : the purported depth-three episode fails the canonical L2 gate. It cannot be L3 under the cumulative hierarchy. A chosen 3-truncation, a Jordan-algebra matrix-rank ceiling or a chosen perfect-code grammar does not independently prove a bound on cognitive recursion; each needs a faithful operational bridge. See corrected T-217/T-218.
4. Biological correlates
Assignments of bacteria, insects, mammals, humans or meditators to numerical depths are [H] and require species/task-specific probes and reconstruction. Layer count, neuron count and successful navigation alone do not measure the declared certificate. No universal human ceiling of three is established here.
5. Consistency and its interpretation
On a declared test domain define
This is a compatibility error [D]. Translating it into dissociation, alexithymia or health is an empirical bridge [H], not a diagnosis from a norm. Spectral radius alone is not a one-step operator norm for a nonnormal Jacobian; transient growth and long-term stability must be checked separately.
6. Morphological agnosticity
Learning Enc/Dec and choosing representations through interaction are architectural proposals [D/Pr]. Starting from is an initial-state choice: it has canonical , not zero, and is not a theorem of zero knowledge. Rates such as require units, a time scale and a dynamical balance. A seven-dimensional register does not universally minimise sample complexity; that depends on a statistical task and hypothesis class.
7. Depth dynamics
Growth
A depth label can change when a prediction error crosses a threshold along a smooth trajectory. A bifurcation requires a separate dynamical degeneracy; additionally requires a scalar smooth reduction, fourth-order stationary degeneracy and a transverse three-parameter unfolding. Three named controls alone are insufficient. See conditional catastrophe models.
Resource requirements
If independently implemented orders each consume at least of a resource with total budget , their number is at most [T under these assumptions]. Neither a linear nor a superlinear cost law follows from level count alone; shared computation and symbolic recursion must be considered.
Landauer calibration
For isothermal logically irreversible erasure of a declared classical memory with entropy decrease in nats, the reversible-limit heat lower bound is under the usual thermodynamic assumptions. Bit count must come from a memory/task model, not the ratio of Euclidean representation dimensions. cannot supply a positive energy budget. Source: Landauer's original erasure analysis.
Stress scheduling
Hot/warm/cold scheduling can be a declared engineering policy [D]. Numerical stress bands and forced depth collapse are not universal biological theorems. Clinical interpretation requires independently measured functional outcomes [H].
Social depth
A joint state lies in , and an aggregate requires a map to the seven-dimensional model. Correlation or local viability alone does not imply additive predictive depth. Test partner-model predictions against independent targets and common-input controls. Phase alignment is not an empathy measurement; topology of does not give a universal social energy barrier. See composite systems.
Reinterpretation of the “licensed excursion”
A simulated trajectory crossing verifies an implementation of the stipulated score above. It does not measure an episode of human reflection, meditation, altered qualia or clinical safety. Its higher purity actually closes canonical access . Report the target, dynamics, time units, score and stability calculation; phenomenal interpretation remains [H/I].
8. Architecture and validation
Design a declared state model, data encoder, self-model and metamodel, independent test targets, compatibility maps and resource accounting. An architecture does not receive an AGI or phenomenal label from passing a static scalar gate.
Implementation status
Code tests can verify score arithmetic, PSD preservation, iterative decay or diagram errors. They do not validate biological depth or categorical-to-cognitive identification. Operational depth requires held-out predictions; all-order compatibility requires a mathematical certificate rather than three iterations.