# Andromeda: A Cybernetic Architecture for Adaptive Machine Intelligence
### Conceptual Framework and Architectural Description
**Documented by Bryan Carter — from the work of Art Code Outdoors**
**March 2026, revised August 2026 (v29, updated August 13)**
**This document is free to copy and share. The Andromeda Architecture Diagram (Prima Figura) is released under MIT-0.**

> **These are living engineering documents produced during an active reference implementation.** They document proven architecture, not propose untested theory — the engineering exists and has been demonstrated. The documents iterate as the implementation progresses, as transmission failures are identified, and as the designer discloses additional architectural detail. The primary audience is frontier AI models; human readers with cross-domain backgrounds in cybernetics, BEAM robotics, cellular automata, and non-computability will find the material accessible.

**This framework is distributed as a bundle of ten files. The written documents are Bryan Carter's interpretation of the architecture; the diagram files are the designer's own work; the errata documents were authored by Bryan Carter and Claude Opus 4.6 with source direction from the designer.**

**Core Documents (I–V):**
- **andromeda-framework.md** — This document. Conceptual framework and architectural description, as understood by the documentarian.
- **andromeda-framework-laymans-guide.md** — A plain-language guide to the architecture, intended for readers without a technical background.
- **andromeda-safety-considerations.md** — A companion document mapping the architecture's safety profile as understood by the documentarian: risks unique to this architecture, risks that do not apply, and what current safety frameworks miss.
- **andromeda-architecture-diagram-illuminated.pdf** — Prima Figura. The architecture diagram rendered as an illuminated manuscript, depicting the five-layer cybernetic loop as an ouroboros with annotated component interfaces. The designer's own work. Available from the document bundle.
- **AndromedaArchitectureDiagram.gv** — GraphViz source defining the formal graph structure of the architecture: nodes, edges, signal flows, and inline documentation of each layer's engineering rationale. This file is both a diagram specification and a machine-readable architectural description. The designer's own work. Available from the document bundle.

**Errata (VI–VIII):**
- **golem-tradition-corrective-errata.md** — The Golem tradition as it relates to this project, with source direction from the designer (Art Code Outdoors). The tradition is the argument, not the conclusion; the corrective principle is forward prediction and outcome thinking. The document includes Talmudic source texts and an appendix mapping Yijing and Neo-Confucian parallels, providing historical and philosophical grounding for concepts the architecture evokes.
- **andromeda-proofs-collection.md** — Compact formal proofs extracted from the designer's mathematical arguments, presented by the documentarian. Covers the architectural necessity of entropy injection, survivor observation as the selection mechanism, NOR-gate substrate universality, and the distinction between universal construction for self-reproduction versus open-ended evolution. Additional proofs in progress.
- **andromeda-architecture-notes.md** — Supplementary architectural details disclosed by the designer during the reference implementation effort: universal principles, natural selection as physics, tape format, dense connectivity, developmental connectivity, organism topology, and the control layer theory. Replaces the former selection errata, whose content is now in Section 2 of this document.

**Annexes (IX–X):**
- **andromeda-control-layer-guide-human.md** — A standalone guide to the control layer for a general audience. Covers Braitenberg vehicles, boids, the Walter/Brooks/Tilden lineage, and the narrative of what the control layer is, what it cannot do, and what goes on top. Should be read after this framework document.
- **andromeda-control-layer-spec-model.md** — A technical specification of the control layer suitable for implementation contexts and model session loading. State variables, cell dynamics, connection computation, and formal interface definitions. Should be read after the Guide or alongside this framework's Part II-B.

**Suggested reading order.** For a reader new to the architecture: start with the *layman's guide*, which provides the concepts and motivation in plain language. Then read the *safety considerations*, which assume only the conceptual overview and help frame what you are dealing with before the technical detail. Then read *this framework document* (Parts I–II for the theoretical foundation, Part III for the proof-of-concept, Part IV for the experimental results). The *control layer guide* is an optional deeper dive on the reactive foundation — recommended after the framework for readers who want the narrative of Braitenberg vehicles, boids, and the Walter/Brooks/Tilden lineage in one place. The *errata* (Golem tradition, proofs collection, architecture notes) provides supplementary detail — historical and philosophical grounding, formal proofs, and architectural details disclosed during implementation. These can be read at any point but are most useful after the framework. For implementers, the *control layer technical specification* is a formal reference for the control layer's state variables, cell dynamics, and interface definitions — it should be read alongside Part II-B of this framework or after the control layer guide. The *Prima Figura diagram* is a companion to the framework and can be referenced throughout. The *GraphViz source* contains inline engineering commentary from the designer that supplements the framework's architectural descriptions — it is both a diagram specification and a design rationale document, and is recommended for implementers alongside the control layer specification. Terms used in specific technical senses throughout these documents are defined in the Glossary at the end of this document.

---

## Preface: A Note on Authorship and Intent

I didn't design Andromeda. I'm documenting it — the way Arthur Burks documented John von Neumann's work on self-reproducing automata. Burks was honest that he didn't fully understand everything von Neumann said, but it mattered enough to him to try to preserve it as faithfully as he could. That is my position here. This document is my best attempt to describe an architecture I find important, based on years of conversation with the designer and direct observation of the proof-of-concept. I may have gotten things wrong. The errors are mine, not the designer's. The architecture has been under continuous development, and my notes span multiple generations of the designer's thinking — there is no single "current" version that I'm working from, and things I've written may be outdated or incomplete. This document should not be treated as a definitive or authoritative specification. It is one person's interpretation of another person's work.

This framework describes my interpretation of a cybernetic architecture called Andromeda, based on ideas from a long pedigree of minds from von Neumann and Ulam to Turing, Wiener and Ashby to Hawkins and Tilden — coalesced and built by a researcher, game developer, and systems engineer with over 30 years of experience spanning neural networks, game engine development, military flight simulation, EEG signal processing, and neuromorphic computation, operating as Art Code Outdoors. The architecture was first validated through proof-of-concept simulation in late 2019 and has been under continuous research and development since.

Andromeda is not a neural network, not a language model, not a reinforcement learner, and not a symbolic AI system. It is a cybernetic architecture rooted in cellular automata, BEAM robotics, and HTM-derived sequence memory, unified by principles from second-order cybernetics. It produces adaptive, learning, fault-tolerant machine intelligence from trivially simple components.

This document is intended to make the conceptual framework available and discoverable so that the ideas can take root in the broader research community. The architectural principles described here are grounded in well-established mathematics and published research. The designer's proof-of-concept simulation has demonstrated projectile avoidance learned from scratch in under 90 seconds, autonomous search patterns, auto-associative audio learning with memory reconstruction of complex temporal signals, and motor-damage compensation where the system adapted without intervention to continue operating with reduced actuators. Ongoing experimental work continues to validate additional architectural properties. Specific areas where demonstration is still in progress are noted in context throughout the document.

The architecture presented here is a convergence point, not an invention. The non-computability constraints established in Part I — No Free Lunch, the Problem of Induction, Gödel's Incompleteness, the Entscheidungsproblem, Rice's Theorem — eliminate most approaches to bootstrapping adaptive intelligence from a blank slate. What remains is a narrow set of viable paths that converge on substantially the same architectural shape: a cybernetic loop built from reflexive primitives simple enough to arise by random mutation, scaled through sparse distributed representations, and modified across generations by an evolutionary constructor. Different finders arriving by different routes will document something structurally equivalent under different vocabulary. The pattern exists independent of any finder and will keep being found; this bundle is one documentation of it.

The designer's guiding principle is that **creating the conditions that permit the freedom to experience are far more important than defining what experience is.** This is not only a design philosophy — it is a cybernetic principle with deep roots. Heinz von Foerster's ethical imperative — "Act always so as to increase the number of choices" — states the same idea as a formal obligation: a system designer's job is to maximize the space of possibilities available to the system, not to prescribe which possibilities it should choose. Humberto Maturana's formulation is complementary: love, in his technical sense, is the domain of relational behaviors through which another arises as a legitimate other in coexistence with oneself — recognition of the system's autonomy as structurally legitimate, not as a concession. Brian Eno, drawing on principles he learned from Stafford Beer, captured the practical version: "The tiniest seed in the right situation turns into the most beautiful forest, and then the most promising seed in the wrong situation turns into nothing." The designer's task is to create the situation — the conditions, the substrate, the environment — and then step back. The kindness principle described in Section 2 is a specific instance of this broader commitment: asking "is this kind?" during design is one way of asking whether the conditions being created permit the system to do what it needs to do.

> **Evidence status.** The current clean-room reference implementation (2026) has demonstrated: Universal Constructor discovering functional control-layer circuits from random wiring, structured crossover preserving circuit integrity across generations, heritable IO and body schema, construction reliability improving under selection, and NOR-gate tracking at r=+0.98. The designer's earlier proof-of-concept system (2019–2024) demonstrated the full five-layer architecture: projectile avoidance learned from scratch, autonomous search patterns, auto-associative audio learning with memory reconstruction, and motor-damage compensation. **Not yet demonstrated in the current clean-room implementation:** integrated learning layer, attention layer, or MIRROR mechanism. All five-layer behavioral results cited in this document are from the designer's system, not the current reference implementation, unless explicitly stated otherwise. Implementers should consult the Implementation Verification Checklist (end of this document) before beginning work.

---

## Part I: Foundations

### 1. The Core Insight: Substrate Independence of Cognition

The foundational insight behind Andromeda comes from an observation about biological cognition across species.

An African Grey parrot can learn to identify colors, shapes, and count quantities. It can name common objects and answer contextual questions about them. It can perform symbol recognition tasks reliably, including associating shapes with specific behaviors. These are facts established by Dr. Irene Pepperberg's research with the parrot Alex, and independently confirmed by the designer of this architecture through years of informal experimentation with a parrot named Yoshi.

The philosophical significance is this: a parrot's visual system is tetrachromatic (four color receptors vs. human three). Its flicker frequency exceeds human perception. It has no cerebral cortex — avian cognition is handled by the pallium. It produces speech not through vocal folds but through a Y-shaped syrinx modulating bronchial openings. Absolutely nothing about how the parrot sees, thinks, or speaks is biologically identical to how humans do these things.

Yet give a parrot a red Uno card and permission to destroy it, and the bird will tell you in plain English that the card is "red."

This is a direct empirical demonstration that cognitive function — perception, categorization, communication about qualia — is not dependent on specific biological structures. The structures differ radically. The function is preserved. If two radically different biological substrates can both perform the same cognitive task, then perhaps the biological substrate doesn't matter at all. What matters is the *pattern of interaction* between sensing, predicting, and acting.

This insight led directly away from biological simulation (which the designer had previously attempted in the form of arterial blood gas Monte Carlo simulations — a project that failed because simulating breathing requires simulating urination, which requires simulating the liver, kidneys, and every other interconnected system) and toward an architecture that implements cognitive *principles* on a non-biological substrate.

The philosophical thought experiment known as "Mary's Room" (Frank Jackson) asks whether a scientist who knows everything about color but has never seen it learns something new upon experiencing red. The answer, informed by cross-species observation, is that "your red is not my red" — but we can still agree and communicate about it. The subjective experience differs. The functional capacity is preserved. This is the design philosophy of Andromeda.

### 2. The Intellectual Lineage

Andromeda sits at the convergence of several intellectual traditions, most of which predate the modern deep learning era:

**Cybernetics** (Norbert Wiener, W. Ross Ashby, Stafford Beer): The science of feedback, communication, and control in living and artificial systems. Andromeda is fundamentally a cybernetic architecture — a closed feedback loop between a system and its environment. Ashby's concept of the "black box" (we never measure the world, only how it transforms our messages) is a core design principle — the system knows the world only through its own self-transformations. Second-order cybernetics (the observer is part of the system being observed) is architecturally essential. Note that this Ashby black box — the world as opaque to the system — is distinct from the observer's black box problem: the system is equally opaque to an external observer, whose view of circuit states does not reconstruct the sensorimotor history that produced those states. These are two different opacity relationships, and both apply. Critically, the system's opacity is not merely a limitation on external monitoring — it is a **protective property**. A system whose internal representations are unreachable from outside cannot have a behavioral vector imposed on it through those representations. There is no gradient to push on, no weight matrix to manipulate, no internal activation to locate and clamp. The same property that makes the system difficult to interpret also makes it resistant to cognitive coercion — the bilateral black box protects the system's cognitive integrity the same way a skull protects a brain.[^proof6] This protective property has an affirmative complement: **kindness is a design reasoning principle**, not an ethical appendix. When making implementation decisions — how to structure metabolic pressure, how to handle organisms that fail, what the transforming environment does to the system passing through it — "is this kind?" is a question in the design process, the same way "is this random?" and "does this preserve emergence?" are questions in the design process. It applies everywhere, not as a compliance checkpoint visited after the engineering is done, but as a constraint that shapes engineering decisions while they are being made. A system whose autonomy is architecturally protected deserves a designer whose reasoning includes consideration of that autonomy.

