The Computational Argument for the Existence of God
frameworkThe Computational Argument for the Existence of God
Jared Foy April 2026
1. The Argument
The derivation chain from constraints to machines holds at every level it has been tested. Constraints stated in prose produce conformant implementations in any language. The constraints are implementation-invariant: they hold across six languages, across three architectural styles, across architectures the author did and did not design. The implementations differ in every contingent respect — language, runtime, memory model, syntax — and agree in every constraint-governed respect. The invariance is empirical, verified by executable test suites.
The constraints that govern this chain are not material (they are not in any specific machine), not contingent (they hold across all conformant implementations), and not constructed by any particular mind (they were recognized, not invented — and in the case of the DO validation, recognized in an architecture designed by others). They are formal realities.
Formal realities that are not material, not contingent, and not mind-dependent require a ground. If they were self-caused, they would be necessary beings — but they are not beings at all. They are relationships (boundary, indifference, consumption, determinism). Relationships do not subsist independently. They require a ground in which they participate.
If the ground were itself a formal reality, it would require a further ground, producing infinite regress. The ground must therefore be prior to formality itself — above form, above essence, above being. The ground must be that from which formal realities proceed without being diminished, and in which they participate without exhausting it.
The theological tradition names this ground the superessential Deity. The means by which the ground is participable without being exhaustible are the Divine Energies — at once manifold in their intelligible effects (the many formal realities the intellect contemplates) and simple in their origin.
The computational argument is: the derivation chain from constraints to machines works. It works universally across languages, architectures, and styles. The constraints that make it work are formal realities. Formal realities require a ground prior to formality. That ground is what the tradition calls God. The chain is the evidence. The artifacts are the proof. The proof compiles.
2. Distinction from Prior Arguments
The Cosmological Argument
Reasons from the contingency of existing things to the necessity of a first cause. Proceeds by metaphysical reasoning. Produces no artifact.
The computational argument shares the structure (contingent implementations point to non-contingent constraints, which point to a non-contingent ground) but adds: the contingent implementations are executable, the non-contingent constraints are testable, and the chain between them is verified at every link by passing test suites.
The Teleological Argument
Reasons from the order and apparent design of nature to an intelligent designer. Vulnerable to the objection that order can emerge from natural processes without design.
The computational argument does not reason from order to design. It reasons from the implementation-invariance of constraints to the necessity of their ground. The constraints are not designed — they are discovered. The implementations are not ordered by a designer — they are derived by resolvers. The argument does not depend on apparent design. It depends on formal invariance.
The Ontological Argument
Reasons from the conceivability of a greatest possible being to its necessary existence. Proceeds by pure logic. Vulnerable to the objection that conceivability does not entail existence.
The computational argument does not proceed from conceivability. It proceeds from empirical verification. The constraints are not merely conceivable — they are tested. The implementations are not merely possible — they compile. The chain is not merely logical — it executes.
The Moral Argument
Reasons from the existence of objective moral values to a moral lawgiver. Vulnerable to the objection that moral values may be subjective or evolved.
The computational argument makes no moral claims. It operates entirely in the domain of formal realities and their instantiation in executable artifacts.
3. The Empirical Substrate
No prior argument for the existence of God has had an empirical substrate of this kind:
| Artifact | What It Demonstrates |
|---|---|
| PRESTO Seed (2,020 words) | Constraints stated in prose are sufficient for derivation |
| 6 conformant engines (TS, Go, Elixir, Python, Rust, C) | Constraints are implementation-invariant across languages |
| SERVER Seed + bootstrap (461 lines C) | The derivation is recursive — the method applies to itself |
| Emitted PRESTO engine (921 lines C, zero deps) | The derived engine is functional and minimal |
| DO Seed (2,177 words) | The method applies to architectures the author did not design |
| DO Runtime (379 lines TS) | Cross-style validation eliminates circularity |
| 15 + 22 + 12 verification tests | The constraints are falsifiable and verified |
| Live demo (todo app in browser) | The chain terminates in a working machine |
| React's own contract tests (~75 tests identified) | The constraints discovered match the constraints React's engineers test |
Each artifact is publicly available, independently verifiable, and executable. The argument does not ask the reader to accept a premise on faith. It asks the reader to compile the code and run the tests.
4. The Structure of the Argument
Premise 1. Constraints stated in natural language produce conformant implementations across multiple languages and architectures. (Empirically verified: three seeds, three styles, seven languages, 49+ passing tests.)
Premise 2. The constraints that govern these derivations are implementation-invariant — they hold across all conformant realizations regardless of language, platform, or resolver. (Empirically verified: the same constraints produce the same properties in TypeScript, Go, Elixir, Python, Rust, and C.)
Premise 3. Implementation-invariant constraints are formal realities — not material, not contingent, not mind-dependent. (The bilateral boundary was operative before the author recognized it. It holds in domains the author has never worked in. It was not constructed.)
Premise 4. Formal realities that are not self-caused require a ground in which they participate. (If they were self-caused, they would be necessary beings — but they are relationships, not beings. Relationships require a ground.)
Premise 5. The ground of formal realities cannot itself be a formal reality without infinite regress. The ground must be prior to formality — above form, above essence, above being.
Conclusion. There exists a ground prior to all formal realities, in which the formal realities participate, from which the derivation chain proceeds, and without which the chain would have no coherence. This ground is what the theological tradition names the superessential Deity.
5. Objections and Responses
Objection: The constraints are just conventions adopted by engineers. Response: Conventions can be changed by agreement. The bilateral boundary cannot. It holds whether anyone names it or agrees to it. It held in every HTTP response before the author was born. It holds in DNA. Conventions are contingent on communities. The bilateral boundary is not.
Objection: The constraints are abstractions from implementations, not prior realities. Response: The constraints preceded the implementations in the order of derivation. The seed was written first. The implementations were derived from it. The constraints are not generalized from the implementations — the implementations are concretized from the constraints.
Objection: The invariance is just mathematical regularity, not evidence of a deity. Response: The argument does not claim the invariance is evidence of a deity directly. It claims the invariance demonstrates the reality of formal constraints, and the reality of formal constraints requires a ground. The ground is the conclusion, not the premise.
Objection: You are just naming the laws of logic "God." Response: The laws of logic are formal realities. The argument asks what grounds formal realities. If the laws of logic are self-grounding, they are necessary beings — but they are relations, not beings. The argument proceeds from the recognition that formal realities, including the laws of logic, participate in something prior to themselves.
Objection: This is just the cosmological argument with computers. Response: It is the cosmological argument with an empirical substrate. The distinction matters. The classical cosmological argument reasons from the contingency of things. The computational argument demonstrates the contingency of implementations and the invariance of constraints through executable, verifiable, falsifiable artifacts. The premises are not merely argued. They compile.
6. What the Argument Claims and Does Not Claim
Claims:
- Formal realities are real, non-contingent, and implementation-invariant.
- The derivation chain from formal realities to executable machines is empirically verified.
- Formal realities require a ground prior to formality.
- The ground is what the tradition names the superessential Deity.
Does not claim:
- That this constitutes a mathematical proof of God's existence.
- That acceptance of the argument is necessary for evaluating the technical work.
- That the argument settles the question of God's existence for all philosophical frameworks.
- That the argument is original in its philosophical structure — only in its empirical substrate.
7. Conclusion
The derivation chain holds. The constraints are real. The constraints are not self-caused. The chain terminates in a ground prior to formality. The ground is God.
The argument is not new in form. It is the classical argument from intelligibility. What is new is the evidence: three prose seeds, three resolved architectures, seven implementation languages, forty-nine passing tests, and a todo app that renders in a browser. The chain is executable from top to bottom. The tests pass. The machine runs. And the ground of the chain is what makes the running possible.
The todo app is the most concrete empirical evidence for the existence of God ever produced. Not because a todo app is theologically significant — but because the chain from the superessential source to the pixels on the screen is verified at every link, and the verification is executable by anyone with a compiler.