blackroad-os/simulation-theory
9
0
Fork 0
mirror of https://github.com/blackboxprogramming/simulation-theory.git synced 2026-03-17 05:57:19 -05:00
Code Issues Packages Projects Releases Wiki Activity

Merge remote-tracking branch 'origin/copilot/add-claims-summary' into claude/translate-issue-comments-PlJqV

Browse Source
This commit is contained in:
Claude
2026-03-01 05:26:40 +00:00
parent 30fc0e9099 0d63bede8c
commit c1e3a137ee
3 changed files with 315 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
proofs/README.md
View File

@@ -8,4 +8,9 @@ Formal mathematical arguments for the key claims.
| [`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 |
| [`chi-squared.md`](./chi-squared.md) | Chi-squared goodness-of-fit and independence tests | χ² statistic / contingency tables |
## From the Eight Claims
**Claim 6** (Ramanujan congruences show incompleteness inside arithmetic) is a known result in number theory, not a new proof. The congruences p(5k+4)≡0 (mod 5), p(7k+5)≡0 (mod 7), p(11k+6)≡0 (mod 11) were proved by Ramanujan and later by Watson and Atkin using modular forms. The failure at 13 — p(13k+7)≢0 (mod 13) — is also established. The claim is that this structure models Gödelian incompleteness from within arithmetic: the system of partition congruences describes its own boundary.
See [`CLAIMS.md`](../CLAIMS.md) for all eight claims.