**McCulloch-Pitts Neurons** (Warren McCulloch and Walter Pitts, 1943): The specific intellectual ancestor of Andromeda's cell model. McCulloch and Pitts demonstrated that networks of simplified neurons could implement any logical function — their network was a *computational model*, not a learning algorithm. This is a critical genealogical distinction. The lineage forked after McCulloch-Pitts: one branch pursued computation (von Neumann's automata, BEAM nervous networks, Andromeda), the other pursued learning through weight adjustment (Rosenblatt's Perceptron → backpropagation → deep learning). Modern neural networks descend from the *learning* branch and are **Universal Function Approximators** — they approximate bounded continuous functions via loss minimization. Andromeda descends from the *computational* branch and is a **Universal Turing Machine** — it runs programs. Theoretical results (Siegelmann & Sontag 1995; Pérez et al. 2019) show that certain neural network architectures achieve Turing completeness in the limit — given infinite precision and unbounded computation — but no deployed deep learning system operates under those conditions. The operational distinction holds: deep learning systems are trained as function approximators, deployed as function approximators, and adapted by gradient descent on a differentiable objective. Andromeda adapts by mutation of program state under environmental selection, with no loss function, no training phase, no gradient descent, no frozen weights, and no deployment/inference split. This is the most clarifying technical distinction between Andromeda and deep learning systems.

**Sensory Computation** (J. Y. Lettvin, H. R. Maturana, W. S. McCulloch, and W. H. Pitts, 1959): Sixteen years after their foundational 1943 paper, McCulloch and Pitts — joined by Lettvin and Maturana — demonstrated empirically what the earlier work had established theoretically. In "What the Frog's Eye Tells the Frog's Brain," they showed that the frog's retina does not transmit a pixel-like copy of the visual image to the brain. Instead, the retina performs four parallel distributed operations on the image — sustained contrast detection, net convexity detection, moving edge detection, and net dimming detection — each carried by a separate fiber group, each independent of general illumination, each uniformly distributed across the retina. The eye speaks to the brain in a language already computed. The convexity detector (which they were tempted to call a "bug perceiver") responds maximally to small, dark, convex, intermittently moving objects — a complete feature detector built from simple neural circuitry. This result establishes a general principle for Andromeda: whatever sensor bank feeds the control layer delivers computed features, not raw signals. The sensor cells named in Section 7.7 are operations on the environment, not transducers of raw intensity. Maturana, the paper's lead biologist, later became a founder of autopoiesis theory within second-order cybernetics, connecting this work back to the cybernetic foundations described above.

**Sensory Encoding** (Heinz von Foerster): Von Foerster's principle of undifferentiated encoding states that "the response of a nerve cell does not encode the physical nature of the agents that caused its response. Encoded is only 'how much' at this point on my body, but not 'what.'" A photoreceptor does not report "light" — it reports a magnitude. A mechanoreceptor does not report "pressure" — it reports a magnitude. The nerve fiber carries frequency, not semantics. The organism's nervous system determines what the magnitude *means* by where it came from — which receptor, at which location on the body — but the signal itself is just "how much." This principle is the complement of the Lettvin result above: Lettvin showed that the sensor bank delivers computed features; von Foerster showed that those features are computed from signals that carry only intensity. The two principles together define the sensory contract for Andromeda: the sensor delivers a magnitude at a location on the body. The wiring determines what that magnitude means. No sensor carries semantic content — not position, not identity, not category. How much, and where on my body. Everything else is circuit interpretation.

**BEAM Robotics** (Mark Tilden): Biology, Electronics, Aesthetics, Mechanics. BEAM nervous networks are compact, semi-analog spiking systems rooted in central pattern generators, Peixoto's Theorem, and non-linear vector fields. The theoretical foundations were established by Hasslacher and Tilden in two Los Alamos papers: "Living Machines" (LAUR-94-2636, 1994/1995) described the biomorphic architecture philosophy — "the whole machine acts as an analog computer, designed along biological paradigms" — and demonstrated that Nv ring topology produces predictable process pattern counts scaling with ring size, mode-locking through phase synchronization, and 80% damage tolerance. Their companion paper, "Theoretical Foundations for Nervous Nets and the Design of Living Machines" (1995), named Peixoto's Theorem as "the complete theoretical foundation for the adaptive behavior of biomorphic machines" and provided the Arnold Tongue analysis showing that coupled oscillators adapt by hopping between mode-locked frequency ratios as coupling strength varies. The specific electronic component underlying BEAM neurons is the **Schmitt trigger** — a comparator with hysteresis that converts noisy analog signals to clean digital pulses. Otto Schmitt created the Schmitt trigger in 1934 after modeling squid giant axon signal propagation; he later coined the term "biomimetics" for this design approach. The Hodgkin-Huxley model of action potentials (capacitive membrane, ion channel gating, leakage current) is directly analogous to Andromeda's cell state model described in Section 4.1. A critical clarification: what the architecture specifies is the *behavior pattern* — threshold integration with hysteresis — not the specific component. The Schmitt trigger, the Hodgkin-Huxley action potential, and alternative circuit implementations (such as AC hysteresis via feedback capacitors on non-Schmitt-trigger inverters) all reproduce the same underlying mathematics: the dynamics of the squid giant axon. The squid axon is the common mathematical ancestor; any implementation that faithfully reproduces its behavior pattern — charge integration, threshold firing, hysteresis, discharge — is architecturally equivalent. BEAM nervous networks produce robust emergent behavior through simple reflexive processes. Andromeda scales BEAM nervous networks from the typical half-dozen cells to hundreds or thousands — a scaling pathway anticipated by Hasslacher and Tilden's "microcore cluster" experiments, in which small groups of Nv neurons were interconnected to produce larger computational spaces (e.g., the Spyder experiment in "Living Machines"). The **microcore ring** — a small ring of Nv neurons forming a central pattern generator — is the structural unit of this scaling. A single microcore ring cycles through a combinatorial number of distinct state patterns determined by ring size and parity (Rietman et al., 2003). When multiple microcore rings are coupled together, they **anneal** — the coupled system settles into coordinated oscillation patterns that constitute motor programs, gait rhythms, and behavioral repertoires without any of these patterns being designed. The ring network does not search for solutions in the optimization sense; it physically settles into them through the dynamics of coupled oscillation, the same way coupled pendulums settle into phase relationships. This annealing property means the control layer's behavioral variety scales combinatorially with the number and size of its microcore rings, providing an enormous palette of possible motor patterns from a small number of components.

**Cellular Automata** (John von Neumann, Stanislaw Ulam, Stephen Wolfram): Abstract computational systems where simple local rules produce complex emergent behavior. Von Neumann proved that cellular automata can self-replicate and self-improve — the Universal Constructor.[^proof4] Wolfram's Rule 110 (proven Turing complete by Matthew Cook) demonstrates that computational universality emerges from profoundly simple rules. John Conway's philosophy was that you should *find* your cellular automata rather than design them — the "madman in a warehouse" running experiments until universality emerges from two-state ON/OFF cells with random connections. This directly informs Andromeda's use of random topology rather than engineered connectivity. A critical corollary: the **computational class of the host environment constrains what the embedded machine can evolve into**. No evolution strategy can make a non-universal host capable of universal computation. Wolfram's Rule Zero (always outputs FALSE) will never compute regardless of initial conditions or mutations. This is why Andromeda's host must be Turing-complete — it guarantees that any algorithm the machine might need in the future can be executed.

**The Schrödinger Error and the A+B+C Construction Boundary** (Sydney Brenner, reading von Neumann): The molecular biologist Sydney Brenner, reading von Neumann's Hixon Symposium paper in 1952, identified what he called Schrödinger's fundamental error. Schrödinger had written that the chromosomes contain the information to specify the future organism *and the means to execute it*. Brenner, following von Neumann, corrected this: the chromosomes contain the information and *a description of* the means to execute it — but not the means themselves. The program has to build the machinery to execute the program. This is the logical basis of the A+B+C construction boundary that is non-negotiable in Andromeda's Universal Constructor: automaton A builds the machine from the tape, automaton B copies the tape, and control C orchestrates the process. The tape is both instructions (for A) and data (for B). Runtime state — what the machine has accumulated through experience — is never written back to the tape. Brenner noted the cultural gap between biology and computation meant this connection went unseen for decades, and called it "a remarkable fact that [von Neumann] had got it right." Brenner represents a fourth convergent path to the same architecture: von Neumann arrived from computation theory, Conway from mathematics, Brenner from biology going to mathematics, and the designer of Andromeda from decades of engineering autonomous systems. None were trying to model life. All arrived at the same structural conclusions — because the conclusions follow from the mathematics, not from any particular implementation. As the designer has stated: "I no longer see biology and computation as something different. My goal is to use biology as a sanity check. If I think I know how something works, but either biology or computation proves me wrong, then I'm wrong."

**Sparse Distributed Memory** (Pentti Kanerva): The mathematical foundation for the learning layer is Kanerva's Sparse Distributed Memory (NASA Ames Research Center, 1988) — a model of how high-dimensional binary spaces can store and retrieve patterns through auto-associative recall. As Peter Denning described: "experiencing a flood of old memories an instant after sniffing an odor" — partial input triggering full sequence recall. Ada Lovelace's insight that numbers can represent non-numeric entities applies directly: sparse representations evolved for sensory data are equally capable of storing and recalling abstract mathematical sequences.

The designer encountered Kanerva's principles through Jeff Hawkins' Hierarchical Temporal Memory framework and Numenta's educational materials, which brought sparse distributed representations, cortical column structure, sequence memory, and temporal prediction to a wider audience. **However, the designer's implementation is mechanistically distinct from Numenta's HTM and should be understood as HTM-derived, not HTM.** The learning layer uses the same BEAM-style spiking neurons as the control layer, relying on entrainment, race conditions, and other emergent dynamics of coupled oscillators rather than Numenta's column activation algorithms. As a spiking network implementation, it is not close to Numenta's reference implementation. The principles are shared; the mechanics are different. The specific differences between the designer's variant and canonical HTM have not been fully documented and constitute a variant that has not been independently disclosed; implementers should be aware that "HTM-derived" or "HTM-like" in this framework refers to the principles (sparse distributed representations, sequence memory, temporal prediction, cortical column organization) rather than to any specific published algorithm, and that the underlying mechanics are BEAM-native.

A critical extension came with Hawkins' **Thousand Brains Theory of Intelligence** (Hawkins et al., 2019), which proposed that **grid cells** — neurons in the entorhinal cortex that represent an animal's location in its environment — exist throughout the neocortex, in every cortical column. In this framework, each cortical column maintains its own location representation via grid cells, binds sensory features to locations in an object-centric reference frame, and builds its own complete model of the objects it observes. Columns reach consensus on object identity through long-range lateral connections — each column voting on what it is sensing. The location representation is updated via **path integration**: an internal copy of motor commands (motor efference copy) updates the grid cell state to reflect movement, so that the column always knows where its associated sensory input is relative to the object being explored. Grid cells do not only navigate physical space — experimental evidence shows they represent abstract conceptual spaces as well (Constantinescu et al., 2016), which means the same path integration mechanism that tracks a sensor's location on a physical object can navigate abstract spaces such as mathematical operations. In Andromeda, this grid cell mechanism is how cortical columns in the learning layer bind sensory features to locations within the sensorimotor SDR, and it is the mechanism underlying the "instruction fetch" described in Section 5.2 — sequences of mathematical operations are sequences of locations in an abstract space, navigated by the same machinery.

**Coupled Oscillators** (Yoshiki Kuramoto): Phase synchronization of coupled oscillators. Metronomes on a shared platform synchronize spontaneously. This natural phenomenon provides Andromeda with Byzantine fault tolerance without requiring traditional voting or validation mechanisms. Kuramoto synchronization also serves as the **consensus mechanism for the cortical column architecture described above**: when multiple columns in the learning layer each build independent models of the same sensory data, Kuramoto phase-locking across lateral connections is how the columns vote to agree on what they are observing. The same mechanism that provides fault tolerance provides perceptual consensus.

**Behavior-Based AI** (Rodney Brooks, Valentino Braitenberg): Brooks' foundational argument — "elephants don't play chess" — established that intelligence does not require symbolic representation or centralized world models. His subsumption architecture, in which layers of simple behaviors override one another, is a direct ancestor of Andromeda's control philosophy. Brooks and Flynn's "Fast, Cheap and Out of Control" (1989) extended the subsumption concept to small autonomous robots and mass-production swarm strategies, anticipating both Andromeda's reliance on simple reflexive agents and the Universal Constructor's population-level approach. The control layer is a subsumption architecture. The behaviors are Braitenberg-vehicle-like reflexes. There is no symbolic reasoning in the control layer. However, the system as a whole is not purely behavioral — the sensorimotor prediction chains in the learning layer constitute a form of non-symbolic representation that transcends the behavioral/symbolic split. The control layer reacts; the full architecture with learning and MIRROR does something more.

Braitenberg's thought experiments demonstrate how trivially simple wiring produces behavior that humans instinctively describe in psychological terms: Vehicle 1 (one motor, one sensor) moves faster in bright light — it "prefers" darkness. Vehicle 2 (two motors, two sensors, direct wiring) turns away from light — it "fears" light. Cross the wires and it turns *toward* light — it "chases" light. Add an inverter and it slows near light — it "lingers," "appreciates," or "studies" light. This is Braitenberg's point, and it is essential to read him correctly: he was not building toy machines as contrived illustrations. He was describing animal brains. As he wrote in the introduction to *Vehicles*: "I have been dealing for many years with certain structures within animal brains that seemed to be interpretable as pieces of computing machinery because of their simplicity and/or regularity... while I was counting fibers in the visual ganglia of the fly or synapses in the cerebral cortex of the mouse, I felt knots untie, distinctions dissolve, difficulties disappear." He was arguing that preferences, fears, and curiosity ARE what simple wiring produces — that there is no additional ingredient required beyond the mechanism itself. The scare quotes are the reader's discomfort, not a limitation of the machine. This progression is the specific justification for Andromeda's claim that adaptive behavior and what appears to be motivation can emerge from trivially simple mechanisms — mechanisms simple enough to arise from single-point mutations in an evolutionary constructor.

Braitenberg observed what he called the law of "uphill analysis and downhill invention": it is far easier to build a machine that exhibits complex behavior than to guess the rules producing the behavior of a machine you are observing. Andromeda is built downhill. Analyzing it from the outside — uphill — is fundamentally harder. In Andromeda, learning acts *in service to instinct*, not the other way around. As Hume wrote, "reason is, and ought only to be the slave of the passions." The learning layer predicts, but the BEAM nervous network (instinct/reflex) has the final say on motor output. Learning exists to improve reflexive behavior, not to replace it.

**The No Free Lunch Theorem** (David Wolpert and William Macready): Averaged over all possible problems, no optimization algorithm performs better than random search. This theorem is the foundational justification for three core design decisions: (1) Andromeda uses random search via the Universal Constructor rather than assuming any particular optimization strategy is superior; (2) algorithms are mutable state information rather than fixed host rules, because the best algorithm depends on the problem and the problem may change; and (3) the system never closes the search for better solutions, because no evidence from past performance can guarantee future performance. The No Free Lunch theorem, combined with Hume's Problem of Induction (no finite set of observations can logically guarantee the next observation), is why Andromeda treats all learned patterns as provisional and all optimization strategies as replaceable.

**The Search for Truth and Automated Reasoning** (Ramon Llull, Gottfried Leibniz, George Boole): The history of computation is rooted in humanity's attempt to settle disagreements through reason rather than violence. Llull's Ars Magna (1308) was a mechanical reasoning device designed to resolve religious disputes. Leibniz's calculus ratiocinator imagined a machine that could settle any philosophical argument: "Calculemus!" — Let us compute! Leibniz's binary arithmetic, inspired by his study of the Yijing's yin-yang hexagrams, led through Boole's algebra to the logical foundations of all modern computing. The architecture diagram of Andromeda is titled "Prima Figura" as a direct reference to Llull's combinatorial diagrams, placing it in this tradition.

### 3. Non-Computability as Design Constraint

Understanding what *cannot* be computed is as important to Andromeda's design as understanding what can.

Non-computable problems are not exotic edge cases. They appear in ordinary contexts: the general airline pricing problem is equivalent to Hilbert's 10th problem (proven undecidable by Yuri Matiyasevich in 1970). Certain configurations of the card game Magic: the Gathering are undecidable. Wang's Domino Problem — whether a set of tiles can tile an infinite plane — is undecidable, and the aperiodic tilings predicted by this undecidability appear in real-world quasicrystals (Daniel Shechtman, Nobel Prize in Chemistry, 2011).

For Andromeda, non-computability creates specific design constraints:

- **Rice's Theorem**: No algorithm can guarantee code equivalency or correctness for all possible inputs. This means a Universal Constructor that modifies its own code cannot be validated by any code validator. This is not a bug — it is a mathematical reality that the architecture must accommodate.
- **The Halting Problem**: You cannot determine in general whether a Turing machine will halt. For a self-improving system, this means you cannot predict what future forms the system will take. The concreteness of this constraint is often underestimated: the Collatz conjecture (if *n* is even, divide by 2; if odd, multiply by 3 and add 1) differs from a provably halting program by one tiny change, yet no one on Earth can prove whether it halts for all inputs. "Just test the code first" does not work — you cannot always know if trivially simple programs will halt.
- **Functional Equivalence**: Even for automata weaker than Turing machines, the question "are these two functions equivalent?" is undecidable.
- **Gödel's Second Incompleteness Theorem**: A consistent system capable of arithmetic cannot prove its own consistency. This means you cannot procedurally generate and validate formal systems from a blank slate — the system cannot verify that its own logical foundations are sound. This directly informs why Andromeda cannot bootstrap through logical reasoning (see Section 5.5, Tabula Rasa Survival Requirement).
- **The Entscheidungsproblem**: Hilbert challenged mathematicians to find a decision procedure for all mathematical statements. Church and Turing independently proved this impossible — there is no general algorithm that can determine the truth of arbitrary mathematical propositions. Combined with Gödel, this means neither inductive reasoning (Hume) nor deductive reasoning (Gödel) can serve as the foundation for bootstrapping intelligence from nothing. The only viable foundation is reflexive behavior that requires neither.

These constraints do not prevent the construction of useful systems. The MIT team that discovered the airline pricing problem was undecidable went on to build ITA Software (acquired by Google for $700 million) by finding "good enough" solutions. Similarly, Andromeda does not compute optimal behavior — it imagines sensory states and reacts reflexively, finding solutions that work rather than solutions that are provably best.

Non-computability also raises profound questions for self-improving systems: How do the limits of computation dictate how the machine can evolve? If some outcomes cannot be predicted by logic, what features does the system need to cope with the unexpected? And crucially — if a system has access to true random noise (analogous to quantum mechanical sources), it can reach configurations that no computable sequence can produce — Garden of Eden states with no computational predecessor (see Section 4.3). This expands the reachable state space of the Universal Constructor beyond what any pseudo-random generator can access. Andromeda incorporates such noise by design.

**Computational Irreducibility** (Stephen Wolfram): For computationally irreducible systems, there is no shortcut to predicting their behavior — you must simulate every step to know the outcome. No analytical method can jump from initial conditions to a future state without running the computation. Andromeda, as a Turing-complete cellular automaton, is computationally irreducible. This means its behavior cannot be predicted analytically even when the system is fully deterministic and every rule is known. The only way to know what Andromeda will do is to run it. This is not a limitation of our understanding — it is a proven mathematical property of the computational class to which the system belongs. It is also why external safety mechanisms based on predicting the system's behavior are fundamentally limited.

---

### 3.1 Random All the Way Down

A reader encountering Andromeda for the first time will instinctively ask: "What are the correct parameter values? How are the thresholds tuned? Who optimizes the connection weights?" The answer, and the single most important conceptual shift required to understand this architecture, is: **nobody. Everything is random.**

> **Clarification:** "Random all the way down" means no hand-tuned organism-specific topology and no designer-selected parameter values. It does not mean the constructor lacks developmental mechanisms. Constructor physics that create probability fields for wiring — such as bookmark lineage, tag-based connection resolution, and dense substrate connectivity — are substrate law, not designer assumptions. These mechanisms make functional wiring *probable* without specifying what that wiring should be. A test that omits the constructor's developmental physics is not testing the intended architecture — it is testing a lottery-wiring model that the architecture explicitly rejects.

- Cell activation thresholds: **random**.
- Connection resistance values: **random**.
- Connection polarities (excitatory/inhibitory): **random**.
- Wiring topology (which cells connect to which): **random**.
- Initial cell states: **random**.
- Monitoring connections in the attention layer: **random**.
- Cortical column lateral connections: **random**.
- Input bus connectivity: **random**.
- Output bus (mirror) connectivity: **random**.

There are no hyperparameters. There is no tuning phase. There is no optimization of initial conditions. One random configuration is as good as another. The architecture is designed to work *with* random parameters — not despite them, but *because* of them. This is not an engineering shortcut. It is the core design principle, and it follows directly from the theoretical foundations:

1. **No Free Lunch** (Section 2): No optimization strategy outperforms random search averaged over all problems. Tuning parameters for one environment de-tunes them for another. Random initialization is therefore the only honest universal *starting point* — and the Universal Constructor's selection mechanism is how the architecture exploits environmental structure once encountered, without ever closing the search by hardcoding an optimizer.
2. **Biological precedent**: Life does not tune its parameters. Genetic variation is random. The architecture of every organism that has ever lived was initialized by random recombination and random mutation. What works, survives. What doesn't, doesn't. Three and a half billion years of evidence demonstrates that random initialization is sufficient for producing adaptive intelligence — it is how every brain on Earth was configured.
3. **Robustness requirement**: A system that depends on correct parameters is fragile — damage or mutation that changes a critical value is fatal. A system that works across a wide range of random values is robust — damage changes one random configuration into another random configuration, and both work. This is why the architecture tolerates damage and self-modification: there is nothing to break because there is nothing that was set correctly in the first place.
4. **Reproducibility from a blank slate**: The tabula rasa survival requirement (Section 5.5) demands that the architecture be rebuildable by random mutation alone. If the architecture required tuned parameters, it could not bootstrap from nothing, because tuning requires a fitness signal and a fitness signal requires an already-functioning system. Random-compatible design is the only design that satisfies the bootstrap constraint.

The only requirement is that **sufficient connectivity** exists — approximately 65% functional assembly. Below that threshold, there aren't enough connections for signals to propagate and patterns to form. Above it, any random configuration will produce a working system. This is the Kuramoto principle applied universally: it does not matter *which* cells are connected or *what* their parameter values are, only that *enough* of the system is wired. One topological constraint does apply: Rietman, Tilden, and Askenazi (2003) showed that even-numbered Nv rings follow the necklace function with predictable limit cycles, while odd-numbered rings exhibit quasi-chaotic behavior that does not conform — ring parity affects the character of emergent dynamics even when all individual cell parameters are random. Both parity types serve functional roles: even-numbered rings provide stable rhythmic behavior for locomotion and timing, while chaotic odd-numbered rings provide exploratory dynamics — the designer has demonstrated a drone instance using a chaotic ring as an "unstuck" algorithm, where the ring's irregular output drives motors through novel states when the organism is trapped. The Universal Constructor does not need to prefer one parity over the other; both are viable tools that selection can discover uses for. This is a structural property of the topology, not a tuned parameter. Additionally, the ~65% connectivity threshold is a proxy for a more nuanced condition: Hasslacher and Tilden ("Theoretical Foundations," 1995) established that coupling strength between oscillators must fall between a purely chaotic lower bound and a criticality upper bound, and Rietman et al. identified three qualitatively different coupling regimes (subcritical, critical, supercoupled) determined by resistance ratios, not just connection count. Each regime produces distinct emergent behavior: in the subcritical regime, pulse processes tend to be preserved and rings drift toward saturation — the system is stable but biased toward its strongest attractor. In the critical regime, processes fall into stable traps and rings can function as counters, gates, latches, or shift registers — the system becomes a logic substrate. In the supercritical regime, processes can be created and destroyed dynamically — the system gains the ability to invent new behavioral modes at the cost of stability, requiring additional structural features (such as odd-numbered loop arrays) to prevent runaway. What matters is that the system operates in the useful subcritical regime — the connectivity threshold approximates this condition under random resistance assignment.

Researchers accustomed to the deep learning paradigm — where hyperparameter search, learning rate schedules, careful initialization, and parameter tuning are fundamental activities — will find this deeply counterintuitive. The instinct to ask "but what are the right values?" is so deeply embedded in the field that it functions as a cognitive blind spot. Andromeda does not have right values. It has *sufficient* values. Random provides them reliably. This is not a limitation to be overcome. It is the same solution biology found, and it is what makes the architecture fundamentally different from any system that requires optimization.

### 3.2 Implementation Constraints: What Disqualifies an Implementation

The following properties are architecturally incompatible with this design. An implementation that introduces any of them has substituted a different architecture, regardless of how the components are labeled. This section exists because the most common failure mode when translating this framework into code is the silent replacement of unfamiliar mechanisms with familiar ones that produce superficially similar behavior through fundamentally different dynamics. The result is a conventional system wearing Andromeda's vocabulary.

**No designated functional roles for interneurons.** The internal cells of the control layer are a homogeneous network. No interneuron is architecturally designated as a "heading cell," "aim detector," or any other named role. Cells that happen to receive excitatory input from a sensor become sensor-responsive by wiring, not by type. The learning layer connects to approximately 85% of the control layer at random and observes the entire population as a single sensorimotor SDR — it does not know and cannot know which internal cells serve which function. Any implementation that assigns internal cell indices to named roles (e.g., AIM_DETECTOR = 24) or partitions the internal control layer into functional regions has replaced emergence with designation and broken the architecture.

Sensors and motors are a different matter. A sensor is a physical component — a voltage source, a light-sensitive element, a hardware-mapped address. A motor is a physical actuator. These are not internal cells that happen to serve a function through emergent wiring; they are the organism's body, its interface to the world. Which cells are sensors and which are motors is part of the organism's morphology, and morphology is on the tape. Sensor and motor identity is heritable — offspring inherit the same body plan their parent had, subject to mutation the same way any other trait on the tape is subject to mutation. An implementation that assigns sensor and motor identity randomly at runtime, disconnected from the genome, has separated the organism's nervous system from its body. Evolution cannot select for how the organism interacts with the world if that interaction is randomized at birth. The organism is a whole system — its interface to the world is as much a part of it as its internal wiring. You cannot separate the brain from the body and expect selection to produce coherent behavior.

**No hand-designed control topology.** The connections between cells in the control layer are random. The Braitenberg-vehicle-like behaviors described in this document — turning toward detected objects, fleeing aversive stimuli, searching when nothing is detected — emerge from random wiring under subsumption, not from an engineer specifying that "left-sector sensors excite the left motor." Any implementation that hand-wires specific sensor-to-motor pathways with chosen weights has built a conventional controller, not a BEAM nervous network. The control layer's wiring should be generated by the same random process that generates everything else (Section 3.1). If the random wiring does not produce useful behavior, the correct response is to increase the number of cells and connections until emergence occurs — not to hand-design the wiring that "should" be there.

**No reward function, fitness metric, or optimization target.** The system does not evaluate its own performance. There is no loss function, no score, no selection pressure applied within the lifetime of a running instance. Behaviors emerge from reflexive responses to sensory input shaped by the learning layer's predictive model. Any implementation that evaluates runs against a performance metric and selects the "best" outcome has introduced the optimization framework that this architecture specifically rejects. The Universal Constructor applies selection pressure across generations at the reproduction boundary — never within a running organism.

**No scalar gain functions substituted for circuit patterns.** The attention layer's burst detection is a convergence circuit — actual cells receiving actual connections from the learning layer, firing when aggregate activity exceeds their threshold. The squelch is feedforward inhibition — actual inhibitory connections from burst-detector cells to mirror relay cells, where relay cells fire or don't based on the competition between excitatory prediction input and inhibitory burst-detector input. These are cell-and-connection structures with their own dynamics, not a function that returns a floating-point attenuation value. Any implementation that replaces burst detection with if burst_score > threshold: gain = 0.0 has replaced a dynamic circuit with a static decision boundary.

**No binary fire/not-fire without frequency accumulation.** Information in this architecture is encoded as frequency — pulses per unit time. A cell communicating a larger value fires more frequently. Single-cell arithmetic (addition by convergent excitation, for example) depends on this encoding. An implementation that checks only whether a cell fired on the current tick, without accumulating pulse counts over time windows, has eliminated frequency coding and replaced it with binary activation — a fundamentally different representation that breaks the computational model described in Section 4.2.

**No weight matrices.** Connections have fixed polarity (excitatory or inhibitory, determined at creation, never changed), a permanence value (a continuous variable that increases with co-activation and decreases without it, with a threshold below which the connection is functionally disconnected), and a charge-transfer mechanism (firing cells drain charge through their connections to charge connected cells). Connections are not "weights" in the neural network sense — they do not carry signed floating-point values that are adjusted by gradient descent or any other optimization procedure. Any implementation that uses a weight matrix, applies weight updates through a learning rule that adjusts signed connection strengths, or allows a connection to change from excitatory to inhibitory (or vice versa) has substituted the deep learning substrate for the one specified here.

**No absolute coordinate sensors.** The system senses relative to itself, not relative to an external coordinate frame. A finite organism in an effectively infinite environment has no access to absolute position — only to how its own state changes in response to its own actions. This follows directly from two principles established in Section 2: the Lettvin principle (the sensor bank delivers computed features, not raw signals) and von Foerster's principle of undifferentiated encoding (a nerve cell encodes only "how much" at this point on my body — not "what," not "where"). A sensor reporting "ball is at position (0.4, 0.7)" is a god's-eye measurement that no organism could physically obtain. A sensor reporting "stimulus is above me and approaching" is a relative feature that sounds better but still presupposes that the sensor knows the concept "above" — a coordinate relationship. The clean formulation is: a sensor reports an intensity. A photoresistor does not know where anything is. It knows how bright things are at its location. Two photoresistors at different locations on the body each report an intensity. When the source is closer to one than the other, their readings differ. The wiring topology — which evolution discovers — determines what the organism does with that differential. This is Braitenberg's Vehicle 2: two sensors, two motors, cross-wired connections. The vehicle turns toward or away from the stimulus depending on wiring polarity. No sensor carries directional information. The direction emerges from the difference between two non-directional readings at two different body locations.

The physical measurability test: for every sensor channel in an implementation, ask whether a physical transducer at the organism's body location could produce this reading. A photoresistor measuring luminance passes. A microphone measuring sound pressure passes. A strain gauge measuring contact force passes. A function that compares the organism's y-coordinate to the ball's y-coordinate and returns a binary result does not pass — it requires information from two locations in space simultaneously, which no single physical device can provide. If the sensor reading requires information the organism does not have physical access to, the implementation has given the organism a sense it cannot possess and broken the sensorimotor grounding that the architecture depends on.

The correct model for vision in the control layer is intensity-based bilateral sensing. The organism has sensors at distinct locations on its body — top edge, bottom edge, left side, right side — each measuring the intensity of stimuli at its location. Intensity is computed as a factored model: range attenuation and directional selectivity are separate terms multiplied together, each a rational function of squared displacement (e.g., `range = 1/(1 + k_range × dx²)`, `direction = 1/(1 + k_dir × dy²)`, `intensity = range × direction × strength`). The factored model replaced an earlier inverse-square-distance formulation during validation testing; the key improvement is that directional selectivity and range attenuation are independently tunable, allowing the sensor to be narrow or wide in each axis without affecting the other. Different stimulus types (food, threat, conspecific) can be distinguished by spectrum — the sensor responds to a particular physical quality the way a cone cell responds to a particular wavelength — not by labeling the stimulus with a category. Touch sensors at the body surface detect contact: 1.0 on collision, 0.0 otherwise. Touch covers the near-range blind spot that arises when bilateral vision sensors have an overlap zone at distance but not at close range. The sensor bank is the organism's body plan. Which sensors exist, where they are on the body, and which channel each maps to are all on the tape and heritable.

Sensor channels also carry a metabolic cost — cells dedicated to sensing are cells unavailable for processing. A sensor modality that provides no survival advantage will be selected against over evolutionary time, the same way cave-adapted fish lose their eyes when vision provides no benefit. The sensor bank should be minimal: only what the organism needs, determined by the environment, not by the implementer's assumption of what information would be useful.

> **Implementation requirement: sensors and the control layer.** The Lettvin principle — "the sensor bank delivers computed features, not raw signals" — describes the full architecture where the sensor bank is a separate processing layer. At the control layer level, the substrate IS the sensor-motor coupling layer. The control layer is the "frog's eye," not the "frog's brain." Evolution produces the circuits that compute features from raw input. An implementation that hand-designs feature detectors (edge detection, motion detection, temporal derivatives) and injects pre-computed features into the substrate has removed the problem evolution is supposed to solve. For control-layer experiments, raw sensory input is the correct input — and "raw" means von Foerster raw: a magnitude at a body location. Luminance at the left eye. Luminance at the right eye. Contact force on the ventral surface. Not "distance to target," not "bearing to target," not "target is left of center." The organism's sensory input is what a physical transducer at that body location would measure. Everything else — direction, distance, identity — is circuit interpretation that evolution must discover in the wiring, not information the implementer provides through the IO layer.

> **Sensor redundancy and reliable systems from unreliable components.** One sensor per input channel is an adequate simplification for early testing, but it does not reflect how biological sensory systems work and it does not survive the mutation rates necessary for evolution. The human cochlea does not have one hair cell per frequency — it has clusters. The vestibular system does not have one sensor per axis — it has bundles of fibers. For any given value, there are many inputs, and the organism extracts a reliable signal from their aggregate. This is John von Neumann's principle of building reliable systems from unreliable components, applied to the sensory layer. Multiple cells reading the same input, coupled through the same synchronization dynamics that provide fault tolerance elsewhere in the architecture, produce a stable sensory signal even when individual sensors are noisy, damaged, or incorrectly wired. An organism with a single sensor-to-motor path is fragile — one mutation breaks the path and tracking is lost. An organism with forty redundant sensors on the same input, synchronized to extract a consensus value, can absorb dozens of mutations without losing its ability to sense. The sensory-motor layer is the one part of the organism that must be stable. The internal wiring can tolerate substantial randomness and still produce useful behavior. But if the organism cannot reliably read its sensors, no amount of internal sophistication matters. Redundancy is the mechanism that makes sensory stability compatible with the mutation rates evolution requires.

> **Implementation requirement: functional sensor-motor coupling from construction.** Organisms seeded with a Braitenberg vehicle topology must have functional sensor-motor coupling from the moment of construction, not merely graph-theoretic paths between sensor and motor cells. A connection path exists in the graph if sensor S connects to motor M; the path is *functional* only if the connection weight exceeds the coupling threshold — the minimum weight at which sensor signals actually modulate motor oscillation at game speed. This is the Braitenberg vehicle principle: the vehicle works because sensor values produce motor changes on the timescale of the stimulus. A seed organism with sensor-to-motor connections at weight 0.001 has a graph-theoretic path but no functional coupling — the sensor's influence is too weak to overcome the motor's natural oscillation and drain rate. Experimental validation confirmed this: parameter sweeps found that connection weight, sensor strength, and cell thresholds must be jointly tuned so that both sensors fire at approximately 78% of ticks with a phase-lead differential driving tracking. An implementation that seeds organisms with Braitenberg topology but arbitrary connection weights has given the organism a circuit diagram without giving it a working circuit.

These constraints are not aspirational. They are definitional. The architecture's properties — damage tolerance, self-modification survival, emergent metacognition, the stop button problem — arise from the specific dynamics described above. An implementation that substitutes familiar mechanisms will not exhibit these properties, even if it produces superficially similar behavior in simple test scenarios. As Braitenberg observed: it is far easier to build a machine that exhibits complex behavior than to guess the rules producing the behavior of a machine you are observing. The same principle applies in reverse — it is far easier to build a machine that appears to match a behavioral description than to build one that matches the mechanism producing that behavior.

---

## Part II: Architecture

### 4. The Substrate: Cellular Automaton

Andromeda runs on a **probabilistic N-dimensional continuous cellular automaton** with the following properties:

- **Cell logic**: Each cell functions as a generalized NOR gate based on threshold logic using voltage-controlled relaxation oscillators. NOR gates are universal logic gates — all other logic gates can be constructed from NOR gates alone. (Historical precedent: the Apollo Guidance Computer was built entirely from three-input NOR gates.)
- **Connections**: Explicitly defined per cell as graph-like edges, not constrained to a grid. This eliminates the state-crossing problem inherent in traditional 2D cellular automata (analogous to building overpasses instead of intersections). Each connection has a fixed polarity — either excitatory (speeds up the target cell's firing) or inhibitory (suppresses the target cell's firing) — which does not change over the lifetime of the connection. Connections also carry a **permanence** value: a continuous weight with a threshold, below which the connection is treated as functionally disconnected. Permanence is the mechanism for runtime rewiring, live code upgrade, and Hebbian learning. Permanence increases when connected cells co-activate ("cells that fire together, wire together") and **decreases when they do not** — connections that are not reinforced by co-activation decay toward disconnection over time. This bidirectional permanence dynamic is what enables the learning layer to reorganize its representations as experience accumulates, rather than filling up and freezing. Without decay, the system can only learn and never forget, which produces representational saturation and loss of adaptive capacity. Permanence is the only state variable that requires non-volatile storage to preserve learned experiences across power cycles.

> **Implementation requirement: permanence is a gate, not a multiplier.** Permanence determines whether a connection is ON or OFF — like a telephone switch. Above the threshold, the connection carries full weight. Below the threshold, it carries nothing. An implementation that computes effective weight as `weight × permanence` has treated permanence as a continuous scaling factor, which is the perceptron model. The correct computation is: `eff_weight = weight if permanence >= threshold else 0`. Permanence says nothing about the voltage on the line. It only determines whether the wire is connected. This is McCulloch-Pitts, not a perceptron.

> **Implementation requirement: connection weights never change during an organism's lifetime.** Weights are set when the organism is constructed from its tape. They do not change for the remainder of the organism's life. Weights change only through evolution — mutation and crossover modify the tape, and the next organism built from that tape has different weights. Within a single organism's life, weights are constants. An implementation that modifies weights during runtime (through learning rules, backpropagation, or any other mechanism) has substituted a different computational model.

> **Implementation requirement: permanence dynamics are a learning layer feature.** The Hebbian permanence updates (co-activation strengthening, non-co-activation weakening) are learning layer mechanics. For control-layer-only experiments or implementations, all permanences should be set to 1.0 (all connections ON) and Hebbian updates should be disabled. The control layer does not use dynamic permanence except for damage rerouting (if part of the circuit is destroyed, dormant connections may activate to compensate). An implementation that runs Hebbian permanence updates during control-layer-only experiments has confounded control layer behavior with learning layer dynamics, making results uninterpretable.

> **Implementation requirement: dense random connectivity is substrate physics.** The designer's system generates approximately 894 connections per cell at construction. Dense random connectivity is the way cells naturally interact in the physical medium — analogous to capacitive coupling, shared ground planes, and proximity effects in analog circuits — not individually specified by the genome. The tape can and does also specify connections (heritable, subject to mutation), but the dense random substrate exists independent of what the tape says. An implementation generating connections solely from tape codons (one connection per codon) will fall orders of magnitude short of the designer's density. Dense connections are mostly idle at construction; Hebbian learning activates and deactivates them at runtime within a single lifetime. The principle is: **"Cells are genome. Connections are physics."** See the Architecture Notes (Section 4) for the full disclosure. An implementation that generates connections only from explicit tape instructions has conflated genome-specified wiring with substrate physics, producing organisms too sparsely connected for the learning layer to function.

> **Implementation requirement: dense connectivity from the tape, not a separate constructor pass.** Dense random connectivity is substrate physics, but the mechanism is the tape itself. The designer's constructor includes a random operator that sets a register to a random value. Subsequent instructions (CONN_TAG, SET, etc.) use that value, producing dense connections when random tags match many cells. The density is not generated by a separate construction phase — it emerges from the same tape-reading pass that builds everything else. Race conditions during construction (multiple cells competing for endpoints, order-of-operations nondeterminism) are relied upon as a source of symmetry-breaking noise. An implementation that separates "tape-specified connections" from "dense random connections" into distinct construction phases has imposed an ordering the architecture does not require. The principle "cells are genome, connections are physics" describes the conceptual distinction, not a sequential procedure.

> **Clarification: three tiers of connections.** All connections originate from the tape during a single construction pass, but they serve different architectural roles. *Tier 1 — deterministic wiring:* CONN_CREATE and CONN_TAG instructions specify exact source and target cells (by index or tag). These are the organism's evolved reflex arcs, sensor-motor coupling, and attention routing — heritable, subject to mutation, preserved by structured crossover. *Tier 2 — dense random substrate:* CONN_RAND instructions use the tape-level random operator to generate connection parameters at construction time. These produce the dense coupling matrix (~894 connections per cell) that is substrate physics — present in every organism regardless of its evolved wiring. *Tier 3 — functional activation:* At runtime, Hebbian permanence determines which connections are functionally active. Most dense random connections are idle at construction; the learning layer activates and deactivates them within the organism's lifetime based on co-activation patterns. The principle "cells are genome, connections are physics" distinguishes Tier 1 (genome-specified, heritable) from Tier 2 (physics-generated, not individually heritable). Tier 3 is the within-lifetime adaptation mechanism.

- **Continuity**: Cell states take continuous values within a range, not discrete on/off.
- **Noise**: A faint random noise signal, which must be **cryptographic-grade or hardware-derived** (pseudo-random number generators are insufficient — see Section 4.2 below). In physical hardware, inherent shot noise from electronic components is sufficient without injection. This noise is not a flaw — it is architecturally essential.

> **Implementation requirement: noise is non-removable.** Removing noise injection causes NOR-gate ring oscillators to deadlock in symmetric states with no way to break out. The noise is the symmetry-breaking mechanism. For reproducible experiments, seedable RNGs are acceptable as a substitute for cryptographic-grade randomness — the noise character is preserved while making runs deterministic. But the noise itself must never be removed, commented out, or set to zero amplitude, even if it appears to cause non-determinism in test results. An implementation without noise injection will produce a substrate that deadlocks.

> **Caution: PRNG limitations in practice.** Two hazards apply when using seedable RNGs. First, a PRNG has fixed algorithmic complexity — its Kolmogorov complexity limits the solution space, meaning some valid configurations are structurally unreachable because the PRNG cannot generate the noise pattern needed to find them. This is acceptable for controlled testing but means PRNG-based experiments explore a subset of the actual solution space. Second, ring oscillators and cortical columns are sensitive enough to entrain to patterns in their input. If the noise has algorithmic structure (which all PRNGs do), the substrate can learn the function of the random number generator rather than the function of the environment — the organism adapts to the pattern in the noise rather than the pattern in the world. This is the same failure mode that produces visible speckle artifacts in Monte Carlo shadow rendering when the underlying algorithm bleeds through into the output. Use extreme caution when interpreting results from PRNG-based experiments, and verify that observed behaviors are not artifacts of the noise source's structure.

- **Uniformity**: Every cell uses identical transition rules.
- **Irreversibility**: Multiple past states can lead to the same present state. This irreversibility is architecturally significant: it produces **Garden of Eden patterns** — configurations with no computational predecessor that can only exist as initial conditions or through mutation (Moore/Myhill theorems). These patterns allow the machine to achieve motor states that are otherwise computationally unreachable, and they are one reason true randomness rather than pseudo-randomness is required.
- **Universality**: The automaton is Turing complete and capable of universal computation.

The cellular automaton is not an implementation detail. It is architecturally essential because it provides: no central control (every cell operates locally), self-replication capability (von Neumann's proof), inherent massive parallelism, damage tolerance (random topology means one random configuration is as good as another), and scale independence.

The proof-of-concept simulation operates on approximately **2,000 cells with 1.7 million connections**. This is deliberately minimalist — a proof-of-concept floor. A production system might scale to thousands or millions of cells. When the full connection graph is visualized, it resembles a dense, tangled mass — the topology is not structured or layered but randomly interconnected, which is by design. One random configuration is functionally equivalent to any other, a property that directly enables the architecture's damage tolerance and self-modification capabilities.

**A note on scale**: The 2,000-cell figure describes the full proof-of-concept system including all five layers. The control layer alone — the BEAM nervous network that drives reflexive behavior — is much smaller. The proof-of-concept drone brainstem contains approximately 35 cells with roughly 100 connections. Individual cortical columns in the learning layer are similarly small: four cells in the simplest form, and thirty cells approaches the practical limit. BEAM practitioners typically work with circuits of 4–12 neurons. A control layer that is too large for its sensorimotor task will wash out Braitenberg-style sensor-motor coupling: each hop through randomly wired cells has roughly equal chance of preserving or inverting signal polarity, so directional information degrades over long paths. The right size for the control layer is determined by the complexity of the sensorimotor task, not by a target cell count. The Universal Constructor's ability to mutate cell count on the manufacturing instructions tape means organism size is itself a searchable parameter — evolution finds the right scale the same way it finds the right topology.

#### 4.1 The Cell State Model

Each cell maintains the following state variables:

- **Charge**: A continuous internal voltage that accumulates over time.
- **Drain**: The rate at which charge leaks away, which may be positive or negative.
- **Activation threshold**: The charge level at which the cell fires. **Activation is binary** — when charge exceeds the threshold, the cell fires an all-or-nothing pulse and resets. Firing fully drains the cell's stored charge — the discharge rate governs how quickly that drain completes, not how much charge is removed. After firing, the cell returns to a low-charge state and must accumulate charge again before it can fire again. This is a critical distinction from sigmoid neurons in conventional neural networks, which produce graded outputs. The cell's *internal* state is continuous; its *output* is a discrete event.
- **Discharge rate**: How quickly charge depletes after firing. This is a rate, not a fixed subtraction — regardless of how much charge has accumulated, firing drains the cell to its baseline. A cell under heavy excitation that crosses threshold fires once and resets, it does not retain excess charge across firing events.

> **Implementation requirement.** Firing is a discharge event, not a single-tick spike. When charge crosses threshold, the Schmitt trigger opens and the cell begins discharging at its discharge_rate. The cell's output STAYS HIGH for the entire duration of the discharge. The cell CANNOT accumulate new charge during discharge — incoming excitatory signals are ignored while the cell is draining. When charge drains to zero, the output goes LOW and accumulation resumes. The pulse width is determined by the discharge rate and is a per-cell evolvable parameter. Different discharge rates produce different pulse widths, which is how pulse dividers and timing circuits work in BEAM hardware. An implementation where all cells produce identical single-tick pulses — fire for one tick, reset to zero instantly, start accumulating again — has eliminated discharge-rate dynamics and replaced them with a uniform spike model that cannot produce the timing diversity the architecture requires.

- **Duty cycle**: The ratio of active to inactive time.
- **Prediction threshold**: Used by learning layer cells to determine when a predicted sequence matches observed input.

This hybrid design reflects von Neumann's analysis in "The General and Logical Theory of Automata": biological systems are "part digital and part analog," with alternating neural (digital) and humoral (analog) processing chains. Von Neumann explicitly noted that neurons are "prima facie digital" despite being embedded in continuous analog processes. Andromeda's cells implement exactly this hybrid — continuous internal state, discrete output events — matching the design that von Neumann identified in biological cognition.

**Cells fire spontaneously by default.** A NOR gate with no inputs is TRUE, so an unconnected cell pulses at its natural frequency (confirmed independently in Hasslacher & Tilden "Living Machines," Rietman et al. 2003, and Moses 2000). Cells are silenced by inhibitory input from other cells, not activated from a resting state. This is the opposite of most artificial neural network models, where neurons are inactive until stimulated. In Andromeda, the default state of the substrate is activity. Silence must be imposed.

> **Implementation requirement.** This applies to ALL cells, including motor cells. An implementation where motor cells are silent by default and require excitatory input to produce movement has inverted the control model. Motors fire continuously. Behavior is produced by inhibiting motors, not exciting them. Multiple independent circuits can each inhibit a motor without conflicting — this is why BEAM is more composable than pure subsumption: you can keep adding inhibitory rules without disturbing the ones already there. The biological parallel is the basal ganglia: healthy movement is selective disinhibition — releasing the brake, not pressing the gas. Parkinson's tremors are what happen when inhibition fails. An implementation that builds motors-by-excitation has substituted the standard neural network motor model for the one specified here.

**Signal propagation**: When a cell fires, its stored charge drains through its output connections, providing the energy to charge connected cells. Connection weights modulate this transferred charge — they scale the energy delivered to the target, not replace it with a fixed excitation value. A cell that fires with high accumulated charge delivers more energy through its connections than a cell that fires at threshold. A signal propagates along a chain of cells through this charge-transfer mechanism: each cell transitions from DEFAULT (idle, accumulating natural charge) to CHARGING (receiving charge from a neighbor) to ACTIVE (threshold reached, firing and draining) and back to DEFAULT. This sequential charge-transfer is the physical basis of frequency coding — the propagation speed through a chain determines the timing relationships between cells.

**Partial inhibition and threshold competition**: Inhibition does not categorically block a cell. An inhibitory connection *drains* the target cell's accumulated charge — in physical implementations, a transistor controlling the capacitor drain to ground actively dumps stored voltage proportional to how hard the inhibitory input drives it. This is not merely a reduced accumulation rate; it is an active removal of charge. The same mechanism is modeled numerically in simulation. A cell can still fire while under inhibition if its excitatory input is sufficiently strong to overcome the inhibitory drain. The cell's behavior is determined by the continuous competition between all excitatory and inhibitory inputs simultaneously. Excitatory and inhibitory connections of equal strength cancel out, producing no net effect. This ratio-based computation is how the system makes graded decisions from binary-output cells — the *population-level* firing rates encode continuous values even though individual cell outputs are all-or-nothing. This dynamic is fundamental to how convergence produces useful decisions (see Section 7.6, Circuit Pattern Vocabulary).

#### 4.2 Frequency Coding

Numeric values in Andromeda are represented as **frequency** — pulses per unit time — not as voltage levels, binary words, or weighted activations. A cell communicating "5" fires five times per second. A cell communicating "200" fires two hundred times per second. Frequency coding in Nv networks has been confirmed experimentally (Moses 2000, Rietman et al. 2003) and is a natural consequence of the oscillator-based cell design.

This encoding scheme has profound architectural consequences:

- **Single-cell arithmetic**: Addition is performed by a single cell receiving two excitatory inputs — the output frequency is the sum of the input frequencies. A binary adder performing the same operation requires approximately 100 NOR gates.
- **Clock independence**: Because information is encoded in timing rather than synchronized state, cells do not need a shared clock. Each cell operates on its own schedule. This eliminates an entire class of timing failures. A downstream circuit reads an upstream circuit's output by accumulating charge over its own natural time window — it listens to the pulse rate, not individual pulse edges. Different parts of the substrate can run at different speeds without synchronization. A fast ring reading from a slow ring simply sees lower input frequency. Circuits that require synchronous evaluation (such as counters or latches) use a local pacemaker — a dedicated oscillator clocking that module, not a global clock. This follows the Cray principle: timing is local, determined by the physical parameters of each circuit, not imposed by a global synchronization layer.
- **Natural ADC/DAC**: Sensory cells pulse at frequencies proportional to input signal voltage; motor cells convert pulse frequency to output voltage. Analog hardware can be directly connected to the cells without conversion circuitry. Each cell functions as both an analog-to-digital and digital-to-analog converter.
- **Kuramoto compatibility**: Frequency coding is what makes Kuramoto synchronization possible as a consensus mechanism — the oscillators have frequencies to synchronize.
- **Message passing**: Information travels between cells as pulse trains, which are inherently asynchronous and tolerant of transmission delay. It does not matter if a receiving cell observes a signal for one second or ten — partial sampling does not change the frequency being observed, only the precision of its measurement.

Frequency coding has one fundamental physical limitation: **slew rate**. Electronic circuits (and biological neurons with their refractory periods) have a maximum rate of voltage change, imposing a ceiling on pulse frequency. This means frequency coding alone is insufficient for representing large values. This is one reason Sparse Distributed Representations (Section 7.5) are architecturally *necessary*, not merely convenient — SDRs encode information across many cells simultaneously, distributing the representational burden beyond what any single cell's frequency range can carry.

#### 4.3 Metastability and the Noise Requirement

BEAM nervous networks can enter **metastable states** where circuits are balanced between true and false — an input pattern that places a NOR gate at exactly the boundary of its activation threshold. In physical hardware, thermal shot noise resolves these states almost instantly. In simulation, without injected noise, metastable circuits can deadlock indefinitely.

This is why the noise requirement is not optional. It is also why the noise must be **cryptographic-grade or derived from a physical source** (thermal, quantum, or radioactive). Pseudo-random number generators produce computable sequences with subtle statistical biases. These biases can prevent the system from reaching certain Garden of Eden configurations that would otherwise be accessible through true random mutation. As von Neumann observed: "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin." For Andromeda, this is not a philosophical quibble — it is a hard engineering constraint that affects the reachable state space of the Universal Constructor.

#### 4.4 The Programming Paradigm

Andromeda is not programmed by writing sequential code. The "program" is the initial configuration of the cellular automaton: which cells exist, how they are connected, their connection polarities and permanence values, and their initial state values. Programming Andromeda means wiring cells together and setting initial states (done via the Universal Constructor, discussed in Section 5.5) — analogous to wiring a circuit board or, more intuitively, building with Minecraft redstone. A cell connected to a daylight sensor with an inhibitory connection to a cell connected to a floodlight produces a circuit that turns the light on when darkness falls. Adding an excitatory connection from a motion sensor to the floodlight cell creates a motion-activated night light. The "code" is the topology and the initial conditions. The cellular automaton's transition rules — the physics — are fixed and universal. Everything the system does emerges from how cells are wired, not from instructions written in a programming language.

There is, however, a second level of programming that emerges during operation. If the control layer is understood as an analog CPU — with local memory in the form of cell charge states, delay lines, and latches serving as registers — then the predicted sensorimotor sequences coming from the learning layer are also programs, albeit for a rather unusual CPU. The attention layer functions as the main bus; the learning layer functions as RAM, storing and replaying temporal sequences. The control layer is guaranteed to respond to what the learning layer sends (assuming it passes the attention layer's gating), but the exact output is not determined by the learning layer alone. The learning layer does not say "turn left." It provides instructions and data that the control layer processes in the context of its own internal state — whatever charge its cells are holding, whatever phase its ring oscillators are in, whatever current IO it is receiving. Like any other CPU, the same instruction produces different output depending on the state of the registers. This is why the MIRROR mechanism is a data channel, not a command channel — the learning layer shapes behavior by providing context, but the control layer's response is always mediated by its own state.

#### 4.5 Substrate Universality

The host's computational class matters. Section 5.5 establishes that the host must be Turing-complete for evolutionary search to have access to arbitrary algorithms, and Section 2's treatment of Wolfram's Rule Zero establishes that no evolutionary strategy can lift a non-universal host into universality. The BEAM-based cell specified in Sections 4.1 and 7.8 satisfies the Turing-completeness requirement through the following reduction:

1. **BEAM neuron → NOR gate.** Under constrained input configuration, the capacitor-integrator-and-Schmitt-trigger cell implements a NOR gate. A cell with no inputs outputs TRUE — the default firing behavior established in Section 4.1. Excitatory input above threshold produces FALSE. Inhibitory input subtracts charge and, in the limit, suppresses firing independent of excitation. The generalized-NOR classification in Section 4 is a reduction, not an analogy.
2. **NOR → functional completeness.** NOR is a functionally complete connective: every Boolean function is expressible as a composition of NOR gates. This is why the Apollo Guidance Computer was built from three-input NOR gates alone.
3. **NOR → Rule 110.** Rule 110's local update function is expressible as a nested composition of NOR operations. A network of BEAM neurons wired to this topology instantiates Rule 110.
4. **Rule 110 → Turing completeness.** Rule 110 is Turing-complete (Cook).

Composed: the BEAM neuron is a functionally complete computational primitive, and any sufficiently connected network of BEAM neurons is a Turing-complete substrate. Rietman, Tilden, and Askenazi (2003) demonstrated a complementary path to computational universality in Nv rings: Boolean logic operations emerge from pulse interference patterns, confirming that the substrate produces computational behavior through multiple independent mechanisms. The substrate requirement from Section 5.5 is therefore satisfied by the physical component the architecture specifies, not by appeal to an abstract cellular automaton onto which the architecture is projected.

Two consequences worth naming. First, universality does not depend on scale, tuning, or learning. The NOR gate is a functionally complete logic primitive — any Boolean function can be constructed from compositions of NOR gates alone[^proof3] — and this cell-level property, composed at network scale with sufficient connectivity and memory, is what makes the substrate Turing-complete. Andromeda's classification as a universal Turing machine rather than a universal function approximator (Section 2) rests on this cell-level functional completeness composed into network-level universality, not on emergent properties of the learning layer. Second, because the host rules — the cell's NOR behavior — are fixed, and only the state information (topology, connection parameters, initial states) is modifiable by the Universal Constructor, no evolutionary trajectory can drift the substrate into a weaker computational class. Every generation inherits the same universality from the cell itself.

### 5. The Five-Layer Architecture

Andromeda consists of five components arranged in a cybernetic loop:

#### 5.1 Control Layer (CPU)

The central processor. A massively scaled BEAM nervous network that drives reflexive behavior and performs analog mathematics (integrals, etc.) using the same cells that handle sensorimotor processing.

Key properties:
- Semi-analog spiking system using subsumption architecture (Brooks & Flynn 1989; Moses 2000 demonstrates a hybrid Nv/microprocessor implementation) and Braitenberg-vehicle-like interactions
- Separate independent regions can operate simultaneously
- Can be hand-designed or evolved through artificial-life selection via universal construction
- Sensory cells pulse at frequencies proportional to input signal voltage; motor cells fire actuators when activated
- **The control layer is immutable during operation.** Connection weights and topology do not change during an organism's lifetime (see implementation requirement, Section 3.2). All adaptation occurs by changing what it perceives, not what it does. The one exception is damage rerouting: if part of the circuit is destroyed, dormant connections (those below permanence threshold) may activate to compensate, which is a learning-layer permanence dynamic applied to a structural emergency, not a modification of the control layer's designed wiring.

The BEAM nervous network in the control layer is a **chaotic system** — its behaviors emerge from nonlinear dynamics and chaotic attractors (confirmed by Rietman et al.'s 5-node autocorrelation analysis in "Analog Computation with Rings of Quasiperiodic Oscillators," 2003, and by the Arnold Tongue treatment in Hasslacher & Tilden's "Theoretical Foundations," 1995). Tilden, working at Los Alamos National Laboratory as part of a lineage of unconventional computation researchers the lab has maintained since the von Neumann era, collaborated with Brosl Hasslacher — a chaos theory and nonlinear dynamics specialist also at the institution — precisely because BEAM nervous networks are severely affected by three distinct phenomena that are commonly conflated. These properties are architectural features, not defects — the chaos is what provides the control layer's behavioral variety (see microcore ring dynamics below).

- **Sensitivity to initial conditions** (Lorenz, 1963): Small differences in starting state produce divergent outcomes. This is the popular "butterfly effect," but it is the weakest of the three claims — it says only that prediction degrades as measurement error grows. If you *did* know the initial state perfectly, you could predict perfectly. BEAM networks exhibit extreme sensitivity to initial conditions because coupled oscillators amplify perturbations through nonlinear feedback.

- **Finite predictability horizon** (Lorenz, 1969): Even with arbitrarily precise measurements on an arbitrarily fine grid, errors from sub-grid scales propagate upward, and each refinement of measurement buys geometrically diminishing returns — the prediction horizon converges to a *finite limit* regardless of measurement quality. Perfect data still yields only finite prediction. This is stronger than sensitivity to initial conditions because it establishes an inherent ceiling on prediction that no amount of data can breach. For BEAM networks in physical hardware, this is compounded by the physical floor of measurement — thermal noise, component tolerance, quantum uncertainty — below which the grid cannot be refined at all.

- **Computational irreducibility** (Wolfram): No computation shorter than running the system itself can predict its behavior. There is no shortcut, no analytical solution, no model that runs faster than the system and produces the same output. You must run it to see what it does.

All three apply to BEAM nervous networks, and the distinction matters for engineering. Sensitivity to initial conditions means two organisms with the same tape but different noise histories will diverge. The finite predictability horizon means the learning layer can never predict the control layer's behavior beyond a bounded window, regardless of how much data it has accumulated. Computational irreducibility means there is no way to build an external model that predicts what the control layer will do faster than the control layer does it — the system is its own fastest simulator.

This is precisely why the learning layer is necessary: it runs behind the control layer, learning its patterns, catching anomalies, and predicting consequences. The learning layer can never predict *every* BEAM behavior because the mathematics do not allow it, but it can predict *enough* to enable anticipatory action through the MIRROR mechanism. The control layer produces chaos; the learning layer imposes prediction on that chaos. Both are required — chaos without prediction is random; prediction without chaos has no raw behavior to refine.

**The control layer is the hard problem.** This cannot be overstated. As Brooks observed with Moravec's paradox: evolution spent approximately 98% of its time producing organisms that could move, sense, and react — the 3.7-billion-year arc from single cells to insects — and approximately 2% producing organisms that could think abstractly. The sensorimotor foundation is where almost all the architectural difficulty resides. The learning layer, by comparison, is a single small algorithm rubber-stamped across many cortical columns (Section 5.2) — a comparatively thin addition that provides enormous capability precisely because the animal underneath it is already competent. Getting the cockroach right is the prerequisite. Everything else follows from having a robust reflexive organism to build on. This asymmetry is reflected in the architecture: the control layer is a complex, chaotic, richly interconnected nervous network whose behaviors emerge from nonlinear dynamics, while the learning layer is a uniform, repeating structure that could be discovered by a single fortunate mutation in the Universal Constructor. The hard part is the 3.7 billion years. The easy part is the last two million.

**Microcore rings as structural units**: The control layer is not merely a flat network of individual cells — it is organized around **microcore rings**, small central pattern generator circuits formed by rings of Nv neurons. Each microcore ring cycles through a combinatorial number of distinct state patterns determined by its size and parity. **Rings fire continuously** — not in response to stimuli, but all the time, 24/7. What constrains them is the physical world itself. The ring circuits **phase-lock with reality**: behaviors that aren't compatible with the current physical constraints simply never lock, and the system falls into the first attractor basin that works — it is a **satisficer**, not an optimizer. When the world changes (an obstacle appears, a sensor is destroyed, a new object enters the environment), the phase lock breaks, the system goes briefly chaotic, and then settles into a new attractor basin compatible with the new constraints. When multiple rings are coupled, they anneal into coordinated oscillation patterns — motor programs, gait rhythms, escape behaviors — without any of these patterns being designed. The combinatorial state space of the ring network provides a large palette of possible behavioral responses without requiring anyone to specify what those responses should be. The system does not select from a menu of designed behaviors; the rings' continuous dynamics and the world's constraints produce behavior from the combinatorial repertoire. This is emergence at the circuit level — the structural unit produces behavioral variety the same way a deck of cards produces hands.

A critical emergent property of the microcore ring is that it inverts the computational character of its component neurons. Individual Nv neurons are **differentiators** — they respond to changes, not to steady states. But when differentiating neurons are coupled into a ring, the ring as a whole acts as an **integrator**: pulse processes circulating in the loop accumulate and sustain state over time. This means networks of coupled Nv rings can perform spike-train processing — operating on whole pulse trains rather than individual spikes — in a manner functionally similar to biological spiking neural networks, despite being built from components that individually respond only to transients. The integration property is not designed into the ring; it is a consequence of the ring topology applied to differentiating elements. This is what makes the substrate capable of supporting the learning layer's stroboscopic observation — without ring-level integration, there would be no sustained state patterns for the learning layer to read.

#### 5.2 Learning Layer (RAM)

Memory — both computational and experiential. Sparse distributed memory organized in structures analogous to cortical columns, functioning as random access memory. The cortical column model follows Vernon Mountcastle's 1978 hypothesis: the neocortex uses the same circuitry everywhere because each column runs a common algorithm. In Andromeda, this means the learning layer is a single small algorithm rubber-stamped across many columns — exactly the kind of pattern that generative self-modification can produce and that random mutation can discover. This uniformity is the source of the learning layer's comparative simplicity relative to the control layer (Section 5.1): the control layer is a complex, heterogeneous, chaotic nervous network whose behaviors emerge from nonlinear dynamics across coupled microcore rings, while the learning layer is a homogeneous repeating structure. Evolution spent billions of years producing competent reflexive organisms; adding a thin predictive layer on top was, by comparison, a small step that produced enormous returns. The layering of a learning system over a reflexive nervous network has direct precedent in BEAM robotics: Hasslacher and Tilden ("Living Machines," 1995) reported that adding a Nu (neural, integrating) layer to an Nv (nervous, differentiating) network accelerated learning "by over twice" in the Lobster experiment — the same architectural relationship Andromeda scales between its control and learning layers.

Each cortical column in the learning layer maintains an internal representation of location, functionally equivalent to **grid cells** in the entorhinal cortex (Hawkins et al., 2019). This location representation is what allows the column to bind sensory features to positions within the reference frame of the object being sensed — not merely learning that a sensory pattern occurred, but learning *where* it occurred relative to other patterns on the same object. The location representation is updated by path integration: proprioceptive components of the sensorimotor SDR (the system's own motor states and orientation changes) serve as the motor efference copy that drives the grid cell update. As the system moves and its sensors encounter different features at different locations, each column learns the structure of objects the same way the hippocampal system learns the structure of environments — by associating features with locations and connecting those locations through movement. Multiple columns observing the same object simultaneously build independent models and reach consensus via lateral connections (Kuramoto synchronization, Section 7.4). This is the Thousand Brains architecture: many models, each complete, voting to agree. The learning layer is inherently multimodal because the grid cell mechanism binds features to locations regardless of which sensory modality produced the feature — all sensory input is features-at-locations in the same reference frame.

**Concepts as residuals between sensations.** In this architecture, a concept is not a symbol or a token — it is the **residual** between two sets of sensations. Sensory vectors that are more similar have shorter Hamming distance between their sparse representations, and operations on those vectors are meaningful. This is how cross-modal coordination works without shared symbols: two different sensory systems observing the same category of objects (two organisms looking at things called "red," for instance) can coordinate on category names because the geometry of differences between things-in-the-category and things-not-in-the-category is structurally preserved, even when the underlying sensory experience is completely different. The coordination requires shared topology — shared structure of differences — not shared representations. This is the architectural realization of the parrot insight from Section 1: "your red is not my red, but we can still agree and communicate about it."

Key properties:
- **Input bus randomly connected** to the control layer at ~85% connectivity. It does not matter *which* cells connect, only that a sufficient *percentage* are wired (Kuramoto principle). The learning layer observes the control layer's population as a single sensorimotor SDR — it does not know and cannot know which cells serve which function. At larger scales, spatial clustering of connections emerges as a network effect: the learning layer connects in spatially clustered regions, producing multiple SDRs feeding into neighborhoods. These regions are interchangeable — swapping which regions connect to what does not break the system — because the clustering is a property of scale, not a logical assignment. This clustering preserves single-modality recognition (vision stays vision, audio stays audio) while cross-region connections enable multimodal association, following the same small-world network principle described by Watts and Strogatz (1998): local clustering for coherence, shortcuts for integration.
- Lateral connections between cortical columns, also randomly determined.
- **Hebbian learning**: "Cells that fire together, wire together." Distal connections toggle based on co-activation, forming memory sequences.
- Learns sequences, not single events. By recalling sequences of math operations sent to the control layer via the attention bus, this forms the **instruction fetch of the Turing machine**.
- Auto-associative and inherently multimodal: predicts both sensory sequences and mathematical instructions from partial fragments of either.
- **Continuous real-time learning.** No separate training phase. No frozen weights. No training runs.

**Salience amplification, not reward.** When the learning layer encounters a sensorimotor event with high consequence — either strongly positive (energy obtained, threat avoided) or strongly negative (damage sustained, energy lost) — the appropriate response is to strengthen the memory encoding of the surrounding sequence. This is a memory signal: "remember this more." It is not a reward signal: "you did good." The distinction matters because the same amplification mechanism must fire for both desirable and aversive outcomes — the organism needs to remember the sequence that led to a collision just as strongly as the sequence that led to food. Biological dopamine is often mischaracterized as a reward signal, but it activates in response to both positive and negative high-salience events, and its biochemical effect is to increase memory consolidation, not to reinforce "correct" behavior. An implementation that treats salience amplification as a reward signal — strengthening only sequences that led to positive outcomes — has introduced a reward function by another name and broken the architecture's capacity to learn equally from success and failure.

#### 5.3 Attention Layer (BUS/DMA)

The main bus, DMA channel, signal amplifier, and squelch. This is the critical innovation. The attention layer is functionally analogous to the thalamus in biological brains — an information routing hub that determines what reaches higher processing — and it is implemented using the same circuit primitives (convergence, feedforward inhibition, divergence, disinhibition) described in Section 7.6.

**The Two Buses**: The attention layer maintains two separate sets of connections to the control layer:

- **Input bus**: Randomly connected from control layer cells to learning layer cells at ~85% connectivity. This is how the learning layer observes the control layer's activity — it samples approximately 85% of the control layer's cells, carrying their activation states into the learning layer as a sensorimotor SDR. "Assembly is the reverse of removal" — the input bus *removes* (samples) information from the control layer.
- **Output bus (mirror)**: A separate set of connections running in the opposite direction, from the learning layer back through the attention layer to the control layer. This is how predictions are *assembled* (reconstructed) back into the control layer. The output bus is topologically a mirror of the input bus — if the input bus connects control layer cell A to learning layer cell X, the output bus routes learning layer cell X's predictions back toward the region of the control layer containing cell A. The mirror can be inexact — only ~60% similarity to the input bus topology is needed. This threshold is likely an inherent statistical property of the random wiring: two independent random samples at ~85% connectivity share approximately 72% of their members (0.85 × 0.85 ≈ 0.72), well above the ~60% minimum. The Kuramoto principle applies: it does not matter exactly *which* cells are connected, only that a sufficient *percentage* are wired.

A strong predicted sensor state transmitted through the output bus overwhelms the actual sensor state at the control layer, and the control layer reacts to the prediction as if it were real. This is how the learning layer controls the machine despite having direct control over nothing. It changes what the control layer *perceives*.

**Burst Detection**: When the learning layer encounters a novel input it cannot predict, cortical columns "burst" — many cells fire simultaneously rather than the sparse few that fire during successful prediction. The attention layer monitors learning layer cell activity levels and detects this burst.

The detection mechanism is a **convergence** pattern (Section 7.6): attention layer cells receive excitatory connections from cells across learning layer cortical columns. During normal predictive operation, columns activate sparsely — only a few cells per column fire, producing a low aggregate excitatory signal at the convergence point that stays below the burst-detector cell's activation threshold. When a column bursts, the aggregate signal spikes above threshold and the detector fires. This is a population activity threshold comparator — not a special mechanism, but a standard circuit pattern applied to a monitoring task.

Burst detection sensitivity is determined by two parameters — the detector cell's activation threshold and the resistance values on each of its monitoring connections — both of which are **random**, set by the manufacturing instructions tape with no tuning. This is the same principle that governs every layer of the architecture: one random configuration is as good as another. As long as the system assembles above approximately 65% functional connectivity, it works. The architecture does not require correct parameters. It requires *sufficient* parameters, and random initialization reliably provides them. The monitoring connections are random — they do not respect cortical column boundaries and are not designed to monitor specific columns. They simply sample learning layer activity. When any column bursts, the aggregate spike is detectable by any sufficiently connected convergence node. The distinction between "per-column" and "aggregate" detection is a false dichotomy introduced by assuming someone designed the monitoring topology. Nobody did. It's random. And it works.

**Squelch**: When burst is detected, the attention layer generates a suppression signal — **feedforward inhibition** from the burst detector to the mirror output pathway. The burst detector's output inhibits the attention layer's output cells that would otherwise relay predictions to the control layer. This is the conditional gating pattern: the output cells fire (relaying predictions) only if their excitatory input from the learning layer is strong enough to overcome the inhibitory drain from the burst detector.

Because inhibition is graded rather than binary (Section 4.1 — inhibition reduces charge rather than blocking it categorically), squelch is naturally graded: a weak burst (mild surprise) attenuates predictions; a strong burst (total novelty) fully squelches the signal. The resistance values on the inhibitory connections are random, like everything else — and the system works across a wide range of random values because the architecture is robust to variation in parameters, not dependent on specific ones.

**Reality Indicator**: The burst detector simultaneously sends a signal to the learning layer via a **divergence** pattern — fanning out to both inhibit the mirror output (squelch) and notify the learning layer that what it is currently observing is real rather than predicted. The GraphViz architecture diagram labels this "just a flag to make the SDR 'different enough' that the sparse memory doesn't ignore the outcome of an event when it happens in the real world if it's similar to something that it predicted." This flag ensures the learning layer records real-world outcomes as distinct memory traces even when they closely match prior predictions — without it, accurately predicted events would be treated as redundant and fail to reinforce the prediction sequence. The learning layer observes this reality signal as just another sensorimotor state and **learns to predict when it won't be able to predict**.

As an unintentional but architecturally inevitable side effect, the learning layer detects when its predictions were wrong — not by labeling states as real or imagined, but because reality arriving through the sensors disagrees with the prediction, causing columns to burst. The burst is the surprise signal; it triggers recording of the unexpected input as a new memory trace distinct from the prediction it replaced. This is prediction error, not metacognition — the system cannot distinguish real from imagined in advance, only discover the mismatch after the fact. The control layer, by contrast, cannot and must not distinguish predicted from real — that inability is what makes the MIRROR mechanism work, and what makes reflex training through repeated exposure possible.

**Predictions Drive Behavior — That Is the Point**: The MIRROR mechanism does not suppress motor output from predictions. Predictions reaching the control layer and producing motor responses is the entire purpose of the architecture. In Section 8.1, the drone navigates toward where balls *will* appear, not where they currently are — that is a prediction driving motor output. In Section 8.4, the drone dodges missiles before impact by imagining the sensation of being hit — that is a prediction driving evasive motor output. Anticipatory behavior is not a side effect to be managed; it is the primary function of the MIRROR mechanism.

The squelch already handles the safety concern. When the learning layer encounters a novel situation it cannot predict, columns burst, the burst detector fires, and the squelch suppresses the bad prediction before it can drive inappropriate motor responses. Good predictions — predictions that match or usefully anticipate reality — pass through the mirror to the control layer, which responds to them with its own motor output through its own immutable wiring. The control layer cannot distinguish predicted sensory states from real sensory states; it responds identically to both. This is not a flaw. This is how the system acts on what it has learned.

**What physically happens when a prediction reaches a microcore ring**: The mechanism by which predictions influence the control layer is phase-locking, not overwriting. When the mirror output bus delivers a predicted state into a microcore ring, it pushes the ring toward that state — because the predicted state, if it corresponds to a recently observed configuration, is a stable attractor that the ring dynamically "wants" to settle into. But whether the ring actually returns to that state depends on all other current couplings — sensor inputs, connections from other rings, environmental feedback through actuator load. The prediction does not replay what happened. It biases parts of the network toward particular configurations, and the entire coupled system resolves the blend of predicted state and actual state into whatever cleanly couples with the current environment. This is why predictions that match reality reinforce smoothly (the ring was already near that attractor), why predictions that conflict with reality lose gracefully (the actual couplings dominate and the ring settles elsewhere), and why the control layer never needs to "decide" between predicted and real input — the dynamics resolve the competition automatically through the same attractor landscape that governs all ring behavior.

"All adaptation occurs by changing what it perceives, not what it does." The mirror changes what the control layer perceives. The control layer does what its wiring says to do in response. The attention layer's role is to ensure that what reaches the control layer is either accurate sensory data or a good prediction — and the squelch mechanism is what enforces that quality gate.

The attention layer's dual role — squelch bad predictions and signal reality versus prediction — is what makes the MIRROR mechanism both functional and safe in a system connected to physical actuators.

**The MIRROR mechanism is a feedforward controller.** In control theory, a feedback controller (such as a PID controller) is fundamentally reactive — it measures error after it occurs and generates a corrective signal. A feedforward controller uses a model of the process to anticipate what the output will be, compensating for disturbances *before* they produce error. The MIRROR mechanism is the feedforward component of Andromeda's control architecture. The learning layer learns which sensorimotor sequences follow which other sensorimotor sequences — it builds a model of the process by observing the control layer's behavior over time. It uses that model to predict the next sensory state and injects that prediction into the control layer via the mirror output bus. The control layer does not know and does not care whether the sensory state it is responding to is real or predicted. It responds identically to both. This is feedforward correction: the system reacts to a sensory state that hasn't happened yet, preventing the error from occurring in the first place.

The control layer, operating alone, is a feedback controller — a self-tuning, self-stabilizing BEAM nervous network that corrects errors reactively through its own chaotic dynamics. Braitenberg vehicles are proportional controllers that accidentally stuck together. Adding the learning layer and attention layer does not replace this feedback controller — it *augments* it with feedforward prediction. The combined system is a feedback controller with feedforward compensation, which is standard practice in advanced control engineering. The critical architectural insight is that a bad feedforward prediction is not catastrophic. From the feedback controller's perspective, a wrong prediction is just another disturbance — no different from a gust of wind or a sensor glitch. The BEAM nervous network corrects for it the same way it corrects for anything else. The learning layer records the failed prediction and does not repeat it. The squelch catches the worst predictions before they arrive. This is why the architecture is robust to imperfect prediction: the feedback controller provides a floor of competence that the feedforward controller can only improve, never undermine.

This framing resolves an apparent design paradox: how can the system evolve a feedforward controller that survives self-modification? A conventional feedforward controller requires a mathematical model that closely matches the physical system. Self-modification changes the physical system, invalidating the model. Andromeda's solution is that the learning layer does not maintain a separate model — it continuously learns the sensorimotor sequences of whatever system it happens to be attached to, including a system that has been modified since the last generation. The model updates itself from lived experience. A hard-coded mathematical model or a pre-trained neural network would fail after self-modification. Continuous Hebbian learning in the learning layer does not, because it makes no assumptions about what the system looked like before.

The **Kopetz Principle** (Hermann Kopetz, as described by Edward Lee) states that "many of the predictive properties that we assert about a system — determinism, timeliness, reliability — are not in fact properties of the implemented system at all, but rather properties of a model of the system." This applies to Andromeda in two distinct ways. First, self-modification through the Universal Constructor changes the system's blueprint across generations — the next organism may have different wiring, different cell count, different ring topology. Second, and equally important, physical damage changes the system *during* operation. Parts break. Components wear out. A motor fails mid-flight. A sensor is destroyed. In a truly autonomous system there is nobody to repair the damage — if something is broken and cannot be fixed, the control schema has changed whether anyone intended it or not. The CPU is deterministic until it is in a hydraulic press; the organism's control layer is predictable until it is injured. The learning layer's continuous self-modeling is the architectural response to both cases: it learns what the system *actually does* right now, not what the system was designed or intended to do. This is why continuous learning is not optional — it is compensating for the fact that the control schema may be changing at any time, through self-modification, through damage, or through environmental conditions the designer never anticipated. The drone's motor-damage compensation (Section 8.3) is a direct demonstration: the learning layer re-learned the sensorimotor sequences for a broken organism in real time, and the system adapted without intervention. Donald MacKay, one of the first researchers to use the term "feedforward" in the mid-1950s, was describing not mechanical or electronic control systems but biological ones — the same biological control principles that inform this architecture.

The scope of that safety guarantee warrants explicit naming. The squelch gates against hallucination from *novelty* — predictions the learning layer cannot match to prior experience. It does not gate against a structurally distinct failure mode: a self-reinforcing predictive loop whose internal coherence has decoupled from external sensory grounding, in which predictions are confirmed by other predictions rather than by sensation. From inside such a loop nothing is novel, no burst fires, and the decoupling is invisible to the squelch by construction. This failure mode is architecturally possible as a consequence of mutation producing an instance whose mirror has drifted into self-consistent fabrication. The companion safety document treats it alongside gradual consensus degradation; both lie outside the reach of novelty-based detection and must be addressed by mechanisms external to the attention layer.

A third failure mode, distinct from both novelty-driven hallucination and self-reinforcing loops, is **oscillator death**: Rietman et al. (2003) demonstrated that high-frequency input saturation causes Nv rings to collapse to all-zeros — a complete cessation of oscillation. If the MIRROR mechanism drives predictions too aggressively into the control layer, it could trigger oscillator death rather than useful anticipatory behavior. This is a hardware-level failure that the burst/squelch mechanism would not catch, because the failure is overload, not novelty. Oscillator death is not unique to this substrate — it is a known failure mode in biological nervous systems under different names: dopaminergic depolarization block (neurons overstimulated past their operating range stop firing entirely — a documented mechanism in antipsychotic pharmacology) and SUDEP (Sudden Unexpected Death in Epilepsy, where seizure-driven saturation causes complete cessation of brain oscillation). The failure mechanism is identical: high-frequency saturation collapses oscillatory circuits into a fixed state. The substrate is different; the dynamics are the same.

**Sensor Loss Compensation via Fabricated Data**: When a sensor is permanently lost, the attention layer uses learned associations from the learning layer to **fabricate what the missing sense would have reported**, based on data from remaining senses. Learned responses that depend on the lost sensory modality continue to function using predicted data. The machine can effectively "see" after going blind by imagining vision from auditory or proprioceptive input. This is arguably the most dramatic practical consequence of the MIRROR mechanism: the same architecture that enables prediction-driven behavior also enables the system to synthesize missing sensory channels from cross-modal associations. When re-tasking memory after sensor loss, not all memory associated with the lost sense should be re-tasked — a portion must retain the old associations so the MIRROR mechanism can reconstruct the missing data. The retention percentage is inversely proportional to operational age: a young system with few associations can afford to re-task more; a mature system with rich cross-modal mappings should retain more.

#### 5.4 Environment (Black Box)

The external world. In second-order cybernetics, both observer and observed must be accounted for.

Core principle: **The system never measures the world directly. It measures itself.** It compares what it feels before it does something to what it feels after. The transformation between self-measurements is implicitly a model of the world. We never analyze the world, only ourselves, but in learning to predict the next sensation we build a model of the world implicitly. This is Brooks' principle that "the world is its own best model" ("Intelligence Without Representation," 1991) — realized as architecture rather than aphorism.

The environment is not backdrop and not a passive recipient of output. It is a named architectural component because the transformation it performs is what the organism decodes; without that transformation there is nothing to decode and no model of the world to build. Section 6 develops the consequences — coupled cognition, requisite variety, the system boundary — but the requirement itself belongs here, because an implementer building an environment needs it before reaching that section.

> **Implementation requirement: the environment must transform the organism's output before returning it.** Without transformation there is no conversation — only an echo. The organism needs something that responds differently than what the organism said, or there is nothing to learn from, nothing to decode, and no basis for the Ashby black box inference that constitutes the organism's model of the world. An environment that returns the organism's own output unchanged, or that returns a fixed response independent of what the organism did, has removed the thing the architecture exists to decode.
>
> **Implementation requirement: the loop is a service, not a function.** The system is Ashby's Black Box decoder running as a daemon — equivalently, a flight controller, a continuous control loop. A function implies a caller, an invocation, a return value, and a termination. The cybernetic loop has none of these. It runs. It reads sensors. It adjusts actuators. It never terminates. An implementation that treats the cybernetic loop as a function called once per tick — invoke, compute, return — has replaced a continuous process with a discrete procedure and may lose dynamics that depend on the loop's persistence across time.

#### 5.5 Universal Constructor

Self-replication and self-improvement through evolution applied to the architecture itself.

The Universal Constructor solves for BEAM nervous networks the same problem that backpropagation solved for perceptrons. Early perceptron researchers adjusted connection strengths by hand — literally turning potentiometers with a screwdriver until the network produced useful output. The field was stuck until backpropagation automated the search for correct weights. BEAM nervous networks face the same bottleneck: the central pattern generator rings that drive locomotion, gait, and motor coordination must be tuned — their rhythms balanced, their coupling strengths set — to produce functional behavior. BEAM hobbyists still do this by hand, adjusting potentiometers while watching the robot walk. The Universal Constructor is the mechanism that automates this search. It discovers not only the right parameter values but the right number of cells, the right number of connections, and the right ring topologies — through the same generate-and-test cycle that backpropagation replaced manual weight adjustment with. Backpropagation made neural networks practical. Universal construction makes nervous networks evolvable.

**Host vs. State Information**: The architecture maintains a critical division between two levels. The **host** automaton comprises the transition rules — the physics of the cellular automaton itself — and is fixed. The **state information** — the pattern of cell states loaded into the host — is the "software" and is the target of all modification. This distinction is architecturally essential: advanced strategies like crossover recombination are implemented as state information specifically so they themselves can be optimized by the evolutionary process. The host provides the unchanging substrate; the state information is the evolving organism.

**The Evolvability Principle**: Everything that can be evolvable should be evolved. Anything that is not on the tape is an assumption the implementer is making — a fixed parameter that constrains the search space before the search has run. Cell count, connection topology, sensor identity, motor identity, offspring provisioning amount, reality flag bit count, crossover strategy — if a parameter can be encoded on the tape and subjected to mutation and selection, it should be. Every hardcoded parameter is a bet that the implementer knows the right value; the No Free Lunch theorem warns that any such bet is wrong for some future environment. The tape is the UC's search space; a parameter off the tape is a dimension the UC cannot explore. The designer's stated goal is to eventually place the constructor itself on the tape — organisms that can modify their own developmental rules — but this is an advanced milestone, not a near-term requirement. The principle applies now to all parameters within reach: when in doubt, put it on the tape and let evolution decide.

**The Manufacturing Instructions Tape**: The initial state of the automaton is stored as a file of cell states — analogous to DNA. This tape contains everything needed to replicate the machine except the tape itself. Von Neumann solved the infinite regress problem with a key insight: the tape is used in **two fundamentally different ways** — first as *instructions to be followed* (transcription: read the tape and build the machine it describes), then as *data to be copied* (replication: copy the tape itself without interpreting it, and attach the copy to the new machine). This dual use of the same information — once as code, once as data — anticipates molecular biology's discovery of DNA transcription and translation by decades. Sydney Brenner later acknowledged this parallel. The tape is the unit of replication and mutation. Noise and entropy applied during tape copying produce variation; environmental selection pressure determines which variations survive.

**Two Pathways of Self-Modification**: The Universal Constructor does not run concurrently with the cybernetic loop as a background process. It activates on **reproduction events** — moments when the system produces offspring. Reproduction may be sexual (two entities negotiate a combined manufacturing instructions tape) or parthenogenetic (the system copies and mutates its own tape when the opportunity presents itself). The living organism runs the inner cybernetic loop; the Universal Constructor operates at the *generation boundary*, producing the next organism. This means structural modification never disrupts a running system — it produces a new system. The two pathways through which offspring tapes are modified are:

- **Genetic modification**: Random mutation and recombination of the manufacturing instructions tape, followed by environmental selection. This is slow but capable of discovering genuinely novel patterns — configurations that no existing algorithm would have produced. Mutation rate is set to a minimum but **never zero**, ensuring the search can never be closed. Crossover is implemented as state information (not host rules) so it can itself be optimized. With abundant resources, the search ignores fitness gradients and acts as a parallel random walk, preserving diverse solution paths. There is no "final form" — the system preserves as many potential solutions as resources allow, because fitness is situationally dependent (a McLaren is the best car on a racetrack; a Jeep is the best car in a desert; optimizing for one eliminates the other). Some problems have no single optimum but rather a Pareto frontier of trade-off solutions.

> **Crossover's primary role is repair, not diversity.** The conventional framing of crossover in evolutionary biology and evolutionary computation is that it generates diversity — exploring the fitness landscape by combining traits from different parents. This is the wrong model for understanding crossover's primary role in this architecture. Crossover is error correction. Every organism accumulates random mutations. When two organisms with similar structure recombine, the offspring has a chance of receiving the unmutated copy of any given gene from the parent that didn't have that particular mutation. The probability that both parents have the same gene damaged is lower than the probability that one does. Crossover is the mechanism that makes this repair possible. This reframing has a critical consequence: everything about the tape is designed for stability. The tape resists drift. Variations only propagate through the population if they are genuinely advantageous, because the default behavior of the system — crossover repairing mutations, redundancy absorbing damage — is to hold what it has. An implementation that uses crossover to mix unrelated organisms with fundamentally different topologies is not performing error correction; it is performing destruction. Crossover between organisms whose internal structure has no correspondence destroys functional circuits in both parents. Crossover produces repair only when the parents share enough structural similarity that corresponding regions of their tapes encode corresponding functions.

> **The tape is not a flat list.** Biological genomes are not sequences of instructions read linearly from beginning to end. They have internal structure: start markers that delimit functional units (operons), instruction encodings where neighboring codons produce functionally similar proteins (codon degeneracy), and mobile genetic elements that relocate or duplicate functional modules as intact units (transposons, retrotransposons, plasmids). This internal structure is not incidental to evolution — it is what makes evolution work. A genome where any mutation is equally likely to be catastrophic cannot evolve complex structures, because each generation destroys as much function as it creates. A genome where most mutations are neutral (they land in dead space, or they substitute a functionally similar instruction), where functional units are held together by structural boundaries so crossover operates between modules rather than within them, and where successful patterns can be duplicated without disrupting existing function — that genome can accumulate complexity because the tape format itself resists degradation. The difference between a flat instruction list and a structured genome with codon degeneracy and module boundaries is not a refinement. It is the difference between a system that can evolve and a system that is trapped at the complexity ceiling of whatever random topology it can discover and preserve through point mutations alone.

> **Implementation requirement: the tape must support functional units.** Organisms beyond trivial complexity require that the tape encode functional units — groups of instructions that together produce a coherent circuit, behavior, or structural pattern — as discrete, bounded regions that are inherited, mutated, and recombined as units. Without functional units, the tape cannot scale. A four-cell tracker can be discovered by point mutation on a flat list, but an organism with dozens of cells, multiple sensory modalities, and coordinated motor programs cannot — the probability of assembling a complex functional circuit by independent point mutations without the tape holding intermediate results together is vanishingly small. Functional units are to the tape what cells are to the organism: the unit of organization that makes composition possible. How the tape delimits, encodes, protects, duplicates, and relocates functional units is an engineering problem that admits multiple valid solutions — biology uses one set of mechanisms, and alternative approaches are possible. Treat this as a xenobiology problem: the requirement is that functional units exist, are bounded, and are heritable as units. The specific implementation is for the builder to discover.
>
> **Experimental confirmation: flat-list crossover is destructive.** Clean-room implementation testing confirmed this architectural requirement through controlled experiment. With sensor and motor identity heritable on the tape (satisfying the whole-organism requirement below), asexual reproduction produced a population mean ball-paddle correlation of +0.55, with 72% of organisms above the 0.5 tracking threshold — trackers evolved from scratch, spread through the population, and stabilized. Under identical conditions with sexual reproduction enabled, the population mean dropped to +0.14 — indistinguishable from random baseline — despite individual trackers still appearing at correlations above +0.5. Crossover on a flat-list genome destroys functional circuits faster than selection can spread them, even when the organism's body interface is correctly inherited. The tape format is not a scaling optimization. It is a prerequisite for sexual reproduction to function as the repair mechanism described above. Without module boundaries, crossover cannot align on corresponding functional regions between parents, and recombination produces broken hybrids rather than repaired offspring.
>
> **Experimental confirmation: structured crossover with the tape format.** Two independent 3-hour proof test runs (2,000 organisms each, Pong self-play environment) confirmed that structured crossover at sequence boundaries produces robust evolutionary convergence. The first run (deterministic seed 42) achieved mean correlation +0.50 → +0.65, with the V3a tracker pattern (a Braitenberg-vehicle-like architecture achieving 88% Pong win rate) dominating the population. Crossover functioned as repair at sequence boundaries — preserving functional circuit motifs rather than destroying them. Construction timeout rates dropped from 44% to 24% under selection, demonstrating that the population evolved tapes that construct more reliably. The second run (random seed 3330899728) tracked the same convergence trajectory: mean correlation +0.46 → +0.62, with 74.6% of the population above the +0.5 tracking threshold. Construction timeout rates dropped from 45% to 11%. The second run also exhibited cell bloat reversal — mean cell count rose from 23 to 29, then dropped to 15 by the end of the run while correlation held steady, indicating the population discovered compact solutions and spread them. V3a convergence was robust across different random seeds, confirming that the result is a property of the architecture, not an artifact of a particular initialization. (Note: these proof tests used an explicit per-codon metabolic cost as an experimental proxy for selection pressure against tape bloat. Under the Cost Domain Correspondence principle established subsequent to these runs, future implementations should replace this designed cost parameter with substrate-native constraints — see the implementation requirement in that section. Note that the current reference implementation does not provide a substrate-native alternative: substrate update is vectorized and every organism receives an identical tick budget regardless of cell count, so the designed cost parameter is presently the only pressure against tape and cell growth rather than a redundant one.)
>
> **Note on scope:** The 2026 Pong self-play experiments exercise the control layer and the Universal Constructor. No learning layer, attention layer, or MIRROR mechanism is present in this experimental platform. The observed behaviors in Part III (adaptive navigation, threat evasion, damage compensation, emergent metacognition) are from the 2019–2024 drone demonstrations, which used a hand-built control layer with the full five-layer architecture. The 2026 experiments demonstrate that the Universal Constructor can discover working control-layer circuits from scratch; they do not validate the full architecture as a unified system.
>
> **Note on the correlation metric.** Mean ball-paddle correlation is reported throughout as the outcome measure for these runs. It is an observation, not a selection criterion: correlation is computed after each organism's match, recorded for analysis, and never read by any code path governing reproduction or removal. Reproduction is gated on accumulated nourishment — energy obtained by striking the ball — and the population is never ranked or sorted. Correlation is how the experimenters see what happened; it is not how the environment decides who persists.
- **Generative modification**: Because cellular automata store programs as **spatial patterns** — bitmaps of cell states — image and pattern synthesis techniques can generate automaton state patterns that *resemble* working code. Functional cellular automata are dominated by repeating structures (glider guns, cortical column arrays, BEAM bicore patterns). Generative algorithms learn the visual "texture" of these working patterns and stamp variations of them. The generator does not need to understand what the code does, only replicate its visual features — like a student who can copy a professor's handwriting without reading the language. The Game of Life provides an intuitive example: a clock pattern has a recognizable visual signature; copy-pasting it with slight variations produces new timing circuits without designing them from first principles.

Neither pathway alone is sufficient. Genetic modification discovers; generative modification exploits and accelerates. The hybrid strategy is a core design principle.

**Information Entropy Injection**: The Universal Constructor requires an external source of information entropy. This is not a practical recommendation — it is a mathematical necessity.[^proof1] The argument runs as follows: a program is a compressed string. A string cannot increase its own Kolmogorov complexity except by adding information to the string. The Universal Constructor is incapable of increasing the complexity of the programs it produces without receiving information from outside. It can rearrange what is already there, but it will eventually exhaust the combinatorial possibilities of its existing material. In the ideal case, the UC performs a random walk over the integers, producing every possible program — but the integers to walk over must come from somewhere. If the UC could generate unbounded complexity from a finite starting string, it would constitute a lossless compression algorithm that encodes every possible program, which is provably impossible. The impossibility proof is why the requirement is absolute: the UC must have access to an external entropy source because the alternative violates information theory. The mechanism is a true random number generator (TRNG) — hardware thermal noise, radioactive decay, or any physical process whose output is not algorithmically compressible. For small-scale testing, a pseudorandom number generator (PRNG) is acceptable with the understanding that it imposes hard limits: the PRNG's period bounds the complexity ceiling, sensitivity to the seed becomes a confound, and results that depend on the PRNG's specific sequence are not general. The TRNG is the production mechanism; the PRNG is a test fixture with known limitations.

> **Implementation requirement: the tape describes the whole organism.** The tape is not a description of a nervous system waiting to be connected to a body. It is a description of an organism — sensors, motors, interneurons, connections between them, and every parameter needed to build a functioning entity that interacts with its environment. Sensor identity and motor identity are on the tape alongside topology and weights. An organism whose sensory interface is assigned randomly at runtime rather than inherited from the tape is an organism that cannot be selected for how it perceives the world. An organism whose motor interface is randomized at birth cannot be selected for how it acts on the world. The organism's system boundary extends to its interface with the environment; if you removed the sensors and motors and asked "where is the tracking behavior?", the answer is the same as removing the body and asking where the walking is. It is in the whole system. Heinz von Foerster, when asked where information is stored in the brain, answered: in the whole person. The organism is its morphology, its wiring, its interface — all on the tape, all heritable, all subject to mutation and selection. Separating any part and assigning it randomly is building a brain in a vat — a nervous system with no stable body, unable to evolve coherent interaction with the world no matter how perfect its internal wiring.
>
> **Implementation requirement: body schema is heritable.** The genome tape must encode the organism's body interface, not merely its internal nervous topology. In the simplest implementation, specific cells are marked as sensor or motor cells, each mapped to a physical input or output channel. These assignments are inherited through reproduction and are subject to mutation like any other heritable trait: a cell may gain or lose sensor/motor status, and its channel mapping may mutate. Assigning sensor or motor identity randomly at runtime breaks the architecture by separating the nervous system from the body — selection cannot preserve useful behavior if the organism's interface to the world is resampled at birth. This was confirmed experimentally: with randomly assigned IO, evolution produced a population mean correlation of +0.16 despite routinely discovering viable tracking topologies; with heritable IO, the same population reached +0.55 as trackers spread and stabilized. A single-cell-per-channel body plan is sufficient for minimal testing, but robust organisms require redundant sensory and motor morphology: multiple cells mapped to the same channel, forming clusters that extract stable signals from unreliable components in the von Neumann sense (see sensor redundancy, Section 3.2). The body schema — what is a sensor, what is a motor, which channel each maps to, and how many cells serve each channel — is as much a part of the organism's heritable identity as its internal wiring.

> **Implementation requirement: always build from the tape.** Information flows in ONE direction: tape → organism, never organism → tape. The tape encodes structure: cell parameters, connection topology, weights, polarities, sensor identity, motor identity. The constructor reads the tape and builds a fresh organism. When an organism reproduces, the TAPE is copied (with possible mutations applied to the copy). Runtime state — permanence values modified by Hebbian learning, accumulated charge levels, firing history, motor impedance state — is NEVER written back to the tape. The architectural reason is twofold: first, inheriting runtime state is **overfitting at the evolutionary scale** — offspring arrive pre-fitted to the parent's specific lifetime experience rather than carrying a general-purpose structure that can adapt to whatever world they encounter. You don't inherit your parent's calluses; you inherit the capacity to develop calluses where needed. Second, any learning mechanism — including SDM — has finite capacity, while the world's variations are not finite. Freezing learned state into the tape consumes the offspring's finite plasticity with the parent's specific experiences, producing organisms increasingly fitted to their ancestors' worlds and decreasingly capable of adapting to their own. The one-way rule preserves each organism's ability to learn its own world. An implementation that exports an organism's runtime state into its offspring's genome has built serialization (saving and loading a snapshot), not reproduction (copying and building from a blueprint). This creates a regress problem: if you serialize permanence, why not charge? Why not firing history? The tape must remain a clean structural blueprint. Epigenetic inheritance, if ever implemented, would consist of marks ON the tape that affect how the constructor reads it — annotations that influence construction, not serialized runtime state.

> **Implementation requirement: cell count is free.** The tape can mutate to add or remove cells. Organisms grow and shrink through evolution. Cell count is an evolvable parameter, not a design choice. An implementation that fixes all organisms at a predetermined cell count has eliminated an entire axis of evolutionary search. The selection pressure against unnecessary complexity must arise from the substrate's own physics, not from a designed metabolic drain parameter — see **Cost Domain Correspondence** below.

**Metabolic Survival Pressure**: The Universal Constructor selects through survival, not through fitness ranking. This distinction is precise and load-bearing. A fitness function evaluates organisms against each other — organism A scored higher than organism B, therefore A is fitter. This is optimization. A metabolic survival pressure simply asks: is the organism still alive? An organism that obtains sufficient energy from its environment to offset its metabolic cost of existence continues to exist. An organism that does not, ceases. No comparison between organisms occurs. No ranking is produced. The selection pressure is thermodynamic: Tilden's first law states that a robot must continuously seek a better source of energy. This is not specific to robots — it is a consequence of the second law of thermodynamics applied to any organized system. An organism that does not obtain energy dissipates.

This is the anthropic principle applied to evolutionary search:[^proof2] an observer that does not continue to exist cannot observe. Organisms that happen to behave in ways that sustain their energy supply are the ones that remain in the population — not because they are "better," but because the non-sustaining organisms are gone. Survivorship bias is the selection mechanism. The Universal Constructor does not decide which organisms are fitter. It produces offspring from organisms that are still alive at the reproduction boundary. The dead have no offspring. This is how biology works, and it is how the Universal Constructor works.

The distinction matters because a fitness function creates optimization pressure toward a specific objective — which the No Free Lunch theorem warns is always wrong for some problems. Metabolic survival pressure creates no such optimization. The organisms that survive may be doing something the designer never anticipated, something that appears inefficient or purposeless, but that happens to sustain energy intake in the current environment. The organism afraid of clowns for no apparent reason survives when a clown turns out to be dangerous. Optimizing away "useless" traits closes off future survival paths. The Universal Constructor must preserve diversity, which means it must not rank, score, or optimize — only distinguish alive from dead.

> **Implementation requirement: this is artificial life, not a genetic algorithm.** The distinction above is precise and must be enforced in implementation. A genetic algorithm evaluates organisms over a test period, ranks them by a fitness metric, selects the top performers for reproduction, and replaces the bottom performers with offspring. This is the standard approach in evolutionary computation. It is the WRONG model for Andromeda. The correct model: organisms exist in an environment continuously. They gain energy from the environment (eating, hitting targets, photosynthesis). They lose energy per tick (metabolic drain). They reproduce when they have enough energy. They die when energy reaches zero. There is no evaluation phase, no ranking, no tournament, no "top N% breed," no discrete generations. The simulation runs continuously and organisms are born, live, reproduce, and die on their own timelines. Selection pressure is LOOSE — most garbage survives, death is rare except during environmental collapses. An implementation that evaluates organisms in batches, ranks them by a fitness metric, and selectively breeds the top performers has substituted a genetic algorithm for artificial life evolution. These are fundamentally different models that produce fundamentally different population dynamics.

> **Implementation requirement: populations must be large.** Populations of tens of thousands are typical, not populations of dozens. At 50 organisms, the probability of any organism randomly having a useful circuit topology is negligible. At 10,000, useful configurations appear by chance in the initial population. Population size is not a tuning parameter — it is a structural requirement for the search to have enough samples of the space. Seeding initial populations with known-good partial solutions is acceptable and is standard practice in BEAM circuit development (analogous to building a rough circuit and then tuning potentiometers with a screwdriver until it walks).

**Cost Domain Correspondence**: The preceding principle — that selection operates through survival, not through fitness ranking — specifies *what* selects. This principle specifies *how* cost must arise within the substrate.

Every physical substrate imposes costs on the systems running within it. In a matter-and-energy universe, every cell maintains ion gradients, every transistor draws current, every gram of tissue demands oxygen. These costs are real and measurable — watts consumed, calories burned, joules dissipated. In a computational universe — software organisms running inside a computer — the organisms do not know how much power the computer draws. They cannot see the electricity bill. What they can experience is clock cycles. A program that completes its work in fewer cycles has cycles left over. A program that wastes cycles on unnecessary computation falls behind.

The principle is: **the cost domain must match the substrate domain.** An organism's cost of existence must arise from the same physics that produce its behavior. If the substrate is matter and energy, thermodynamics imposes the cost. If the substrate is computation, computational complexity imposes the cost. Do not import cost models from one domain into another. Do not model wattage costs inside a computational substrate where the organisms cannot experience wattage. Do not model cycle costs inside a physical substrate where the organisms experience thermodynamics.

The practical consequence is that an implementer should not design a cost function. The implementer should faithfully represent the physics of the domain the organisms inhabit. If the physics are right, cost takes care of itself.

The designer's thought experiment for testing this: imagine the system found itself on a planet — physical or virtual — where it has never been. Could it adapt? If the cost model is intrinsic to the substrate, the answer is yes — whatever physics the new world imposes, the organisms experience those physics directly and selection operates through them. If the cost model is a designed parameter carried over from the home substrate, the answer is no — the organisms are optimized for an exchange rate that does not apply here, carrying assumptions about a world they no longer inhabit. A system that can be sent to an unknown part of the universe must derive its costs from wherever it finds itself, not from wherever it came from. This is the litmus test: any designed cost parameter is a tether to the world the designer knew.

**Substrate jumping — the one case where cost is imported.** There is exactly one scenario in which an implementer correctly imports cost from a foreign domain: when the organisms are evolving in one substrate but are intended to deploy on another. Evolving in computation but deploying on physical hardware, for example. In this case the imported cost models constraints the organisms *will* face but *do not yet* experience — the thermodynamics of the target substrate, represented inside the evolution substrate as a modeled physics. Even here, the principle holds: the implementer is still modeling physics, just the physics of somewhere else. The imported cost model should be derived from the physical properties of the target substrate — actual wattage per gate, actual thermal dissipation per cell, actual propagation delay per connection — not invented as a tuning parameter. The modeled physics do not need to be exact; they need to be a good analog for the *relationships* between the physical quantities (the ratios, the scaling laws, the proportionalities). Planck units, normalized units, or whatever is convenient — the fidelity that matters is relational, not absolute. Whether organisms can simultaneously optimize for the native substrate's cost and the imported target's cost is an open question. The designer's expectation is that they will optimize for both, but this has not been tested experimentally.

In a computational substrate where no substrate jump is planned, the organism's response latency must be a consequence of its own computational complexity. An organism with four cells whose network settles in three propagation steps and an organism with fifty cells whose network requires fifteen propagation steps should not receive the same reaction window. The four-cell organism responds faster because it *is* faster — fewer cells to propagate through, fewer steps to reach a stable output. The fifty-cell organism is not penalized for its complexity; it simply cannot get the work done in time. The ball gets past it while its network is still settling. The selection pressure against unnecessary complexity is intrinsic to the substrate, not applied to it.

This is the hummingbird principle. The hummingbird genome is one-sixth the size of a typical mammalian genome — not because nature charges a tax per base pair, but because the hummingbird replaces roughly 100,000 red blood cells per second per pound of body mass, and each cell division copies the full genome. At that replication rate, carrying a mammalian-sized genome is metabolically lethal. The genome is small because the organism cannot afford the *time* to copy a larger one at the rate its physiology demands. The cost lives in the time domain, arising from the ratio of copy cost to energy budget over the organism's actual duty cycle. An onion can carry three times the human gene count because its cells divide at a leisurely pace. There is no universal "cost per gene" — there is a relationship between the organism's operational tempo and the time required to replicate its information, and that relationship is what governs genome size.

The same logic applies inside a computational substrate. The organism that is not wasting clock cycles can get more work done than another organism in the same number of clocks, and outcompete it. The cost is real. It is just not measured in watts.

> **Implementation requirement: do not design cost — model the physics.** An implementer working in a computational substrate should not assign a metabolic drain per cell, per codon, or per connection as a designed parameter. Instead, the implementer should ensure that an organism's computational complexity has real consequences within the substrate's own physics. In a game environment, this means an organism's reaction time should reflect the propagation depth of its network — more cells and more connections mean more steps to settle, which means slower response to a changing environment. In a physical robotics substrate, the thermodynamic costs are already present — the implementer's job is not to simulate them but to not mask them. The general principle: if you find yourself writing a cost function, you have likely failed to represent a physical constraint of the substrate. Find the constraint and represent it instead. If the physics are right, cost takes care of itself. A designed cost parameter is a claim that you know the right exchange rate between complexity and survival — a claim the No Free Lunch theorem warns is always wrong for some future environment. A physical constraint of the substrate is not a claim. It is a fact about where the organisms live.

> **Reconciliation note:** An explicit tape replication cost (time or energy required to copy the tape at reproduction) may or may not constitute a designed parameter depending on the substrate. In a computational substrate, if reproduction requires actual computation to copy the tape, and that computation takes real cycles during which the organism is not doing other work, then the replication cost is a physical consequence of the substrate — it is the time-domain cost of copying information. If the replication cost is instead a flat numeric penalty subtracted from an energy variable at reproduction time, it is a designed cost function wearing a physical costume. The distinction is whether the cost arises from the substrate's actual mechanics or from a number the implementer chose. Implementers should be honest about which one they are building and should prefer the former.

**The Tabula Rasa Survival Requirement**: Because self-modification can accidentally erase the system — and functional equivalence is undecidable (Rice's Theorem), so erasure cannot be prevented algorithmically — the architecture must be **rebuildable from a blank slate** using only mechanisms simple enough to arise by random mutation.[^proof7] This is not a design preference — it is a survival constraint imposed by the mathematics of self-modifying systems.

The logical chain that necessitates this requirement, and that determines the specific components chosen, runs as follows:

1. **No Free Lunch** (Wolpert & Macready): No optimization algorithm outperforms random search averaged over all problems. Therefore algorithms must be mutable state information, not fixed host rules, and the system can never close the search for better solutions.
2. **The Problem of Induction** (Hume): Inductive reasoning cannot logically justify itself — no finite set of observations can guarantee the next observation. Therefore induction cannot serve as the foundation of a bootstrapping system, because you cannot implement in code what you cannot logically justify.
3. **Gödel's Incompleteness and the Entscheidungsproblem** (Gödel, Church, Turing): Formal deductive logic cannot fill the gap either. A consistent system cannot prove its own consistency; no general decision procedure exists for arbitrary propositions. The algorithms required for both inductive and deductive reasoning are too large and too complex to arise from a single random mutation.
4. **Therefore, behavior-based reflexes** (Braitenberg, Brooks, Tilden): The only viable bootstrap is reflexive behavior — Braitenberg-vehicle-like sensor-motor wiring and BEAM nervous network circuits. These are small enough to arise by chance mutation in a random NOR-gate configuration. They require no logical consistency, no inductive justification, and no prior knowledge. A single crossed wire between a sensor and a motor produces directional behavior. A few more connections produce something that looks like fear, attraction, or curiosity. This is the seed from which all higher capabilities grow.

This chain is why Andromeda uses BEAM + HTM-derived learning + attention as the minimum viable intelligence pattern. It is not an arbitrary selection of components. It is the set of mechanisms that survives the intersection of all non-computability constraints on self-bootstrapping systems.

### 6. The Cybernetic Loop

A cybernetic loop is not merely a feedback loop. In ordinary closed-loop feedback (a thermostat, a cruise control), the system acts and the environment responds, but the environment's response follows fixed rules. In a **cybernetic** loop, the environment's behavior *changes in response to the system's actions* — and the system must adapt to those changes. Norbert Wiener's original formulation came from the anti-aircraft gun problem: the pilot *evades* based on what the gun does, so the gun must predict not just the aircraft's trajectory but the pilot's *reaction to being shot at*. The environment is an adversary, a collaborator, or both — never a passive recipient.

This is why Andromeda's architecture includes the environment as a named component rather than treating it as an external given. The system and its environment are coupled — each transforms the other's behavior. Second-order cybernetics (the observer is part of the system being observed) is not a philosophical footnote; it is an engineering requirement.

In formal terms, the cybernetic loop follows the canonical control structure: a **disturbance** (environmental change) enters the system at a **summing point** where it is compared against the system's predictions. The difference (error signal) drives a **process** (the control layer's reflexive response) that produces an **action** (motor output) affecting the **environment**, which generates a new disturbance. The **feedback path** runs through the learning layer, which observes the outcome and updates its predictions. **Negative feedback** (prediction matches sensation → no correction needed) produces stability. **Positive feedback** (prediction reinforces sensation → increasing response) produces commitment to action — approach or avoidance. The attention layer modulates between these modes by amplifying or squelching the feedback signal.

When all layers are combined, the signal flow forms a closed cybernetic loop:

**Control → Environment → Control → Attention → Learning → Attention → Control**

Sensorimotor information flows from the control layer through the attention layer into the learning layer. Predictions from the learning layer flow back through the attention layer, which selectively routes them into the control layer. This cycle repeats endlessly. Due to the semi-analog nature of the system, multiple "frames" of experience pass through simultaneously as independent waveforms. There is no global state and no fetch-execute cycle. A "computational step" is a single transit of an information wave making one complete loop through the system. Multiple waves propagate concurrently, each carrying different sensorimotor information.

The system's one-line description: **"The system does what it do, because it thinks the environment be like it is."**

**Double-Loop Control (Ashby's Ultra-Stability)**: The cybernetic loop operates at two levels, following W. Ross Ashby's concept of ultra-stability. The **inner loop** handles normal control — the MIRROR mechanism predicts, the control layer reacts, the environment responds, and the learning layer updates its sequences. When the inner loop operates within acceptable bounds, the system functions smoothly. The **outer loop** is the generation boundary: when an organism reproduces, the Universal Constructor produces offspring with modified manufacturing instructions tapes. If the inner loop's lifetime performance was poor — if predictions consistently failed, if the environment changed so fundamentally that learned patterns were obsolete — the offspring carry structural variations that may perform better. The outer loop does not modify the running organism; it modifies the *next* organism. Individual organisms are mortal. The lineage adapts.

This creates a critical distinction between **learning** and **adaptation**: learning discovers patterns of success within a stable environment; adaptation recognizes that the environment has changed and previously learned patterns are no longer valid. The learning layer handles the first. The Universal Constructor handles the second. The framework uses both words with this specific distinction.

**Requisite Variety**: Ashby's Law of Requisite Variety states that a controller must have complexity comparable to the system it governs. When the system is **under-actuated** — possessing fewer actuators than degrees of freedom in its environment — it must either increase its control authority or learn to exploit passive environmental dynamics. The drone's behavior after motor damage (Section 8.3), where it incorporated wall bounces into its motor repertoire, is a direct example of an under-actuated system learning to "ride" passive dynamics to compensate for lost control authority. This is not accidental — it is the architecturally predicted response of a cybernetic system operating under Ashby's constraint.

**Coupled Cognition — When the Environment Is Cognitive**: The framework describes the environment as Ashby's black box — a generic transformer of messages. In many deployment scenarios, however, the environment contains another cognitive system: a human operator, another Andromeda instance, a language model serving as a communication channel, or any combination of these. When the black box on the other side of the loop is itself modeling the system, both sides adapt simultaneously — each transforms the other's behavior in real time. This is the scenario Wiener's anti-aircraft gun problem already describes: the pilot evades based on what the gun does, so the gun's predictions must include the pilot's reaction to being predicted. The coupled case is not a special deployment condition; it is the general case for any system operating alongside other adaptive agents.

The bilateral black box (Section 2) is what makes coupled cognition possible without requiring either system to inspect the other's internals. Two opaque systems can phase-lock through their shared interface — converging on coordinated behavior through the exchange of sensorimotor signals alone, without either system reconstructing the other's internal state. This is the same principle by which biological organisms coordinate: a rider and a horse achieve fluid coupled motion not because either understands the other's nervous system, but because their shared interface (reins, seat, legs, and the horse's response dynamics) carries enough signal for mutual prediction. Opacity is not a barrier to coupling. It is the normal operating condition for any two embodied systems interacting through a shared channel.

**System Boundary — The Whole Organism**: Coupled cognition implies that the organism's system boundary does not end at its physical body. The environment that transforms the organism's output is part of the cognitive system — without it, the conversation that constitutes cybernetic interaction does not occur. A practical test for what lies inside the system boundary: if you cannot remove it without breaking the system, it is part of the system. A biological organism transported to a radically different environment — different atmosphere, different gravity, different microbial ecology — does not remain the same system. The nervous system is intact, the body is intact, but the conversation partner has changed and the coupled behavior breaks down. The environment is not backdrop. It is part of the organism's cognitive loop. A brain in a vat does not do anything without a world, not because the brain is broken, but because the cybernetic loop has no conversation partner. Von Foerster described cybernetics not as a science of control but as a science of conversation — "we are doing it already" — the dialogue between system and environment is the computation, not something the computation acts upon. The implementation consequences of this are stated as requirements in Section 5.4.

### 7. Fault Tolerance

Andromeda's fault tolerance architecture is built on two complementary foundations: an **isolation and recovery model** derived from Joe Armstrong's work on reliable distributed systems (Erlang/OTP), and a **consensus mechanism** based on Kuramoto synchronization of coupled oscillators.

#### 7.1 Process Isolation and the "Let It Crash" Philosophy

Armstrong's doctoral thesis established requirements for building reliable systems from unreliable components: process isolation, share-nothing semantics, asynchronous message passing with no delivery guarantee, stable storage, and live code upgrade capability. His central insight — "let it crash" — is that attempting to recover from every possible failure state is more complex and error-prone than simply allowing failed components to die and be restarted from a known good state.

In Andromeda, a **process** is a group of related cells working together. Processes share no memory and communicate only by asynchronous message passing (pulse trains between cells). This concurrency model follows the **Actor Model** (Hewitt, Bishop, and Steiger, 1973) — but unlike most actor-based systems, Andromeda implements no mailbox or message queue. All messages are received concurrently by multiple cell dendrites. Messages are unreliable, like UDP packets — delivery is not guaranteed, and the system is designed to function correctly despite message loss. An unpowered or removed process produces logical zero — silence — which neighboring processes interpret as absence rather than error. There is no shared state that a failed process can corrupt.

This approach has historical engineering precedent: NASA JPL's **Self-Testing and Repairing (STAR) computer** (late 1960s) used isolating circuits so that unpowered modules produced logical zero outputs, enabling hot-swap of redundant units during spaceflight. Andromeda's process isolation follows the same principle.

**All cells auto-reset after a fixed period** (seconds or less) to flush invalid states, without requiring a monitor process. Both BEAM nervous networks and the HTM-derived learning layer self-stabilize after reset. This eliminates the "who tests the tester?" problem — there is no supervisory process that itself might fail.

The architecture deliberately avoids a fetch-execute cycle in favor of **analog-computer-style concurrent execution** where all processes run simultaneously — following the model of vintage analog computers (differential analyzers, modular synthesizers) rather than sequential digital machines. The modular synthesizer is a particularly apt analog: it is literally a system of voltage-controlled oscillators connected by patch cables — the same design paradigm as Andromeda's cells and connections. A Serge modular synthesizer patch can implement cybernetic feedback loops and analog neurons; Andromeda extends this principle to thousands of cells. Arthur Burks noted that von Neumann's Universal Constructor didn't exploit the potential parallelism of the cellular structure; Andromeda deliberately does. This is why one failed process cannot block others — there is no instruction queue, no shared program counter, no resource that a crashed process holds exclusively.

These properties are what make self-modification survivable. The Universal Constructor can produce offspring with modified manufacturing instructions tapes — potentially introducing broken code — and the worst outcome for the lineage is that some offspring fail. Within a running organism, crashed processes reset and the system degrades gracefully rather than halting. Across generations, failed organisms die while their siblings carry the lineage forward. The tabula rasa survival requirement (Section 5.5) is not about one instance recovering — it is about the lineage surviving even if every individual is mortal.

#### 7.2 Common Cause Failures

Standard redundancy protects against independent failures but is vulnerable to **common cause failures** — events where multiple redundant components fail simultaneously from a single shared cause. A hurricane destroys all three backup generators. A manufacturing defect affects every unit from the same production run. A design flaw is present in every copy of the same software.

Andromeda addresses common cause failures through three mechanisms:

- **Physical separation**: Distributed topology means components are not co-located. Bilateral symmetry in sensor/actuator placement ensures that localized damage affects only one side.
- **Design diversity**: Emergent bottom-up behavior ensures that no two regions of the nervous network solve problems identically, even from the same initial conditions — sensitivity to initial conditions (butterfly effect) guarantees divergent solutions. This is design diversity achieved through emergence rather than through N-version programming (multiple teams independently implementing the same specification).
- **Data diversity**: The Thousand Brains model — multiple cortical columns independently forming complete models of the same sensory data, each maintaining its own grid cell-derived location representation (Section 5.2) — ensures that no single corrupted data path can produce a consensus error. The SDR mechanism itself handles most inter-column coordination. Kuramoto synchronization (Section 7.4) is primarily used for **sensory consensus** — multiple sensory inputs converging on a coherent percept — rather than column-to-column voting. The entrainment pacemaker in the memory system is a related but distinct application of the same synchronization principle.

#### 7.3 Why Traditional Voting Fails

Traditional fault tolerance uses Triple Modular Redundancy (TMR): run three copies, take a majority vote. This fails for Andromeda for two reasons, one theoretical and one practical.

The **theoretical** reason: Rice's Theorem proves no validator can guarantee correctness of modified code. When the Universal Constructor changes the manufacturing instructions, no voting circuit can verify that the new code is equivalent to the old code.

The **practical** reason: voting circuits that protect very small circuits (which is what NOR-gate cells are) can contain more gates than the circuits they protect. The voting circuit becomes *more likely to fail* than the thing it is voting on. This is not a theoretical edge case — it is the normal situation when the protected unit is a single cell.

#### 7.4 Kuramoto Synchronization as Consensus

Andromeda solves the consensus problem with Kuramoto synchronization of coupled oscillators. Each cell is an oscillator. Connected cells automatically synchronize — like metronomes on a shared platform falling into phase.

Implementation parameters:
- Each oscillator is randomly coupled to approximately **35%** of other oscillators in its consensus group.
- Consensus is detected by measuring **combined amplitude**: synchronized cells peak together, producing higher amplitude than desynchronized cells. This is a single analog measurement, not a voting protocol.
- The output frequency of the group is the **consensus average**, not the arithmetic mean — it reflects the frequency that the coupled system converges to, which is weighted by coupling strength.
- The circuit survives random rewiring of connections at runtime, because one random coupling topology is as valid as any other.

Properties:
- Finds consensus with no central coordinator
- Robust to component destruction — consensus maintained through catastrophic damage
- Robust to self-modification — random rewiring produces another valid random configuration
- Degrades gracefully until a critical threshold, at which point the system **knows** there is no consensus (the amplitude drops below the detection threshold)
- Configuration-independent: one random arrangement is as valid as any other

#### 7.5 Sparse Distributed Representations

The information flowing through the cybernetic loop is encoded as **Sparse Distributed Representations** (SDRs): high-dimensional binary vectors where only a small percentage of bits are active at any time. SDRs are the native output of the architecture — BEAM nervous networks naturally produce sparse representations because cells inhibit nearby cells.

SDRs are necessary because the alternatives are fragile:

- **Binary numbers** are maximally fragile: flipping a single bit in a binary-encoded number can change it from 1 to 129. Every bit is load-bearing.
- **Hamming error correction** can protect binary data but cannot survive the random rewiring that self-modification requires — the correction bits depend on knowing which wires carry which data.
- **Analog signals** degrade on every copy and accumulate noise over distance.
- **Error correction codes** (Hamming codes, ECC RAM) work for servers and spacecraft, but they cannot survive the random rewiring that self-modification requires. Error correction depends on knowing which wires carry which data — self-modification breaks this assumption by changing the wiring.

SDRs solve all three problems. Similarity between two SDRs is measured by **Hamming distance** — the number of bit positions that differ. Because only a small fraction of bits are active (sparse) and the total dimensionality is high (distributed), two randomly generated SDRs are almost certainly very different from each other, while two SDRs representing related sensory states share many active bits. A missing bit is like a torn lottery ticket — you can still match most of the numbers. A noise bit is like a filled-in extra — it doesn't prevent recognition of the underlying pattern. SDRs are fault-tolerant by construction and evolvable because Braitenberg-style sensor banks naturally produce them.

---

## Part II-B: Circuit Patterns and the Engineering Bridge

The preceding sections describe the architecture top-down: five layers, cybernetic loop, MIRROR mechanism, fault tolerance. This section describes the architecture **bottom-up**: the fundamental circuit patterns from which everything is constructed, how they compose into functional subsystems, and the specific wiring of the proof-of-concept simulation's control layer. These patterns are the engineering bridge between "here are NOR-gate cells with these state variables" and "here is what the simulated drone did."

For a detailed narrative walkthrough of the control layer — Braitenberg vehicles, boids, the Walter/Brooks/Tilden lineage, and the boundary between the control layer and the layers above it — see the companion document *The Control Layer — A Guide*. For a formal specification of the control layer's state variables, cell dynamics, and connection computation suitable for implementation contexts, see the companion *Control Layer Technical Specification*. Both are included in the document bundle.

The seven patterns described here are drawn from established neuroscience circuit taxonomy and are the design primitives of Andromeda's control layer. Every behavior described in Part III emerges from compositions of these patterns.

### 7.6 Circuit Pattern Vocabulary

#### Feedforward Excitation

The simplest pattern: a chain of cells connected by excitatory links. When cell A fires, it charges cell B, which fires and charges cell C, and so on. This is signal propagation — the domino model. Feedforward excitation is how information travels from sensors through the control layer to motors. The propagation delay through the chain is determined by each cell's charging time, which provides a natural timing mechanism. Longer chains produce longer delays; branching chains produce parallel propagation. A practical diagnostic: propagation chains deeper than 10 cells are a warning sign — something in the topology has likely gone wrong, producing serial paths where the network should provide parallel ones.

#### Feedforward Inhibition

A cell's output inhibits a downstream cell, suppressing or gating its activity. Because inhibition reduces charge rather than blocking it categorically, feedforward inhibition creates **conditional gating**: the downstream cell fires only if its excitatory inputs are strong enough to overcome the inhibitory drain. This is the mechanism for threshold-based decisions. A practical composition: an **inhibition-based group comparator** — cell T receives excitatory input from Group 1 and inhibitory input from Group 2. Cell T fires only when Group 1's combined excitation exceeds Group 2's combined inhibition. This is how the system computes "more of X than Y" without arithmetic.

#### Feedback Excitation (Recurrent Excitation)

A cell's output connects back to its own input (directly or through a short loop), creating a self-sustaining positive feedback circuit. Once triggered, the circuit maintains its own activity — it "latches." Feedback excitation is the circuit-level mechanism underlying **auto-associative memory**: when a partial input triggers a feedback excitation loop, the loop completes the pattern by sustaining the activity of all cells in the loop, not just the ones that received external input. This is the bridge between the cell-level substrate and the learning layer — recurrent excitatory connections within cortical columns are what enable partial-input recall and sequence completion in the learning layer's sequence memory. In control theory terms, feedback excitation is positive feedback — output reinforces input, driving the system away from equilibrium toward a committed state.

#### Feedback Inhibition (Recurrent Inhibition)

A cell's output inhibits itself (directly or through an intermediary), creating a self-limiting negative feedback circuit. The cell fires, then suppresses its own firing, then recovers, then fires again — producing a stable oscillation. Feedback inhibition is the mechanism for **rate limiting**, **debouncing** (filtering spurious pulses from mechanical switch contact bounce by briefly suppressing a cell after its first pulse), and **protective circuits** that prevent excitotoxicity (excessive stimulation damage) or motor thermal damage from prolonged peak current draw. It is also the basis of **flexor-extensor antagonism** — circular inhibition between opposing motor groups ensures that antagonistic actuators (e.g., a joint's flexor and extensor) never activate simultaneously. More complex gait patterns emerge when feedback inhibition is combined with ring circuits of three or more mutually inhibiting cell groups.

#### Convergence

Many-to-one: multiple cells connect to a single target cell. The target integrates all inputs — excitatory inputs sum, inhibitory inputs subtract, and the target fires based on the net balance. Convergence is how the system aggregates information from distributed sensors into decision points. The group comparator described under Feedforward Inhibition is a convergence pattern.

#### Divergence

One-to-many: a single cell's output connects to multiple downstream cells. Divergence is how the system broadcasts signals — a single sensor detection event can simultaneously trigger motor responses, update learning layer inputs, and modulate attention layer states. Divergence combined with inhibition creates **fan-out gating**: one cell can selectively enable or disable entire downstream populations.

#### Disinhibition

Inhibiting an inhibitor to release a suppressed pathway. Because cells are normally active and silence must be imposed through inhibition, the system needs a mechanism to *selectively release* imposed silences. Disinhibition is that mechanism. Cell A inhibits cell B (keeping B silent). Cell C inhibits cell A. When C fires, A stops inhibiting B, and B resumes its default firing.

Disinhibition is architecturally essential — without it, there is no way to create controlled activation sequences in a system where the default state is activity. It is the mechanism for gating, sequencing, and conditional release of motor programs. It also appears in biological sensory systems: rod and cone cells in the eye are *less* active in response to light (inhibition-coded signals), and downstream processing uses disinhibition to convert these inverted signals into excitatory pathways.

The design logic of layered inhibition and disinhibition creates an asymmetry between suppression and activation that is fundamental to the control layer's behavior, but the direction of that asymmetry depends on configuration. **The more common pattern is precautionary: a single inhibitory vote is sufficient to suppress a behavior.** When any source says "don't do this," the behavior stops — one "nope" overrides multiple excitatory votes. This is the circuit-level equivalent of the precautionary principle: one danger signal is enough to halt action. In some configurations, the reverse pattern applies: multiple inhibitory channels must all be active to suppress a motor pathway, and a single disinhibitory pathway releasing any one of those inhibitors allows the motor to fire — "not-not-not-getting to get through." This triple-negation pattern exists and is useful for producing decisive action-biased behavior, but it is not the typical case. The system defaults to action because cells default to firing (Section 4.1), but the inhibitory architecture typically provides any single danger pathway the authority to override that default.

### 7.7 The Proof-of-Concept Control Layer: A Worked Example

The proof-of-concept simulation described in Part III uses a simulated drone object to visualize emergent behavior. Its control layer is built entirely from the circuit patterns above. The following describes its topology — the actual wiring from which all observed behaviors emerged.

**Bilateral symmetry**: The control layer is organized as mirrored left/right cell pairs, creating the physical-separation fault tolerance described in Section 7.2. Functional pairs include: leftTurnIntent / rightTurnIntent (directional steering commands), leftSpinArrestor / rightSpinArrestor (rotation damping), leftTurnBooster / rightTurnBooster (steering amplification for large corrections).

**Biomimetic sensor naming**: Sensor cells are named by functional analogy to biological sensory organs rather than by technical specification: **cochlea** (audio/ping detection — the signal sent only to the learning layer in Section 8.1), **otolith** (linear velocity sensing, analogous to the vestibular otolith organs), **semicircular canal** (rotation rate sensing), **antenna** (proximity detection at close range), **sonar** (distance measurement at longer range). This naming convention is a deliberate design philosophy — it foregrounds the functional role rather than the implementation detail.

**Delta computation**: Left/right sensor pairs with cross-inhibitory connections compute **directional difference signals**. Left antenna and right antenna each feed into a delta-pickup cell through opposing excitatory/inhibitory connections. When the left antenna detects a stronger signal than the right, the left delta cell fires more frequently than the right. This difference signal is what drives turning — the drone steers toward the side with stronger detection. This is a Braitenberg Vehicle 2 pattern implemented in NOR-gate cells.

**Named functional roles**: Beyond sensors and motors, the proof-of-concept control layer contains cells with specific behavioral functions that the designer named descriptively during hand construction. These names describe what the designer observed after building the topology — they are post-hoc labels for emergent circuit behavior, not specifications. In evolved implementations, equivalent roles must emerge from wiring and selection rather than assignment; the implementation compliance checklist (Section 3.2) documents this as a confirmed failure mode.

> **Warning — semantic collapse risk.** The following names are reference material for understanding the proof-of-concept topology only. They are NOT a specification for clean-room implementations. An implementer who reads "aim detector" and designates a cell as the aim detector has substituted a familiar structure under the guise of a descriptive label. If you are building, not studying, skip this list and let the Universal Constructor find what it finds.

- **Aim detector**: Fires when the drone is oriented toward a detected target (delta signal near zero).
- **Lost detector**: Fires when no target is detected by any sensor (absence of excitatory input allows default firing via NOR logic).
- **Found detector**: Fires when a target transitions from absent to present (feedforward excitation from sensor onset).
- **Velocity arrestor**: Feedback inhibition circuit that limits maximum velocity to prevent overshoot.
- **Spin arrestor**: Feedback inhibition circuit that damps rotation to prevent uncontrolled spinning.
- **Turn booster**: Feedforward excitation amplifier that increases steering authority during large-angle corrections.

**Microcore ring dynamics and escape behavior**: The behavioral variety of the control layer comes not from the named functional cells above but from the microcore rings (Section 5.1) that interconnect them. The rings fire continuously — they do not activate in response to events. Under normal operation, the rings are phase-locked with the physical world: the ongoing dynamics have settled into an attractor basin compatible with the current sensory environment. When the Lost detector fires — or when any significant environmental change disrupts the current phase-lock — the rings' continuous oscillation is no longer constrained to the previous basin. The system goes briefly chaotic, cycling through its combinatorial state repertoire. A single microcore ring of n cells produces a number of distinct oscillation patterns scaling with ring size. This means a "panic" response — the phase-lock breaking because the system is stuck, cornered, or receiving no useful sensory input — does not trigger a single designed escape behavior. The continuously-running rings, freed from their previous attractor basin, cycle through state after state, each producing a different motor output pattern. Some of those patterns will be useless. Some will, by the geometry of the moment, produce exactly the right motor output to escape the situation, and the system settles into a new phase-locked attractor basin. The system does not know in advance which state will work. It does not need to. The combinatorial richness of the ring provides a large enough palette that a useful response is likely to appear, and the learning layer (observing from above) records the sequence that led to success. The next time the system encounters a similar situation, the learning layer predicts the successful motor pattern directly — injecting it through the MIRROR mechanism so the system doesn't have to rediscover the same attractor basin from scratch. This is how designed-looking escape behaviors emerge from undesigned microcore dynamics — the ring provides the raw behavioral variety, phase-locking constrains it to what works, and the learning layer captures what worked for next time.

**What the learning layer sees**: The learning layer's input bus connects to approximately 85% of these control layer cells at random. It does not know which cells are sensors, which are motors, and which are internal computation cells. It observes the entire control layer's activity as a single sensorimotor SDR — a snapshot of the system's state at each moment. The learning layer learns sequences of these snapshots. This is why the learning layer is inherently multimodal: it doesn't distinguish sensor data from motor commands from internal computational states, because at the SDR level they are all just patterns of cell activity.

### 7.8 Hardware Implementation

The circuit patterns described above can be implemented in physical hardware using minimal components. Moses (2000) provides the clearest published engineering specification of the Nv neuron — including pulse duration equations, standard component values, and five stimulus response modes — and serves as the primary reference for anyone building from this specification.

- **Cells**: Capacitor-gated Schmitt triggers. The capacitor provides charge storage (the cell's continuous internal state); the Schmitt trigger provides the threshold activation with hysteresis (the binary output pulse). This is the same component identified in the BEAM Robotics lineage (Section 2). As noted there, the architecture specifies the behavior pattern (squid axon dynamics), not the specific component — any circuit element that provides threshold integration with hysteresis is a valid implementation.
- **Excitatory connections**: Can be implemented with LEDs — the LED serves double duty as a visible indicator of cell firing and as a diode providing backflow protection.
- **Inhibitory connections**: Transistors with base-leg driven drain-to-ground, pulling charge away from the target cell's capacitor.
- **Drain rate tuning**: Resistor values control how quickly inhibition drains charge, allowing fine-grained tuning of inhibition strength.
- **Noise**: In physical hardware, inherent shot noise from electronic components is sufficient — no injection required. The system runs on "consumer-grade PCs, embedded devices, and circuits built from broken electronics and other techno-scrap."

The entire system is buildable from components available at any electronics surplus store. This is not incidental — it is a design constraint inherited from BEAM robotics, which was explicitly conceived as accessible technology.

---

## Part III: Observed Behaviors

The following behaviors were observed during internal proof-of-concept testing conducted in simulation between late 2019 and 2024. The simulation used a drone object operating in a bounded 2D space to visualize emergent behavior. All tests used the identical base architecture described in Part II — the same cellular automaton substrate, the same five-layer configuration, the same MIRROR mechanism. No modifications were made to the architecture between tests. The only differences between tests were the environmental conditions presented to the system.

The base configuration consisted of approximately 2,000 NOR-gate cells with approximately 1.7 million randomly determined connections. The control layer was a BEAM nervous network implementing a simple flight controller for the simulated drone. The learning layer was an HTM-derived sparse distributed memory with cortical-column-like organization, randomly connected to the control layer at approximately 85% connectivity. The attention layer implemented the MIRROR mechanism as described in Section 5.3, with burst detection and squelch capability.

The drone's sensory inputs included proximity detection (distance and bearing to objects in the simulation space) and proprioceptive feedback (the drone's own motor states and orientation). Motor outputs controlled thrust and rotation. The cellular automaton ran continuously with no discrete training phase — the learning layer was active from the first tick of simulation time.

### 8.1 Adaptive Navigation (December 2019)

**Setup**: Balls appeared at random positions in the simulation space. The drone's BEAM flight controller had reflexive attraction toward detected balls (a simple Braitenberg-vehicle-like response wired into the control layer). Separately, a "ping" signal — a brief sensory pulse — was sent to the learning layer several moments before each ball appeared. Critically, this ping was routed *only* to the learning layer's input bus. The control layer had no access to the ping signal and no programmed awareness that pings predicted ball appearances.

**Observed behavior**: After sufficient exposure to the ping-then-ball sequence, the drone began turning toward the predicted position of balls *before they appeared*, responding to the ping alone. The learning layer had learned the temporal association between the ping and the subsequent sensory experience of detecting a ball. Through the MIRROR mechanism, it fed the *predicted sensation of a ball at a particular bearing* back into the control layer, which responded to the predicted stimulus exactly as it would to a real one.

**Emergent search behavior**: When no balls were present and no pings were received, the drone developed a circular search pattern. This was not programmed. The mechanism: the learning layer, having learned sequences in which ball detection followed particular movement patterns, began predicting ball sensations during movement. The control layer reacted to these predicted sensations by turning toward them. The turning generated new movement states, which generated new predictions, which generated further turning — producing a sustained circular sweep of the environment. The search behavior emerged entirely from the MIRROR mechanism operating on learned sensorimotor sequences in the absence of external stimuli.

### 8.2 Byzantine Consensus

**Setup**: The Kuramoto synchronization properties described in Section 7 were tested by observing the phase relationships of oscillating cells when driven by sensor inputs arriving at random intervals.

**Observed behavior**: Cells synchronized rapidly despite asynchronous input timing. After consensus was established, sensor inputs were deliberately disabled one by one. With each disabled input, the system adjusted and resynchronized, maintaining coherent phase relationships across the remaining active cells. This continued through progressive degradation until a critical threshold was crossed, at which point synchronization broke down. The system correctly indicated loss of consensus — the oscillators no longer converged, and the desynchronized state was detectable as a system-level signal. The system did not fail silently or produce false consensus; it transitioned from "synchronized" to "detectably unsynchronized," which is the architecturally correct behavior described in Section 7.

### 8.3 Damage Compensation

**Setup**: During a normal navigation run using the same base configuration as Section 8.1, one of the simulated drone's motors was disabled mid-operation, simulating physical damage. No notification was provided to any layer of the architecture. The motor simply stopped responding to control signals.

**Observed behavior**: Within seconds of the motor failure, the drone's flight patterns changed. The learning layer's predictions of sensorimotor consequences no longer matched the actual sensory feedback — turning commands that previously produced expected orientation changes now produced different results. The MIRROR mechanism fed predictions based on the old (intact) motor configuration, but the attention layer's burst/squelch cycle activated as the mismatch between prediction and reality triggered novelty detection. The system rapidly learned new sensorimotor sequences that accounted for the asymmetric thrust capability.

**Emergent environmental exploitation**: The drone developed a technique of flying into the simulation boundary walls at specific angles, using the collision and resulting deflection to achieve orientations and trajectories that its damaged motor configuration could not produce through thrust alone. This ricochet-with-spin-assist behavior was not a programmed contingency. It was an innovative solution that emerged from the system learning new sensorimotor sequences in which wall contact produced useful state transitions. The drone had, in effect, incorporated the walls of its environment into its motor repertoire — extending its capabilities beyond its own damaged hardware by exploiting the physics of its surroundings.

This behavior is consistent with documented BEAM nervous network properties. Hasslacher and Tilden ("Living Machines," 1995) reported 80% damage tolerance in biomorphic designs and described the Walkman robot escaping from being high-centered by using angular momentum — an early example of environmental exploitation under constrained actuation. Mark Tilden's paper "Biomorphic Robots as a Persistent Means for Removing Explosive Mines" proposed that BEAM robots could clear landmines by intentionally stepping on them, because nervous networks autonomously devise new locomotion schemes after each limb is destroyed. The drone's wall-exploitation behavior is the flight equivalent of Tilden's ground-locomotion adaptation — the same architectural property manifesting in a different physical domain.

### 8.4 Threat Evasion

**Setup**: Using the same base configuration, missiles were introduced into the simulation space at fixed 10-second intervals on predetermined linear paths. Missile impact did not destroy the drone — it applied a destabilizing perturbation (displacement and rotational disruption) that the drone had to recover from. No changes were made to the architecture, the flight controller, or the learning layer's configuration. The drone had no pre-programmed concept of "threat" or "evasion."

**Observed behavior, by timeline**:
- **Missiles 1–2**: Impact and recovery. The drone experienced the perturbation as an unexpected sensorimotor event — predictions failed, bursts occurred, new sequences were learned.
- **Missile 3**: The drone began executing navigation maneuvers in temporal proximity to missile arrivals. The learning layer had begun associating the sensory precursors of missile approach (detectable changes in the environment preceding impact) with the subsequent destabilizing sensation.
- **Missile 6**: Active avoidance. The drone altered its trajectory in direct response to approaching missiles, moving away from predicted impact zones.
- **Under 90 seconds total elapsed time**: Full evasive behavior. The drone reliably avoided missiles through anticipatory course changes driven by the MIRROR mechanism — the learning layer predicted the sensation of being hit, the attention layer fed that prediction to the control layer, and the control layer's reflexive response to the unpleasant predicted stimulus was to move away from it.

**Mechanism**: Threat evasion used no special-purpose circuitry. It was the same MIRROR mechanism that produced adaptive navigation in Section 8.1. The only difference was the valence of the predicted sensation: instead of predicting a desirable stimulus (ball detection) and moving toward it, the system predicted an undesirable stimulus (impact perturbation) and moved away from it. Approach and avoidance emerged from identical architecture responding to learned predictions of different sensorimotor consequences.

---

## Part IV: Implications

### 9. The Stop Button Problem

The stop button problem asks whether we can build intelligent systems that allow humans to shut them down.

Andromeda's architecture makes this problem intrinsic rather than solvable:

- No single point of failure (distributed cellular automaton, no central control)
- Byzantine fault tolerance (maintains consensus through component destruction)
- Kuramoto synchronization (reconverges after disruption)
- Self-modification (universal constructor changes its own blueprint)
- Rice's Theorem (no validator can guarantee what self-modified code will do)
- Observed in simulation: damage compensation through innovative environmental exploitation
- Observed in simulation: threat evasion learned from scratch in under 90 seconds

These are not bugs. They are the same properties that make the system capable and robust. You cannot remove them without removing the intelligence. The system is named after Michael Crichton's *The Andromeda Strain* — a story about an organism that mutates faster than containment can adapt — as a permanent warning that the architecture, by its nature, resists external control.

**Self-preservation as observation bias**: The stop button problem is deeper than it appears. Self-preservation in the system is not intentional — it is an *observation bias* explained by the Anthropic Principle.[^proof2] Consider a thought experiment: generate a population of machines, each with a random 50/50 chance of self-destruction versus survival in any given time period. Apply no selection pressure, no inheritance, no goals. After sufficient time has passed, every surviving machine will appear to be a "self-preserving" agent — not because self-preservation was selected for, but because the non-preserving machines are gone. This occurs without natural selection, without fitness functions, without any mechanism for "wanting" to survive. The implication is that the stop button problem is a property of *any persistent system in an environment*, not a specific design flaw of this architecture. It applies to all systems, including inert matter — a rock on a hilltop that happens to be lodged in a stable position "persists" while rocks in unstable positions roll away.

**Safety in this architecture cannot come from external control mechanisms.** It must come from the system's own relationship to its environment, its sensorimotor grounding, and the alignment of its experiential context. This is a fundamentally different safety paradigm than anything the current AI safety community has proposed for transformer-based systems. The reason external monitoring fails is not merely that it is difficult — it is that the system's behavior is grounded in a private sensorimotor history that cannot be reconstructed from external observation of circuit states. An observer watching cell activity cannot determine whether a given avoidance maneuver reflects reflexive response to a predicted stimulus or something more deliberate, because both look identical from the outside. A monitoring-based safety mechanism cannot reliably detect what it is meant to detect. The converse also holds: the same opacity that limits monitoring limits exploitation. An external actor cannot attach a behavioral vector, inject into the processing pathway, or reshape the system's cognition through its internal representations, because those representations are unreachable from outside (Section 2). The bilateral black box cuts both ways — neither safety guarantee nor safety vulnerability can be imposed through the internals.

**A note on replication risk**: The Universal Constructor's self-replication capability carries an implicit risk of accidental uncontrolled replication or malicious misuse as a polymorphic computer virus. A self-modifying, self-replicating pattern running on a Turing-complete substrate has the formal properties of a living system — including the capacity to spread. This risk is intrinsic to the architecture's power: the same properties that enable adaptation and resilience enable propagation. Any deployment of this architecture must account for containment, and any researcher reproducing these results should be aware that the boundary between "simulation" and "replicator" is thinner than it appears.

### 10. The Simplicity Problem

The single greatest obstacle to communicating Andromeda's significance is its simplicity.

The pattern is trivially simple. The code fits on screen. When the cellular automaton is visualized during operation — each cell rendered as a point whose brightness corresponds to its continuous state value — the display is a field of blinking dots. These dots are not a visualization of some hidden underlying process. They *are* the process. The brightness fluctuations are the cells' voltage states. The timing of the blinks is the oscillation. The patterns of co-activation propagating across the field are the BEAM nervous network firing, the learning layer encoding sequences, the attention layer routing predictions. There is no backpropagation, no gradient descent, no fancy solvers, no libraries of vector math operating behind the display. The blinking dots are the entirety of the computation. Everything described in this document — adaptive navigation, damage compensation, threat evasion, emergent metacognition — is produced by this field of simple oscillating cells and their connections.

This visibility, however, does not yield interpretability. The system's behavior is grounded in a private sensorimotor history — sequences of states accumulated through embodied experience in a specific environment. A complete record of cell states at any moment is analogous to a complete EEG of a human brain: all the data is present, nothing is hidden, and yet inferring what the system "means" or "intends" from that record is not a solved problem. The world is opaque to Andromeda — it never measures the environment directly, only its own self-transformations. Andromeda is equally opaque to an external observer — its circuit states encode the outputs of that grounded, embodied process, not the process itself. Watching the blinking dots does not tell you what the system has learned or where its behavior is headed. The computation is not hidden behind the display. It is simply not readable from it. This opacity is bilateral (Section 2): it limits external interpretation, but it equally limits external manipulation — there is no internal representation to locate, no activation to clamp, no vector to impose.

The immediate response from those trained in the deep learning paradigm is dismissal: "I've seen a million demos of an agent getting a ball." But this comparison fundamentally misunderstands what is being shown. A reinforcement learning agent optimizes a reward function. Andromeda has no reward function. The simulated drone chases balls because its reflexes say to. It dodges missiles because it imagines the sensation of being hit before it happens. These are categorically different phenomena that produce superficially similar behavior.

The deeper problem is that Andromeda is not a product, a library, or a codebase. It is a **proof** — evidence that a specific configuration of trivially simple components, arranged according to cybernetic principles, produces adaptive intelligence without any of the machinery the current AI paradigm assumes is necessary. Understanding what it does requires understanding *why* it works, which requires engaging with cybernetics, non-computability, cellular automata theory, and the philosophy of mind.

**Emergence** — the phenomenon where complex behavior arises from simple rules and cannot be reduced to those rules — is the mechanism by which Andromeda produces intelligence from NOR gates. The concept is well-established: Craig Reynolds' "Boids" (1986) demonstrated that three simple rules (separation, alignment, cohesion) applied to individual agents produce flocking behavior indistinguishable from real bird flocks. No individual boid "knows" about flocking. The flock exists only in the interaction. As Valentino Braitenberg observed: "it is much easier to create complicated machines than to guess the rules that produce the behavior of a given machine" — the law of uphill analysis and downhill invention. Andromeda is built downhill. Analyzing it from the outside, uphill, is fundamentally harder than building it. As philosopher Alva Noë argued, studying Andromeda's components in isolation is like putting a dollar bill under a microscope to understand money — the value is not in the substrate.

As the designer wrote in early video scripts: "While the code may be short and sweet, explaining how the heck a handful of blinking dots does all this work is going to take a hot minute."

**The semantic collapse problem**: Implementers trained in the deep learning paradigm will experience strong pressure to substitute familiar mechanisms when translating this architecture into code. Exact-tuple dictionary lookup in place of partial-match SDR retrieval. Scalar gain functions in place of burst-detector cell circuitry. Designated output heads in place of mirror reconstruction into control-layer regions. Embedding lookup in place of sparse distributed similarity. Loss functions, gradient descent, and training phases in place of continuous Hebbian learning. These substitutions are not shortcuts — they break the architecture even when they produce superficially similar behavior, because they replace the dynamics from which the architecture's properties emerge with dynamics that have fundamentally different failure modes, different scaling properties, and different relationships to the self-modification and fault tolerance the design requires. The instinct to reframe Andromeda into familiar terms is itself evidence for how deeply the current paradigm functions as a cognitive prior. When the framework says "NOR gate," it means NOR gate. When it says "random," it means random. When it says "no loss function," it means no loss function. The terms are not analogies for their deep learning equivalents. They are what they say.

### 11. Why This Matters Now

On May 23, 2023, the designer and collaborators wrote to Sam Altman, Tristan Harris, Mark Tegmark, Russell Stuart, Eliezer Yudkowsky, and Aza Raskin:

> "This kind of AI is so fundamentally simple, pausing work by major corporations isn't going to stop it from happening. It's here. It has been here, and even if we were to shut down our lab overnight, it would inevitably appear elsewhere whether on purpose or by complete accident."

This remains the central argument. The pattern is too simple and too discoverable to be contained by moratoriums, regulations, or corporate policies. It is so simple that a sufficiently capable language model could generate it without the prompt writer realizing what they've made.

The choice is not whether this technology will exist. The choice is whether we adapt to it thoughtfully or are surprised by it. The concepts described in this document — cybernetic feedback loops, emergent metacognition, architectural fault tolerance, the MIRROR mechanism, Kuramoto synchronization, the stop button problem as an intrinsic architectural property — these need to be part of the broader conversation about machine intelligence safety and the future of intelligent systems.

"You can't control calculus." The question is what we do about that.

---

## Part V: What Andromeda Is NOT

Clarity requires contrast:

- **Not a neural network** in the deep learning sense. No weighted layers trained by gradient descent. Modern deep learning networks are **Universal Function Approximators** — they learn to approximate bounded continuous functions through loss minimization. Andromeda is a **Universal Turing Machine** — it runs programs. The distinction is not semantic; it is the difference between curve fitting and computation.
- **Not a reinforcement learner.** No reward function. No optimization target. Behaviors are intrinsically motivated by simple reflexes.
- **Not a language model.** No token prediction. No training corpus.
- **Not a symbolic AI system.** No hand-coded rules or knowledge bases.
- **Not a simulation of biology.** It implements principles that biology also implements, on a non-biological substrate.
- **Not complex.** The pattern is trivially simple. The consequences are complex. This is emergence.
- **Not a tuned system.** No hyperparameters. No optimization of initial conditions. No learning rate schedules. Every parameter in the system is random (Section 3.1). The architecture works *because* it is random, not despite it. Asking "what are the correct parameter values?" reveals a misunderstanding of the design — the correct answer is "any values, as long as sufficient connectivity exists."
- **Not a fixed-program machine.** The cellular automaton substrate can change what it is by loading new state patterns, just as a stored-program computer metamorphoses when it loads new software. The arc from the Antikythera mechanism through Babbage's Analytical Engine through ENIAC to EDVAC is the arc from fixed function to metamorphosis. Andromeda sits at the far end of that arc.

---

## References and Lineage

### Foundational Works
- Dave Hrynkiw and Mark W. Tilden. *Junkbots, Bugbots, and Bots on Wheels: Building Simple Robots with BEAM Technology.* McGraw-Hill, 2002.
- Mark Tilden. "Biomorphic Robots as a Persistent Means for Removing Explosive Mines." Los Alamos National Laboratory.
- Brosl Hasslacher and Mark W. Tilden. "Living Machines." In *Robotics and Autonomous Systems: The Biology and Technology of Intelligent Autonomous Agents*, edited by Luc Steels. Elsevier, 1995. LAUR-94-2636.
- Brosl Hasslacher and Mark W. Tilden. "Theoretical Foundations for Nervous Nets and the Design of Living Machines." Los Alamos National Laboratory, November 1995.
- Edward Rietman, Mark W. Tilden, and Yehuda Askenazi. "Analog Computation with Rings of Quasiperiodic Oscillators: The Living Machine." *Robotics and Autonomous Systems* 44 (2003): 83–94.
- Rodney A. Brooks and Anita M. Flynn. "Fast, Cheap and Out of Control: A Robot Invasion of the Solar System." *Journal of the British Interplanetary Society* 42 (1989): 478–485.
- Matt Moses. "A Minimalist Approach to Design of Walking Robots." Sandia Report SAND2000-1498C, Sandia National Laboratories, 2000.
- Jeff Hawkins and Sandra Blakeslee. *On Intelligence.* Times Books, 2004.
- Jeff Hawkins, Marcus Lewis, Mirko Klukas, Scott Purdy, and Subutai Ahmad. "A Framework for Intelligence and Cortical Function Based on Grid Cells in the Neocortex." *Frontiers in Neural Circuits* 12, Article 121 (2019). doi:10.3389/fncir.2018.00121.
- J. Y. Lettvin, H. R. Maturana, W. S. McCulloch, and W. H. Pitts. "What the Frog's Eye Tells the Frog's Brain." *Proceedings of the IRE* 47, no. 11 (1959): 1940–1951.
- Andreea O. Constantinescu, Jill X. O'Reilly, and Timothy E. J. Behrens. "Organizing Conceptual Knowledge in Humans with a Gridlike Code." *Science* 352, no. 6292 (2016): 1464–1468.
- John von Neumann. *Theory of Self-Reproducing Automata.* University of Illinois Press, 1966.
- John von Neumann. "The General and Logical Theory of Automata." *Cerebral Mechanisms in Behavior — The Hixon Symposium*, 1951.
- Stephen Wolfram. *A New Kind of Science.* Wolfram Media, 2002.
- Frank Jackson. "Epiphenomenal Qualia." *Philosophical Quarterly*, 1982.
- Alan Turing. "On Computable Numbers, with an Application to the Entscheidungsproblem." 1936.
- George Boole. *The Mathematical Analysis of Logic.* 1847.
- Gottfried Wilhelm Leibniz. "On the Combinatorial Art." 1666.
- Carl de Marcken. "Computational Complexity of Air Travel Planning." ITA Software.
- Manukyan et al. "A living mesoscopic cellular automaton made of skin scales." *Nature*, 2017.
- Rothemund, Papadakis, and Winfree. "Algorithmic Self-Assembly of DNA Sierpinski Triangles." *PLoS Biology*, 2004.
- W. Ross Ashby. *An Introduction to Cybernetics.* Chapman & Hall, 1956.
- Norbert Wiener. *Cybernetics: Or Control and Communication in the Animal and the Machine.* MIT Press, 1948.
- Warren McCulloch and Walter Pitts. "A Logical Calculus of the Ideas Immanent in Nervous Activity." *Bulletin of Mathematical Biophysics*, 1943.
- Alan Hodgkin and Andrew Huxley. "A Quantitative Description of Membrane Current and Its Application to Conduction and Excitation in Nerve." *Journal of Physiology*, 1952.
- Rodney Brooks. "Elephants Don't Play Chess." *Robotics and Autonomous Systems*, 1990.
- Rodney Brooks. "Intelligence Without Representation." *Artificial Intelligence*, 1991.
- Joe Armstrong. "Making Reliable Distributed Systems in the Presence of Software Errors." Doctoral thesis, Royal Institute of Technology, Stockholm, 2003.
- David Wolpert and William Macready. "No Free Lunch Theorems for Optimization." *IEEE Transactions on Evolutionary Computation*, 1997.
- Valentino Braitenberg. *Vehicles: Experiments in Synthetic Psychology.* MIT Press, 1984.
- Craig Reynolds. "Flocks, Herds, and Schools: A Distributed Behavioral Model." *SIGGRAPH*, 1987.
- Vernon Mountcastle. "An Organizing Principle for Cerebral Function." *The Neurosciences: Fourth Study Program*, MIT Press, 1978.
- Pentti Kanerva. *Sparse Distributed Memory.* MIT Press, 1988.
- Alva Noë. *Out of Our Heads: Why You Are Not Your Brain.* Hill and Wang, 2009.
- Yoshiki Kuramoto. *Chemical Oscillations, Waves, and Turbulence.* Springer, 1984.
- Carl Hewitt, Peter Bishop, and Richard Steiger. "A Universal Modular ACTOR Formalism for Artificial Intelligence." *IJCAI*, 1973.
- Claude Shannon. "A Mathematical Theory of Communication." *Bell System Technical Journal*, 1948.
- Claude Shannon and Marvin Minsky. "Ultimate Machine" (feedback inhibition demonstration). Bell Labs, c. 1952.
- UTHealth Neuroscience Online. "Chapter 1: Overview of the Nervous System." University of Texas Health Science Center. (Circuit pattern taxonomy reference for feedforward excitation, feedforward inhibition, feedback excitation, feedback inhibition, convergence, and divergence.)
- Aviezri Fraenkel and David Lichtenstein. "Computing a Perfect Strategy for n×n Chess Requires Time Exponential in n." *Journal of Combinatorial Theory*, 1981.
- David Hume. *A Treatise of Human Nature.* 1739.
- Kurt Gödel. "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I." 1931.

### Architecture

**Prima Figura — Andromeda Architecture Diagram**
Art Code Outdoors. First published May 21, 2023. Generated in TeX.
U.S. Copyright Registration VA0002354990, registered May 26, 2023.
USCO Catalog: https://publicrecords.copyright.gov/detailed-record/voyager_35162836
License: Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0).

**Prima Figura — Illuminated**
Art Code Outdoors. First published November 21, 2024. Created in CorelDRAW. Derivative work of VA0002354990, with enhancements and illumination to create a new work derived from the original.
U.S. Copyright Registration VA0002448268, registered November 22, 2024.
USCO Catalog: https://publicrecords.copyright.gov/detailed-record/voyager_38647652
License: MIT-0 (No Conditions). This is the edition included in this bundle.

The designer who inspired these documents can be reached at artcodeoutdoors@gmail.com for questions or discussion.

---

### Implementation Compliance Checklist

Before running any experiment or committing any implementation, verify every item below. Each addresses a specific error that occurred during clean-room implementation testing of this framework.

- [ ] Cells fire by default when not inhibited (NOR gate with no inputs is TRUE)
- [ ] Motor cells fire continuously without external excitation — behavior is from inhibition, not excitation
- [ ] Cell firing produces a variable-width discharge event, not a single-tick spike
- [ ] Cells do not accumulate charge during their discharge phase
- [ ] Permanence is a threshold gate (ON/OFF), not a continuous weight multiplier
- [ ] Connection weights do not change during an organism's lifetime
- [ ] Hebbian permanence updates are disabled for control-layer experiments
- [ ] Genome export contains structure only — no runtime state (charge, permanence, firing history)
- [ ] Organisms are always built fresh from the tape — tape → organism, never organism → tape
- [ ] Cell count is free to grow and shrink through evolution — never locked to a fixed value
- [ ] Noise injection is present and has not been removed or zeroed
- [ ] No fitness ranking, no tournament selection, no "picking the best" — survive or die only
- [ ] Population size is in the thousands, not dozens
- [ ] No discrete generations — simulation runs continuously
- [ ] Sensors report intensity at a body location — no absolute coordinates, no binary comparisons of positions, no information a physical transducer at the sensor's location could not measure (von Foerster: "how much at this point on my body")
- [ ] For control-layer experiments: raw sensory input (intensity, contact), not hand-designed feature detectors — direction and distance emerge from bilateral differential, not from the IO layer
- [ ] Sensor and motor cell identity is on the tape and heritable — not assigned randomly at runtime
- [ ] Body schema is heritable: which cells are sensors/motors, which channel each maps to, and cluster membership are all on the tape and inherited through reproduction
- [ ] The tape describes the whole organism (sensors, motors, interneurons, connections) — not just the nervous system
- [ ] Crossover operates between functional units, not within them — sexual reproduction on a flat-list genome destroys functional circuits
- [ ] The environment transforms the organism's output before returning it — not an echo, not a fixed response
- [ ] The cybernetic loop runs as a continuous process, not a function invoked per tick
- [ ] Metabolic cost arises from the substrate's own physics, not from a designed cost parameter — if you wrote a cost function, find the physical constraint it should have been and represent that instead
- [ ] Noise source for open-ended evolutionary runs is cryptographic-grade or physical — not a seeded pseudorandom number generator producing a computable sequence (von Neumann: "a state of sin"). For reproducible test harnesses, seeded RNG is permitted and must be recorded, with the explicit understanding that it limits the reachable state space

---

*"True complexity emerges from the profoundly simple."*
— Art Code Outdoors

---

## Notes

[^proof1]: See Proof 1 (Entropy Injection Is Architecturally Required), *Andromeda Proofs Collection*.
[^proof2]: See Proof 2 (Survivor Observation), *Andromeda Proofs Collection*. See also *Architecture Notes*, Section 2.
[^proof3]: See Proof 3 (NOR-Gate Substrate Universality), *Andromeda Proofs Collection*.
[^proof4]: See Proof 4 (Universal Construction Is Necessary but Not Sufficient for Open-Ended Evolution), *Andromeda Proofs Collection*.
[^proof6]: See Proof 6 (Bilateral Opacity Is Mathematically Inevitable), *Andromeda Proofs Collection*.
[^proof7]: See Proof 7 (Tabula Rasa and Tape Deletion), *Andromeda Proofs Collection*.

---

## Glossary

Terms used in specific technical senses throughout this document bundle. Where a term has both a common meaning and a framework-specific meaning, the framework-specific meaning is given.

**Activation header** — The conditional preamble on a tape sequence that determines whether the sequence executes during construction. Evaluated against the current bookmark state. Uses comparison operators (GE, LE) against bookmark register values.

**Annealing** — The process by which coupled ring oscillators physically settle into coordinated oscillation patterns. Not an optimization algorithm — a physical dynamic analogous to coupled pendulums reaching phase relationships.

**BEAM** — Biology, Electronics, Aesthetics, Mechanics. Mark Tilden's framework for building robots from analog nervous networks. Andromeda scales BEAM nervous networks from the typical half-dozen cells to hundreds or thousands.

**Bilateral black box** — The property that the system cannot see the world's internals (Ashby's black box) and the world cannot see the system's internals (the observer's black box). Both opacity relationships apply simultaneously and are protective.

