DOI: Pending assignment
John Swygert
August 1, 2026
Abstract
The Swygert Theory of Everything AO proposes:
\[
V=E\times Y,
\]
where \(V\) is realized value or outcome, \(E\) is energy or opportunity, and \(Y\) is Encoded Equilibrium: the organized system of boundaries, rules, relationships, permissions, states, and pathways governing expression.
This paper argues that computers provide an unusually clear operational demonstration of this grammar. Electrical energy alone does not compute. Data alone does not produce a determined result. A processor, program, or artificial intelligence system functions only because energy and information pass through encoded architectures that constrain possible state transitions.
Computers therefore constitute proof at an engineered-system level that energy or opportunity does not independently determine outcome. They do not establish that \(V=E\times Y\) is the final universal law of physics, nor do they prove the TSTOEAO substrate. They demonstrate that the theory’s central grammar is indispensable within one of humanity’s most precise and reproducible classes of systems.
Voice recognition provides a particularly powerful example. A continuous acoustic signal contains multiple plausible linguistic pathways. The recognition system must select among them through learned context, acoustic features, language probabilities, timing, hardware, software, and decoding rules. The mistaken transcription of provenance as Providence illustrates that an error may be the successful completion of the wrong pathway rather than the absence of a pathway.
This paper develops the concepts of route-space, pathway selection, nested Encoded Equilibrium, error stabilization, higher-order correction, and computational provenance. It proposes prospective experiments in which identical inputs and energy conditions are processed through modified \(Y\) architectures to produce predictably different outputs.
The central conclusion is:
> A computer cannot transform possibility into computation without encoded boundaries governing which state may follow which.
1. Introduction
A powered computer is not necessarily a computing computer.
Electrical energy may enter the machine while the system:
remains idle;
crashes;
overheats;
waits for input;
enters the wrong state;
executes corrupted instructions;
or performs a completely different task.
Energy is necessary.
It is not sufficient.
Likewise, data may exist in memory without becoming:
a calculation;
a document;
an image;
a decision;
a sound;
or a meaningful output.
The result depends upon the architecture through which the energy and data are permitted to move.
That relationship is expressed by:
\[
V=E\times Y.
\]
For computation:
\[
V_C=E_C\times Y_C,
\]
where:
\(V_C\) is the realized computational output;
\(E_C\) is the available computational energy, signal, data, or processing opportunity;
\(Y_C\) is the encoded architecture governing permitted transitions.
The computer is therefore not merely an example used to illustrate the theory.
It is an engineered system that cannot operate without the theory’s central grammar.
2. What Kind of Proof Is Claimed?
The word proof must be used carefully.
This paper distinguishes three levels.
2.1 Operational proof
An operational proof shows that the proposed relationship is necessary and reproducible within a defined class of systems.
Computers satisfy this level.
A computer cannot produce determinate computation without:
encoded states;
transition rules;
boundaries;
timing;
memory;
addressing;
and permissible pathways.
2.2 Cross-domain structural evidence
If the same grammar recurs in computation, biology, materials, cognition, institutions, and physics, that recurrence strengthens the case that the framework identifies a general organizational principle.
Computers contribute to this level but do not complete it.
2.3 Ultimate unification proof
Ultimate proof would require demonstrating that the same formal law governs fundamental physical reality, including independently measurable variables and predictions unavailable from existing theories.
Computers do not establish this level.
The claim is therefore:
> Computers provide operational proof of Encoded Equilibrium as a necessary condition of engineered computation, not final proof that TSTOEAO is the complete unification of nature.
3. Computation as Constrained State Transition
Alan Turing’s 1936 model described computation through a machine occupying finite internal configurations, reading symbols from a tape, writing symbols, moving, and changing state according to defined instructions. The outcome follows from permitted transitions among configurations rather than from the existence of symbols alone.
This gives a direct computational form:
\[
S_{n+1}=F(S_n,I_n,R),
\]
where:
\(S_n\) is the current state;
\(I_n\) is the current input;
\(R\) is the encoded transition rule;
\(S_{n+1}\) is the next state.
Without \(R\), the next state is not computationally determined.
In TSTOEAO terms:
\[
E=(S_n,I_n),
\]
\[
Y=R,
\]
\[
V=S_{n+1}.
\]
The machine works because the possibility space is restricted.
It does not respond in every imaginable way.
It responds through selected, encoded routes.
4. The Computer Is a Boundary Machine
A computer is composed of boundaries at every scale.
These include:
voltage thresholds;
memory locations;
instruction boundaries;
address spaces;
file formats;
permission systems;
timing intervals;
software interfaces;
network protocols;
and logical conditions.
The boundary is not merely a wall around the computer.
It is the structure that distinguishes:
one state from another;
valid input from invalid input;
executable instruction from inert data;
permitted memory access from prohibited access;
and correct sequence from disorder.
A system without boundaries cannot distinguish.
A system that cannot distinguish cannot compute.
Therefore:
> Computation is organized distinction through permitted transition.
5. Energy Alone Does Not Execute
A processor may receive electrical power, but power does not independently specify:
which program runs;
which data is read;
which branch is selected;
which output is produced;
or whether the result is correct.
The same energy source may support:
a music player;
a scientific simulation;
a word processor;
a game;
a malicious program;
or an idle screen.
The difference lies in \(Y\).
\[
E_{\text{same}}
\times
Y_1
=
V_1,
\]
\[
E_{\text{same}}
\times
Y_2
=
V_2.
\]
Changing the encoded equilibrium changes the outcome even when the available energy remains broadly similar.
This is one of the clearest demonstrations of the TSTOEAO proposition:
> Energy alone does not determine outcome.
6. Data Is Opportunity, Not Outcome
Data does not contain its own complete interpretation.
The same bit pattern may represent:
a number;
a color;
a sound sample;
a machine instruction;
a letter;
a memory address;
or meaningless corruption,
depending upon the encoding and the system reading it.
Thus:
\[
D\times Y_{\text{format}}
=
M,
\]
where:
\(D\) is data;
\(Y_{\text{format}}\) is the interpretive encoding;
\(M\) is realized meaning within the system.
The data is an opportunity for expression.
The encoding selects the expression.
7. Shannon’s Channel and the Preservation of Expression
Claude Shannon’s mathematical theory of communication formalized communication through a source, transmitter, channel, receiver, destination, and the possibility of noise affecting the signal. His framework demonstrates that the preservation of information depends upon the structure of the communication system rather than upon the source signal alone.
The communication sequence can be represented:
\[
\text{source}
\rightarrow
\text{encoding}
\rightarrow
\text{channel}
\rightarrow
\text{decoding}
\rightarrow
\text{destination}.
\]
In TSTOEAO:
\[
E=\text{available signal},
\]
\[
Y=\text{encoding, channel conditions, noise constraints, and decoding},
\]
\[
V=\text{received expression}.
\]
The received result is not determined by the source alone.
It is determined by the entire route.
8. Nested Encoded Equilibrium
A modern computer does not possess only one \(Y\).
It contains nested levels:
\[
Y_{\text{physical}}
\subset
Y_{\text{logic}}
\subset
Y_{\text{instruction}}
\subset
Y_{\text{operating system}}
\subset
Y_{\text{application}}
\subset
Y_{\text{user context}}.
\]
Each level constrains the level above it.
Physical layer
Distinguishes stable electrical states and timing.
Logical layer
Defines operations such as comparison, conjunction, exclusion, and branching.
Instruction layer
Defines which machine operations are permitted.
Operating-system layer
Controls processes, resources, memory, files, and permissions.
Application layer
Defines task-specific routes.
User-context layer
Supplies purpose, input, interpretation, and correction.
The result emerges through all of them together.
A failure at one layer can alter or destroy expression at every higher level.
9. Code as Encoded Route-Space
A program is a route architecture.
It does not merely contain information.
It defines:
possible branches;
conditions;
loops;
exceptions;
destinations;
and stopping rules.
Conceptually:
\[
R=
\{
r_1,r_2,\ldots,r_n
\},
\]
where \(R\) is the set of permitted routes.
The current state and input determine which route becomes active:
\[
r^*
=
\operatorname{Select}(S,I,Y).
\]
The output follows:
\[
V
=
\operatorname{Execute}(r^*).
\]
The program therefore converts broad computational possibility into a specific expressed pathway.
> Code is encoded route-space.
10. Bugs as Boundary Errors
A software bug does not necessarily mean that no rule exists.
It may mean that:
the wrong rule exists;
a boundary was defined incorrectly;
a condition routes to the wrong branch;
a valid case was excluded;
an invalid case was accepted;
or the system stabilized in an unintended state.
This gives a general principle:
> An error is often not the absence of a pathway. It is the successful execution of the wrong pathway.
That principle becomes especially visible in voice recognition.
11. Voice Recognition as Route Selection
Automatic speech recognition transforms acoustic input into text.
Modern end-to-end systems can learn mappings from audio sequences to textual sequences, using model architecture and objective functions to select a likely transcription from many possible alignments and symbol paths.
The process may be represented as:
\[
A
\rightarrow
F
\rightarrow
H
\rightarrow
W,
\]
where:
\(A\) is the acoustic signal;
\(F\) is extracted or learned representation;
\(H\) is the hypothesis space;
\(W\) is the selected word sequence.
In TSTOEAO:
\[
E=\text{acoustic possibility},
\]
\[
Y=\text{model, context, vocabulary, timing, decoding, and prior probabilities},
\]
\[
V=\text{transcribed expression}.
\]
The machine does not hear a completed word object.
It receives a changing signal that can support multiple interpretations.
The model selects a route.
12. Provenance Becomes Providence
The spoken word provenance may be transcribed as Providence.
The two expressions are not identical.
They share enough acoustic and linguistic features that both occupy nearby routes in the recognizer’s hypothesis space.
The intended path is:
\[
\text{provenance}.
\]
The selected path becomes:
\[
\text{Providence}.
\]
The system has not failed to produce an output.
It has successfully stabilized in the wrong output.
This is critical.
The error demonstrates that the result expresses not only the originating signal but also the boundary conditions of interpretation.
> Expression reveals both the input and the pathway through which the input was resolved.
13. The Role of Context
The phrase:
> chain of authorship provenance
strongly favors provenance.
A sentence about Rhode Island may favor Providence.
The acoustic input may be similar while the surrounding context changes the selected route.
Therefore:
\[
V
=
f(A,C,Y),
\]
where:
\(A\) is acoustic input;
\(C\) is context;
\(Y\) is the recognition architecture.
The same or similar sound can produce a different word because the contextual Encoded Equilibrium has changed.
This is not a flaw unique to machines.
Humans also use context to resolve ambiguous sound.
Voice recognition makes the pathway computationally visible.
14. Correction as Reopened Route-Space
After the machine writes Providence, the human recognizes the mismatch.
The output is compared with intention:
\[
V_{\text{machine}}
\neq
V_{\text{intended}}.
\]
The human reopens the route-space:
\[
H’
=
H+\text{corrective context}.
\]
The corrected expression becomes:
\[
V’=\text{provenance}.
\]
Thus:
> Correction is the reopening of route-space after a system stabilizes in the wrong expression.
Correction does not erase the pathway history.
The error itself contains information about:
acoustic similarity;
model assumptions;
contextual weakness;
and the boundary that selected the wrong route.
15. The Human as Higher-Order Boundary
The voice-recognition system has its own local \(Y\).
The human user supplies a higher-order \(Y_H\).
\[
V_{\text{final}}
=
E\times Y_{\text{machine}}\times Y_H.
\]
This is conceptual multiplication rather than a completed physical formula.
It represents layered selection.
The machine proposes.
The human evaluates.
The human may:
accept;
reject;
modify;
clarify;
or repeat.
The final text therefore emerges through coupled boundaries.
This resembles human-AI authorship more broadly.
AI provides routes.
The author governs which routes remain in the work.
16. Computing as Continuous Reciprocal Correction
Many computational systems operate through repeated cycles:
\[
\text{input}
\rightarrow
\text{state update}
\rightarrow
\text{output}
\rightarrow
\text{feedback}
\rightarrow
\text{new input}.
\]
In TSTOEAO terms:
\[
E_n\times Y_n=V_n,
\]
followed by:
\[
V_n\rightarrow Y_{n+1}.
\]
The outcome of one computation changes the conditions of the next.
Examples include:
adaptive interfaces;
error correction;
model training;
control systems;
interactive dialogue;
and user-guided revision.
The computer is therefore not always a one-way calculator.
It can participate in dynamic equilibrium.
17. Files, Protocols, and Provenance
A digital file remains usable only if its encoding and context are preserved.
A sequence of bits without information about:
file type;
character encoding;
compression;
schema;
version;
and permissions
may become inaccessible or misinterpreted.
This gives a direct parallel to authorship provenance.
Text detached from its developmental metadata may remain readable while its origin becomes unknowable.
A computer requires protocols to preserve operational meaning.
Authorship requires provenance to preserve intellectual meaning.
Both depend upon continuity across transitions.
18. A Computer Experiment for \(V=E\times Y\)
The theory can be tested operationally through controlled computational experiments.
Experiment One: Constant input, changed encoding
Hold input data constant.
Apply different format decoders.
Prediction:
\[
E=\text{constant},
\]
\[
Y_1\neq Y_2,
\]
therefore:
\[
V_1\neq V_2.
\]
Experiment Two: Constant audio, changed language context
Use the same audio recording.
Supply different contextual prompts or language models.
Prediction:
\[
A=\text{constant},
\]
\[
Y_{\text{context},1}\neq Y_{\text{context},2},
\]
therefore transcription probabilities change.
Experiment Three: Constant hardware energy, changed software
Run two programs under similar hardware and energy conditions.
Prediction:
\[
E_{\text{hardware}}\approx\text{constant},
\]
\[
Y_{\text{program},1}\neq Y_{\text{program},2},
\]
therefore:
\[
V_1\neq V_2.
\]
Experiment Four: Boundary degradation
Corrupt instructions, timing, permissions, or memory.
Prediction:
\[
Y\rightarrow Y’,
\]
and the output becomes degraded, unstable, or incorrect even when power remains available.
These experiments do not prove universal physics.
They demonstrate the operational necessity of encoded conditions.
19. The Computer as a Designed Demonstration of TSTOEAO
Computers are useful because their architectures are intentionally explicit.
Natural systems may conceal their governing conditions.
Computers expose them.
A program works only because:
states are distinguishable;
transitions are constrained;
routes are encoded;
boundaries are enforced;
memory preserves history;
and errors can be detected relative to expected output.
This is nearly a direct engineering translation of Encoded Equilibrium.
The machine’s success is not produced by energy alone.
It is produced by energy operating through encoded organization.
20. Why This Is More Than an Analogy
An analogy merely observes similarity.
The computer case is stronger.
Remove the encoded transition system, and computation ceases.
Remove distinctions among states, and information cannot be reliably represented.
Remove sequence, and instructions lose order.
Remove addressing, and data cannot be located.
Remove boundaries, and processes interfere without control.
Remove feedback, and many errors cannot be corrected.
Therefore, Encoded Equilibrium is not decorative language added after the machine works.
It describes conditions without which the machine cannot work.
That is operational proof within the domain.
21. The Limits of the Proof
The argument does not establish that:
1. all physical systems are computers;
2. the universe is a simulation;
3. computation proves the TSTOEAO substrate;
4. \(Y\) is already a measurable universal scalar;
5. engineered systems and fundamental physics share identical mechanisms;
6. every computational rule has a direct cosmological equivalent;
7. or digital logic explains consciousness.
The claim is narrower:
> A major class of precise, reproducible systems demonstrates that possibility becomes determinate expression only through encoded routes and boundaries.
The universal claim remains to be tested beyond the engineered domain.
22. Small-Scale Proof and Large-Scale Research
Computers belong to the smaller-scale side of TSTOEAO research.
They demonstrate:
\[
\text{energy}
+
\text{boundary}
+
\text{encoding}
+
\text{route selection}
=
\text{realized function}.
\]
The cosmological hypothesis asks whether the same grammar applies at the largest scale:
\[
\text{substrate possibility}
+
\text{universal boundary}
+
\text{permitted states}
=
\text{physical universe}.
\]
The mechanisms may differ.
The grammar may recur.
The correct research strategy is therefore parallel:
identify the encoded variables in engineered systems;
measure how changing them changes output;
determine which features transfer across domains;
and avoid claiming identity where only structural similarity has been established.
23. Voice Recognition as a Model of Physical Expression
The voice-recognition example suggests a deeper proposition.
A signal does not arrive at expression without passing through boundaries.
At each boundary, it may be:
preserved;
narrowed;
amplified;
translated;
distorted;
or redirected.
The sequence is:
\[
\text{intention}
\rightarrow
\text{vocal expression}
\rightarrow
\text{acoustic transmission}
\rightarrow
\text{microphone capture}
\rightarrow
\text{digital encoding}
\rightarrow
\text{model interpretation}
\rightarrow
\text{text}
\rightarrow
\text{human correction}.
\]
Meaning travels through successive transformations.
Every transformation contributes to the final expression.
This yields:
> Meaning is not transmitted by the source alone. It is co-produced by the route.
24. The Provenance Connection
The accidental substitution of Providence for provenance is humorous because the resulting word remains valid while the intellectual chain is wrong.
That is also what happens when authored text loses provenance.
The words may remain coherent.
The source route disappears.
A provenance system preserves:
\[
\text{who intended}
\rightarrow
\text{what was expressed}
\rightarrow
\text{how it was transformed}
\rightarrow
\text{who corrected}
\rightarrow
\text{who approved}.
\]
Computers therefore supply both:
an example of Encoded Equilibrium;
and a means of recording authorship Encoded Equilibrium.
25. Central Propositions
The paper’s principal propositions are:
> A computer is a boundary machine.
> Code is encoded route-space.
> Data is opportunity, not completed meaning.
> Energy powers computation but does not determine the computation.
> An error may be the successful completion of the wrong pathway.
> Correction reopens route-space after premature or incorrect stabilization.
> The human user functions as a higher-order feedback boundary.
> A digital system preserves meaning only while its encoding and provenance remain recoverable.
> Computers provide operational proof of \(V=E\times Y\) within engineered systems.
Conclusion
Computers do not operate through energy alone.
They operate through energy constrained by encoded states, rules, boundaries, pathways, timing, memory, and feedback.
Turing’s computational machine demonstrates that determinate output follows from finite configurations and transition instructions rather than from symbols without rules. Shannon’s communication model demonstrates that a signal’s successful reception depends upon encoding, channel conditions, noise, and decoding. Modern voice recognition demonstrates that an acoustic signal becomes text only through a model that selects among possible sequence paths.
The mistaken recognition of provenance as Providence reveals a powerful principle:
> The system did not fail to find a route. It completed the wrong route successfully.
The human correction then reopened the hypothesis space and restored the intended expression.
This sequence embodies:
\[
\text{gradient}
\rightarrow
\text{boundary}
\rightarrow
\text{selection}
\rightarrow
\text{expression}
\rightarrow
\text{feedback}
\rightarrow
\text{correction}.
\]
The computer therefore provides more than a metaphor.
It is an operational demonstration that:
\[
\boxed{
V=E\times Y
}
\]
is necessary within engineered computation.
The energy and input provide possibility.
The encoded equilibrium determines which possibility becomes real within the machine.
This does not prove ultimate unification.
It proves that at least one of humanity’s most exact, repeatable, and consequential classes of systems cannot function without the grammar TSTOEAO describes.
The foundational statement is:
\[
\boxed{
\text{A computer cannot transform possibility into computation without encoded boundaries governing which state may follow which.}
}
\]
References
Graves, A., & Jaitly, N. (2014). Towards End-to-End Speech Recognition with Recurrent Neural Networks. Proceedings of the 31st International Conference on Machine Learning, 1764–1772.
Shannon, C. E. (1948). A Mathematical Theory of Communication. Bell System Technical Journal, 27, 379–423 and 623–656.
Turing, A. M. (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230–265.
Swygert, J. (2026). The Provenance Protocol: Chain of Intellectual Custody from First Note to Final Publication. Ivory Tower Publishing.
Swygert, J. (2026). The Swygert Theory of Everything AO. Ivory Tower Publishing.