mirror of
https://github.com/blackboxprogramming/simulation-theory.git
synced 2026-03-17 04:57:12 -05:00
Merge remote-tracking branch 'origin/copilot/fix-login-page-issues' into claude/translate-issue-comments-PlJqV
This commit is contained in:
@@ -2,10 +2,11 @@
|
||||
|
||||
Formal mathematical arguments for the key claims.
|
||||
|
||||
> 📖 All proofs use standard mathematical methods. For background on the underlying research, see [REFERENCES.md](../REFERENCES.md).
|
||||
|
||||
| File | Claim | Method |
|
||||
|------|-------|--------|
|
||||
| [`ternary-efficiency.md`](./ternary-efficiency.md) | Ternary is more computationally efficient than binary | Calculus / radix economy |
|
||||
| [`ternary-efficiency.md`](./ternary-efficiency.md) | Ternary is more computationally efficient than binary | Calculus / radix economy ([Knuth, 1980](https://en.wikipedia.org/wiki/Radix_economy)) |
|
||||
| [`self-reference.md`](./self-reference.md) | The QWERTY encoding is self-referential | Direct construction |
|
||||
| [`pure-state.md`](./pure-state.md) | The density matrix of the system is a pure state | Linear algebra / SVD |
|
||||
| [`universal-computation.md`](./universal-computation.md) | The ternary bio-quantum system is Turing-complete | Reaction network theory |
|
||||
| [`peano-derivative.md`](./peano-derivative.md) | The derivative does not break Peano; Gödel proved a boundary, not a collapse | Meta-level analysis / QWERTY |
|
||||
| [`pure-state.md`](./pure-state.md) | The density matrix of the system is a pure state | Linear algebra / SVD ([von Neumann, 1932](https://en.wikipedia.org/wiki/Density_matrix)) |
|
||||
| [`universal-computation.md`](./universal-computation.md) | The ternary bio-quantum system is Turing-complete | Reaction network theory ([Turing, 1936](https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf)) |
|
||||
|
||||
Reference in New Issue
Block a user