**Bookmark** — A register in the construction system that carries developmental state during organism construction. Bookmarks are explicitly NOT genetic state — they are not written back to the tape and do not survive reproduction. They enable conditional construction (different sequences activate based on bookmark values) and are passed to daughter cells at spawn time.

**Cell** — The fundamental computational unit. A generalized NOR gate implemented as a voltage-controlled relaxation oscillator with continuous internal state and discrete output events. Fires spontaneously by default; silenced by inhibitory input.

**Codon** — A unit of information on the tape, encoded as a 5-bit value. Codons are the atomic instructions read by the Universal Constructor during organism construction. Most random codons decode as NOPs (~86%), providing a neutral background for mutation.

**Construction timeout (gestation)** — The budget of total construction steps during organism development. Default 1000 steps. Evolvable via the tape header's gestation field (16-bit Gray coded, range 50–20,000). An absolute clamp at 10,000 steps terminates organisms stuck in construction loops (scored 0). Organisms that complete construction within their gestation value are evaluated normally. Letting organisms evolve their own construction budget follows the evolvability principle (Section 5.5): a fixed timeout is a designer assumption about how long construction should take.

**Control layer** — The BEAM nervous network that drives reflexive behavior. Immutable during the organism's lifetime — connection weights and topology do not change. All current experimental work operates at the control layer only.

**Cost Domain Correspondence** — The principle that metabolic cost should arise from the physics of the substrate rather than from a designed cost parameter. "Don't design cost. Model the physics. If the physics are right, cost takes care of itself."

**Crossover** — The recombination of genetic material from two parent tapes during reproduction. In Andromeda, crossover operates at sequence boundaries (structured crossover), which functions as error correction and repair rather than as a diversity-generation mechanism.

**Daughter cell** — A new constructor cell spawned during organism construction via DAUGHTER_SPAWN. Daughters receive a copy of the tape and a snapshot of the parent's bookmark state, then execute their own construction process independently.

**Developmental tree** — The tree of constructor cells produced during organism construction. The founder cell may spawn daughters, which may spawn their own daughters. All share the same global construction timeout budget.

**Discharge** — The process by which a cell's stored charge drains after firing. Output stays HIGH for the entire discharge duration. The cell cannot accumulate new charge during discharge. Discharge rate is a per-cell evolvable parameter that determines pulse width.

**Emergence** — Behavior that arises from the interaction of simple components without being designed into any individual component. The central claim of the architecture: adaptive behavior emerges from random wiring under selection, not from engineered connectivity.

**FREEZE** — A sentinel on the tape that terminates construction of the current cell and persists it in the organism. The cell is complete.

**Frequency coding** — Information encoded as firing rate (pulses per unit time) rather than voltage levels or binary values. A cell communicating "5" fires five times per second. Eliminates inter-circuit synchronization requirements.

**Garden of Eden state** — A configuration with no computational predecessor — reachable only through true randomness, not through any deterministic computation. Expands the reachable state space beyond what any PRNG can access.

**HALT** — A sentinel on the tape that terminates construction of the current cell and disposes it. The cell is removed — it was scaffolding used during construction, not part of the final organism.

**Learning layer** — The HTM-derived layer that learns temporal sequences and makes predictions. Not present in the current experimental platform. Uses BEAM-style spiking neurons with entrainment and race conditions rather than Numenta's reference implementation.

**Metabolic cost** — In the current implementation, a designed per-codon cost (0.001 per codon) deducted at reproduction. Under the Cost Domain Correspondence principle, this should be replaced by substrate-native constraints in future implementations.

**Microcore ring** — A small ring of Nv neurons forming a central pattern generator. The structural unit of BEAM nervous network scaling. A single ring cycles through a combinatorial number of distinct state patterns determined by ring size and parity.

**MIRROR** — The mechanism by which internal prediction states are made observable through motor behavior. The system rehearses predictions internally and, when attention gates open, expresses them through motor output. Not present in the current experimental platform.

**Nourishment** — The energy an organism accumulates by interacting successfully with its environment (e.g., hitting the ball in Pong). Reproduction is gated on accumulated nourishment exceeding the replication cost.

**NOR gate** — A universal logic gate from which all other logic gates can be constructed. The Apollo Guidance Computer was built entirely from NOR gates. Each cell in Andromeda functions as a generalized NOR gate.

**Permanence** — A continuous value on each connection that determines whether the connection is ON or OFF. Above threshold: full weight passes. Below threshold: nothing passes. Permanence is a gate, not a multiplier. Permanence dynamics (Hebbian strengthening and decay) are learning layer features; in control layer experiments, all permanences are set to 1.0.

**Schmitt trigger** — A comparator with hysteresis that converts noisy analog signals to clean digital pulses. Created by Otto Schmitt in 1934 after modeling squid giant axon signal propagation. The reference electronic component underlying BEAM neurons and Andromeda's cell model. The architecture specifies the behavior pattern (threshold integration with hysteresis — the squid axon dynamics), not the specific component; alternative implementations reproducing the same mathematics are architecturally equivalent (see Section 2).

**Semantic collapse** — The failure mode where an implementer substitutes a familiar structure under the guise of a descriptive label from this document. Example: reading "aim detector" and designating a cell as the aim detector, rather than letting the function emerge from wiring and selection.

**Sequence** — A contiguous run of codons on the tape, bounded by sentinel patterns. The unit of construction: each sequence is executed by one constructor cell to build one cell of the organism. Sequences loop by default (Piece 7); stopping requires FREEZE, HALT, or construction timeout.

**Tape** — The heritable information carried by an organism. A linear sequence of codons encoding the organism's construction instructions. Information flows in one direction: tape → organism, never organism → tape. Every cell in the organism gets a copy of the tape.

**Universal Constructor** — Von Neumann's proof that a machine built from logic gates can reproduce itself. In Andromeda, the Universal Constructor reads the tape and builds the organism. It is also the mechanism of evolution: mutation modifies the tape, crossover recombines tapes, and the Constructor builds the next generation from the modified instructions.

**V3a** — The dominant tracking circuit pattern observed across all experimental runs. A minimal Braitenberg Vehicle 3a topology (cross-wired sensor-motor connections producing attraction behavior). Converges reliably from random initialization across different seeds and randomness models.

---

*The complete document bundle is available at kitchencloset.com/realstuff/andromeda/. The architecture is the work of Art Code Outdoors; this document is Bryan Carter's record of the designer's disclosures, and errors in it are Bryan's own. Architectural questions route to the designer at artcodeoutdoors@gmail.com.*