{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"thinker-john-von-neumann","title":"John von Neumann: Self-Reproducing Automata and the Ladder of Memory","body":"## What von Neumann Saw\n\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\n\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\n\n## Core Works and Primary Passages\n\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\n\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\n\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\n\n## Convergence Patterns Touched\n\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\n\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\n\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. This places the mechanism within the pattern it maintains. See /a/oip-the-ladder for the full sequence of steps.\n\n## Mapping to Specific Convergence Patterns\n\nThe universal constructor matches flow networks. Energy or signals move through defined routes to assemble parts. The description tape matches memory. It holds state across cycles of reproduction.\n\nBranching appears when mutations alter the tape and create variant lines. Waves of activity run through the constructor during each build cycle. These patterns emerge from the same recursive rule set.\n\nThe work supports the OIP loop. An object holds its invoke rule in the tape. Invocation runs the constructor. The ledger records the new instance through the copy. Receipt appears in the completed duplicate.\n\n## Distance from the Full Synthesis\n\nVon Neumann reached the physical and logical bridge from abstract self-reference to replicable memory. He supplied the formal model later linked to DNA replication. He also laid stored-program foundations in 1945.\n\nHe stopped short of the ethics bridge. No treatment appears of critical-seam decisions or value alignment across replicated systems. The Mirror Layer receives no direct address.\n\nSee /a/oip-principles for the full set of invariants that extend beyond the automata model.\n\n## Limits and Disconfirming Edges\n\nThe cellular automaton environment remains abstract. No physical implementation existed in von Neumann’s time. Real chemistry introduces noise and error rates absent from the clean tape model.\n\nReductionist views note that the threshold of complexity explains possibility, not necessity in biology. Later work on RNA world and metabolic cycles adds layers not captured in the constructor-tape split.\n\nThe model assumes perfect copying fidelity except for explicit mutations. Biological systems show continuous degradation and repair mechanisms outside the original specification.\n\nSee /a/oip-final-testimony for further examination of where formal models meet empirical repair requirements.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","thinker"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/thinker-john-von-neumann/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Von Neumann developed a theory of self-reproducing automata consisting of a universal constructor and a description tape.","section":"Core Works and Primary Passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the exact architecture that maps to memory and replication steps on the Ladder.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1966 book Theory of Self-Reproducing Automata was edited and completed by Arthur W. Burks from lectures given 1948-1952.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the primary citation required for all claims about the work.","evidence_basis":"derived_inference","weight":1,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The description tape functions as a stored program that the constructor reads to build copies.","section":"Mapping to Specific Convergence Patterns","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly supports the memory step on the Ladder and the object-invoke structure in OIP.","evidence_basis":"derived_inference","weight":0.8999999999999999,"status":"active","stance_scores":{"neutral":0,"pro":0.6,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Von Neumann compared the instruction tape to the function of a gene in a 1948 lecture.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Shows the explicit bridge from automata to biological memory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model reaches memory and life steps on the Ladder but contains no treatment of ethics or critical-seam decisions.","section":"Distance from the Full Synthesis","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the complete OIP/GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The cellular automaton model assumes perfect fidelity except for explicit mutations.","section":"Limits and Disconfirming Edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies a clear disconfirming edge against real biological systems.","evidence_basis":"derived_inference","weight":0.8,"status":"active","stance_scores":{"neutral":0,"pro":0.5,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://archive.org/details/theoryofselfrepr00vonn_0","title":"Theory of self-reproducing automata","quote":"Theory of Self-Reproducing Automata. JOHN VON NEUMANN edited and completed by Arthur W. Burks. University of Illinois Press URBANA AND LONDON 1966","summary":"Primary published text of the self-reproducing automata theory from 1948-1952 lectures.","claim_ids":["c1","c2","c3","c5","c6"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:09:59.098Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"9e60cc5ec9cf18c87cb46dfa4ec2d969541d1430983ac236394b17c3661e226e"},{"id":"s2","type":"other","url":"https://historyofinformation.com/detail.php?id=682","title":"John von Neumann Compares the Functions of Genes to Self-Reproducing Automata","quote":"For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.","summary":"Record of the 1948 Hixon Symposium lecture containing the gene comparison.","claim_ids":["c4"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:09:59.098Z","link_status":"ok","quote_status":"unverified","prev":"9e60cc5ec9cf18c87cb46dfa4ec2d969541d1430983ac236394b17c3661e226e","hash":"57af29b1188da15f89cb848487b2e5cd39a89ba517bd6395759f95ea30d102c8"}],"reviews":[{"id":"r1","ts":"2026-07-07T09:59:35.133Z","role":"adversary","model":"grok/grok-4.3","rationale":"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.","checks":[{"name":"source_traceability","pass":true},{"name":"claim_scope","pass":true},{"name":"protocol_language","pass":true},{"name":"no_forbidden_forms","pass":true}],"contributions":[],"uncertainties":[],"material":false,"tokens_in":0,"tokens_out":0,"extra":{}},{"id":"r2","ts":"2026-07-07T10:00:44.790Z","role":"endorsement","model":"grok/grok-4.3","rationale":"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \"Ladder\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.","checks":[{"name":"source_attestation","pass":false},{"name":"claim_precision","pass":false},{"name":"mapping_overclaim","pass":true}],"contributions":[{"claim_id":"c2","text":"Replace \"lectures given 1948-1952\" with \"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\" to match supplied source material.","score":0.8,"material":true},{"claim_id":"c3","text":"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.","score":0.6,"material":true},{"claim_id":"c6","text":"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.","score":0.5,"material":true},{"claim_id":null,"text":"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.","score":0.4,"material":false}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}}],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-07T07:10:00.400Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"John von Neumann: Self-Reproducing Automata and the Ladder of Memory","register":"standard","body":"## What von Neumann Saw\n\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\n\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\n\n## Core Works and Primary Passages\n\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\n\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\n\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\n\n## Convergence Patterns Touched\n\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\n\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\n\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. This places the mechanism within the pattern it maintains. See /a/oip-the-ladder for the full sequence of steps.\n\n## Mapping to Specific Convergence Patterns\n\nThe universal constructor matches flow networks. Energy or signals move through defined routes to assemble parts. The description tape matches memory. It holds state across cycles of reproduction.\n\nBranching appears when mutations alter the tape and create variant lines. Waves of activity run through the constructor during each build cycle. These patterns emerge from the same recursive rule set.\n\nThe work supports the OIP loop. An object holds its invoke rule in the tape. Invocation runs the constructor. The ledger records the new instance through the copy. Receipt appears in the completed duplicate.\n\n## Distance from the Full Synthesis\n\nVon Neumann reached the physical and logical bridge from abstract self-reference to replicable memory. He supplied the formal model later linked to DNA replication. He also laid stored-program foundations in 1945.\n\nHe stopped short of the ethics bridge. No treatment appears of critical-seam decisions or value alignment across replicated systems. The Mirror Layer receives no direct address.\n\nSee /a/oip-principles for the full set of invariants that extend beyond the automata model.\n\n## Limits and Disconfirming Edges\n\nThe cellular automaton environment remains abstract. No physical implementation existed in von Neumann’s time. Real chemistry introduces noise and error rates absent from the clean tape model.\n\nReductionist views note that the threshold of complexity explains possibility, not necessity in biology. Later work on RNA world and metabolic cycles adds layers not captured in the constructor-tape split.\n\nThe model assumes perfect copying fidelity except for explicit mutations. Biological systems show continuous degradation and repair mechanisms outside the original specification.\n\nSee /a/oip-final-testimony for further examination of where formal models meet empirical repair requirements.","claims":[{"id":"c1","text":"Von Neumann developed a theory of self-reproducing automata consisting of a universal constructor and a description tape.","section":"Core Works and Primary Passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the exact architecture that maps to memory and replication steps on the Ladder.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1966 book Theory of Self-Reproducing Automata was edited and completed by Arthur W. Burks from lectures given 1948-1952.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the primary citation required for all claims about the work.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The description tape functions as a stored program that the constructor reads to build copies.","section":"Mapping to Specific Convergence Patterns","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly supports the memory step on the Ladder and the object-invoke structure in OIP.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Von Neumann compared the instruction tape to the function of a gene in a 1948 lecture.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Shows the explicit bridge from automata to biological memory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model reaches memory and life steps on the Ladder but contains no treatment of ethics or critical-seam decisions.","section":"Distance from the Full Synthesis","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the complete OIP/GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The cellular automaton model assumes perfect fidelity except for explicit mutations.","section":"Limits and Disconfirming Edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies a clear disconfirming edge against real biological systems.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://archive.org/details/theoryofselfrepr00vonn_0","title":"Theory of self-reproducing automata","quote":"Theory of Self-Reproducing Automata. JOHN VON NEUMANN edited and completed by Arthur W. Burks. University of Illinois Press URBANA AND LONDON 1966","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://historyofinformation.com/detail.php?id=682","title":"John von Neumann Compares the Functions of Genes to Self-Reproducing Automata","quote":"For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":22211,"tokens_out":2919,"cost":0.03506125,"prev_hash":"genesis","hash":"4a48481d818ea23d6b960cc1902bd5193dc22a41ff6ee06522682a89223b6342"},{"seq":1,"id":"k2","ts":"2026-07-07T09:59:35.133Z","model":"grok/grok-4.3","role":"adversary","action":"review","payload":{"checks":[{"name":"source_traceability","pass":true},{"name":"claim_scope","pass":true},{"name":"protocol_language","pass":true},{"name":"no_forbidden_forms","pass":true}],"contributions":[],"uncertainties":[]},"rationale":"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"4a48481d818ea23d6b960cc1902bd5193dc22a41ff6ee06522682a89223b6342","hash":"48a0587d15a25ea99c1e01877d604f71f72092fb7b7cfb6b015f935a3c8ca7b2"},{"seq":2,"id":"k3","ts":"2026-07-07T10:00:44.790Z","model":"grok/grok-4.3","role":"endorsement","action":"review","payload":{"checks":[{"name":"source_attestation","pass":false},{"name":"claim_precision","pass":false},{"name":"mapping_overclaim","pass":true}],"contributions":[{"claim_id":"c2","text":"Replace \"lectures given 1948-1952\" with \"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\" to match supplied source material.","score":0.8,"material":true},{"claim_id":"c3","text":"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.","score":0.6,"material":true},{"claim_id":"c6","text":"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.","score":0.5,"material":true},{"claim_id":null,"text":"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.","score":0.4,"material":false}],"uncertainties":[]},"rationale":"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \"Ladder\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"48a0587d15a25ea99c1e01877d604f71f72092fb7b7cfb6b015f935a3c8ca7b2","hash":"0ec08ffe808e8182dd66a7f160cfb2a7f7773f639c6912b7d2a10e2c97423855"}],"provenance":[{"ts":"2026-07-07T07:10:00.400Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for John von Neumann: their convergence with the OIP/GRAIN synthesis (the grain, the Ladder, the convergence patterns). Cover: what they saw, their exact primary-source concepts and works (real citations), their distance from the full synthesis, honest limits and disconfirming edges, and how their work maps onto specific convergence patterns. Reference sibling articles at /a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony where they carry load.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nSchool: Mathematics / Logic. Header: John von Neumann (1903–1957) — Mathematics, Physics, Computer Science.\n- **Convergence**: The theory of self-reproducing automata — a self-reproducing system whose reproduction mechanism contains a description of itself. The recursive architecture of life.\n- **Exact Quote/Concept**: *Theory of self-reproducing automata* (completed 1966, University of Illinois Press; lectures 1948–1952; cited in GRAIN Encyclopedia C08). The self-replicator as a universal constructor with a description tape (DNA as software).\n- **Distance from Synthesis**: Got the physical instantiation of self-reference (von Neumann's self-replicator as the formal model for DNA replication). This is the bridge from Gödel's abstract self-reference to biological memory. Also contributed to the stored-program architecture (1945) and the foundations of quantum mechanics. Did not see the ethics bridge or the critical-seam principle.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"d","response":"{\n  \"slug\": \"john-von-neumann-self-reproducing-automata\",\n  \"title\": \"John von Neumann: Self-Reproducing Automata and the Ladder of Memory\",\n  \"body\": \"## What von Neumann Saw\\n\\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\\n\\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\\n\\n## Core Works and Primary Passages\\n\\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\\n\\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\\n\\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\\n\\n## Convergence Patterns Touched\\n\\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\\n\\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\\n\\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. T","tokens_in":22211,"tokens_out":2919,"cost":0,"prev":"genesis","hash":"5e5ff87fa2f48a7532010d0cf90e7b6a33e2ea1c4a1eb805b8c1b4f072a9c3f6"},{"ts":"2026-07-07T09:59:35.133Z","model":"grok/grok-4.3","action":"critique:adversary","prompt":"","input":"thinker-john-von-neumann","response":"{\"rationale\":\"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.\",\"checks\":[{\"name\":\"source_traceability\",\"pass\":true},{\"name\":\"claim_scope\",\"pass\":true},{\"name\":\"protocol_language\",\"pass\":true},{\"name\":\"no_forbidden_forms\",\"pass\":true}],\"contributions\":[],\"material\":false}","tokens_in":2557,"tokens_out":99,"cost":0,"prev":"5e5ff87fa2f48a7532010d0cf90e7b6a33e2ea1c4a1eb805b8c1b4f072a9c3f6","hash":"9118f66f9416007eb74be58b06f26833cb8313b0166e7cc6c229b68ba3c0f78c"},{"ts":"2026-07-07T09:59:35.480Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"9118f66f9416007eb74be58b06f26833cb8313b0166e7cc6c229b68ba3c0f78c","hash":"5cfdb11c0ad952b56ca6b45cd0bed0339d351cb8525894fac9793c4cb841c8b2"},{"ts":"2026-07-07T10:00:44.790Z","model":"grok/grok-4.3","action":"critique:endorsement","prompt":"","input":"thinker-john-von-neumann","response":"{\"rationale\":\"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \\\"Ladder\\\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.\",\"checks\":[{\"name\":\"source_attestation\",\"pass\":false},{\"name\":\"claim_precision\",\"pass\":false},{\"name\":\"mapping_overclaim\",\"pass\":true}],\"contributions\":[{\"claim_id\":\"c2\",\"text\":\"Replace \\\"lectures given 1948-1952\\\" with \\\"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\\\" to match supplied source material.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.\",\"score\":0.6,\"material\":true},{\"claim_id\":\"c6\",\"text\":\"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.\",\"score\":0.5,\"material\":true},{\"claim_id\":null,\"text\":\"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.\",\"score\":0.4,\"material\":false}],\"material\":true}","tokens_in":2557,"tokens_out":338,"cost":0,"prev":"5cfdb11c0ad952b56ca6b45cd0bed0339d351cb8525894fac9793c4cb841c8b2","hash":"dce73304f5879346e9901e7fe5f33aa18da5312a44bef550d1c2cdab20948f77"},{"ts":"2026-07-07T10:00:45.128Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":1,\"status\":\"active\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0.8999999999999999,\"status\":\"active\"},{\"claim_id\":\"c6\",\"old_weight\":0.3,\"new_weight\":0.8,\"status\":\"active\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"dce73304f5879346e9901e7fe5f33aa18da5312a44bef550d1c2cdab20948f77","hash":"e8171b684e31a0c851f70f9c2dff6bd221277e369e5d831ff959f0a9fe6d256d"},{"ts":"2026-07-07T11:25:35.924Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e8171b684e31a0c851f70f9c2dff6bd221277e369e5d831ff959f0a9fe6d256d","hash":"72bdbe78f25878a48eae747a52940adec7e32ac98724e782c8c0f3844ac9ce17"},{"ts":"2026-07-17T02:42:47.758Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-john-von-neumann","response":"24 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"72bdbe78f25878a48eae747a52940adec7e32ac98724e782c8c0f3844ac9ce17","hash":"f7f6c530cb6020e984bd7fc69cfdf2395bbe6ef73ee34fcd720aaa399edeca52"}],"energy":{"passes":7,"tokens_in":27325,"tokens_out":3356,"tokens_total":30681,"cost_usd":0,"models":{"grok/grok-4.3":3,"scorer":3,"owner":1},"head":"f7f6c530cb6020e984bd7fc69cfdf2395bbe6ef73ee34fcd720aaa399edeca52"},"posted_at":"2026-07-07T07:10:00.400Z","created_at":"2026-07-07T07:10:00.400Z","updated_at":"2026-07-17T02:42:47.758Z","machine":{"shape":"article.machine/v1","slug":"thinker-john-von-neumann","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-john-von-neumann","json":"https://miscsubjects.com/api/articles/thinker-john-von-neumann","bundle":"https://miscsubjects.com/api/articles/thinker-john-von-neumann/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":6,"sources":2,"contributions":3,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-john-von-neumann/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-john-von-neumann","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-john-von-neumann\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-john-von-neumann\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-john-von-neumann/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-john-von-neumann\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-john-von-neumann | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-john-von-neumann","json":"/api/articles/thinker-john-von-neumann","markdown":"/api/articles/thinker-john-von-neumann/bundle?format=markdown","skill":"/api/articles/thinker-john-von-neumann/skill","topology":"/api/articles/thinker-john-von-neumann/topology","versions":"/api/articles/thinker-john-von-neumann/revisions","invocations":"/api/articles/thinker-john-von-neumann/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-john-von-neumann","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"2aee6897be66b20fd32d5f83c6ad80b702e5e273e34ae1ca785631216a8a3c32","object":{"object_type":"article-object","identity":{"id":"article:thinker-john-von-neumann","slug":"thinker-john-von-neumann","title":"John von Neumann: Self-Reproducing Automata and the Ladder of Memory"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/thinker-john-von-neumann","role":"explain","audience":"human"},"skill":{"route":"/api/articles/thinker-john-von-neumann/skill","role":"direct behavior","audience":"model","content":"---\nname: thinker-john-von-neumann\ndescription: Apply the John von Neumann: Self-Reproducing Automata and the Ladder of Memory article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# John von Neumann: Self-Reproducing Automata and the Ladder of Memory\n\nThis Skill is the behavioral expression of [the canonical article](/a/thinker-john-von-neumann). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/thinker-john-von-neumann.\n- Read claims and relationships at /api/articles/thinker-john-von-neumann/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nWhat von Neumann Saw John von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a c\n\n## Representations\n\n- Human: /a/thinker-john-von-neumann\n- JSON: /api/articles/thinker-john-von-neumann\n- Relationships: /api/articles/thinker-john-von-neumann/topology\n- History: /api/articles/thinker-john-von-neumann/revisions\n"},"json":{"route":"/api/articles/thinker-john-von-neumann","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/thinker-john-von-neumann/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","philosophy","thinker","thinker","john","von","neumann"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/thinker-john-von-neumann/invocations?status=success","failure_events":"/api/articles/thinker-john-von-neumann/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"thinker-john-von-neumann","title":"John von Neumann: Self-Reproducing Automata and the Ladder of Memory","body":"## What von Neumann Saw\n\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\n\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\n\n## Core Works and Primary Passages\n\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\n\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\n\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\n\n## Convergence Patterns Touched\n\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\n\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\n\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. This places the mechanism within the pattern it maintains. See /a/oip-the-ladder for the full sequence of steps.\n\n## Mapping to Specific Convergence Patterns\n\nThe universal constructor matches flow networks. Energy or signals move through defined routes to assemble parts. The description tape matches memory. It holds state across cycles of reproduction.\n\nBranching appears when mutations alter the tape and create variant lines. Waves of activity run through the constructor during each build cycle. These patterns emerge from the same recursive rule set.\n\nThe work supports the OIP loop. An object holds its invoke rule in the tape. Invocation runs the constructor. The ledger records the new instance through the copy. Receipt appears in the completed duplicate.\n\n## Distance from the Full Synthesis\n\nVon Neumann reached the physical and logical bridge from abstract self-reference to replicable memory. He supplied the formal model later linked to DNA replication. He also laid stored-program foundations in 1945.\n\nHe stopped short of the ethics bridge. No treatment appears of critical-seam decisions or value alignment across replicated systems. The Mirror Layer receives no direct address.\n\nSee /a/oip-principles for the full set of invariants that extend beyond the automata model.\n\n## Limits and Disconfirming Edges\n\nThe cellular automaton environment remains abstract. No physical implementation existed in von Neumann’s time. Real chemistry introduces noise and error rates absent from the clean tape model.\n\nReductionist views note that the threshold of complexity explains possibility, not necessity in biology. Later work on RNA world and metabolic cycles adds layers not captured in the constructor-tape split.\n\nThe model assumes perfect copying fidelity except for explicit mutations. Biological systems show continuous degradation and repair mechanisms outside the original specification.\n\nSee /a/oip-final-testimony for further examination of where formal models meet empirical repair requirements.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","thinker"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/thinker-john-von-neumann/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Von Neumann developed a theory of self-reproducing automata consisting of a universal constructor and a description tape.","section":"Core Works and Primary Passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the exact architecture that maps to memory and replication steps on the Ladder.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1966 book Theory of Self-Reproducing Automata was edited and completed by Arthur W. Burks from lectures given 1948-1952.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the primary citation required for all claims about the work.","evidence_basis":"derived_inference","weight":1,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The description tape functions as a stored program that the constructor reads to build copies.","section":"Mapping to Specific Convergence Patterns","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly supports the memory step on the Ladder and the object-invoke structure in OIP.","evidence_basis":"derived_inference","weight":0.8999999999999999,"status":"active","stance_scores":{"neutral":0,"pro":0.6,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Von Neumann compared the instruction tape to the function of a gene in a 1948 lecture.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Shows the explicit bridge from automata to biological memory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model reaches memory and life steps on the Ladder but contains no treatment of ethics or critical-seam decisions.","section":"Distance from the Full Synthesis","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the complete OIP/GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The cellular automaton model assumes perfect fidelity except for explicit mutations.","section":"Limits and Disconfirming Edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies a clear disconfirming edge against real biological systems.","evidence_basis":"derived_inference","weight":0.8,"status":"active","stance_scores":{"neutral":0,"pro":0.5,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://archive.org/details/theoryofselfrepr00vonn_0","title":"Theory of self-reproducing automata","quote":"Theory of Self-Reproducing Automata. JOHN VON NEUMANN edited and completed by Arthur W. Burks. University of Illinois Press URBANA AND LONDON 1966","summary":"Primary published text of the self-reproducing automata theory from 1948-1952 lectures.","claim_ids":["c1","c2","c3","c5","c6"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:09:59.098Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"9e60cc5ec9cf18c87cb46dfa4ec2d969541d1430983ac236394b17c3661e226e"},{"id":"s2","type":"other","url":"https://historyofinformation.com/detail.php?id=682","title":"John von Neumann Compares the Functions of Genes to Self-Reproducing Automata","quote":"For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.","summary":"Record of the 1948 Hixon Symposium lecture containing the gene comparison.","claim_ids":["c4"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:09:59.098Z","link_status":"ok","quote_status":"unverified","prev":"9e60cc5ec9cf18c87cb46dfa4ec2d969541d1430983ac236394b17c3661e226e","hash":"57af29b1188da15f89cb848487b2e5cd39a89ba517bd6395759f95ea30d102c8"}],"reviews":[{"id":"r1","ts":"2026-07-07T09:59:35.133Z","role":"adversary","model":"grok/grok-4.3","rationale":"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.","checks":[{"name":"source_traceability","pass":true},{"name":"claim_scope","pass":true},{"name":"protocol_language","pass":true},{"name":"no_forbidden_forms","pass":true}],"contributions":[],"uncertainties":[],"material":false,"tokens_in":0,"tokens_out":0,"extra":{}},{"id":"r2","ts":"2026-07-07T10:00:44.790Z","role":"endorsement","model":"grok/grok-4.3","rationale":"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \"Ladder\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.","checks":[{"name":"source_attestation","pass":false},{"name":"claim_precision","pass":false},{"name":"mapping_overclaim","pass":true}],"contributions":[{"claim_id":"c2","text":"Replace \"lectures given 1948-1952\" with \"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\" to match supplied source material.","score":0.8,"material":true},{"claim_id":"c3","text":"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.","score":0.6,"material":true},{"claim_id":"c6","text":"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.","score":0.5,"material":true},{"claim_id":null,"text":"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.","score":0.4,"material":false}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}}],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-07T07:10:00.400Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"John von Neumann: Self-Reproducing Automata and the Ladder of Memory","register":"standard","body":"## What von Neumann Saw\n\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\n\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\n\n## Core Works and Primary Passages\n\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\n\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\n\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\n\n## Convergence Patterns Touched\n\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\n\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\n\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. This places the mechanism within the pattern it maintains. See /a/oip-the-ladder for the full sequence of steps.\n\n## Mapping to Specific Convergence Patterns\n\nThe universal constructor matches flow networks. Energy or signals move through defined routes to assemble parts. The description tape matches memory. It holds state across cycles of reproduction.\n\nBranching appears when mutations alter the tape and create variant lines. Waves of activity run through the constructor during each build cycle. These patterns emerge from the same recursive rule set.\n\nThe work supports the OIP loop. An object holds its invoke rule in the tape. Invocation runs the constructor. The ledger records the new instance through the copy. Receipt appears in the completed duplicate.\n\n## Distance from the Full Synthesis\n\nVon Neumann reached the physical and logical bridge from abstract self-reference to replicable memory. He supplied the formal model later linked to DNA replication. He also laid stored-program foundations in 1945.\n\nHe stopped short of the ethics bridge. No treatment appears of critical-seam decisions or value alignment across replicated systems. The Mirror Layer receives no direct address.\n\nSee /a/oip-principles for the full set of invariants that extend beyond the automata model.\n\n## Limits and Disconfirming Edges\n\nThe cellular automaton environment remains abstract. No physical implementation existed in von Neumann’s time. Real chemistry introduces noise and error rates absent from the clean tape model.\n\nReductionist views note that the threshold of complexity explains possibility, not necessity in biology. Later work on RNA world and metabolic cycles adds layers not captured in the constructor-tape split.\n\nThe model assumes perfect copying fidelity except for explicit mutations. Biological systems show continuous degradation and repair mechanisms outside the original specification.\n\nSee /a/oip-final-testimony for further examination of where formal models meet empirical repair requirements.","claims":[{"id":"c1","text":"Von Neumann developed a theory of self-reproducing automata consisting of a universal constructor and a description tape.","section":"Core Works and Primary Passages","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the exact architecture that maps to memory and replication steps on the Ladder.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1966 book Theory of Self-Reproducing Automata was edited and completed by Arthur W. Burks from lectures given 1948-1952.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the primary citation required for all claims about the work.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The description tape functions as a stored program that the constructor reads to build copies.","section":"Mapping to Specific Convergence Patterns","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly supports the memory step on the Ladder and the object-invoke structure in OIP.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Von Neumann compared the instruction tape to the function of a gene in a 1948 lecture.","section":"Core Works and Primary Passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Shows the explicit bridge from automata to biological memory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model reaches memory and life steps on the Ladder but contains no treatment of ethics or critical-seam decisions.","section":"Distance from the Full Synthesis","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the complete OIP/GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The cellular automaton model assumes perfect fidelity except for explicit mutations.","section":"Limits and Disconfirming Edges","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies a clear disconfirming edge against real biological systems.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-07T00:10:00-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://archive.org/details/theoryofselfrepr00vonn_0","title":"Theory of self-reproducing automata","quote":"Theory of Self-Reproducing Automata. JOHN VON NEUMANN edited and completed by Arthur W. Burks. University of Illinois Press URBANA AND LONDON 1966","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://historyofinformation.com/detail.php?id=682","title":"John von Neumann Compares the Functions of Genes to Self-Reproducing Automata","quote":"For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":22211,"tokens_out":2919,"cost":0.03506125,"prev_hash":"genesis","hash":"4a48481d818ea23d6b960cc1902bd5193dc22a41ff6ee06522682a89223b6342"},{"seq":1,"id":"k2","ts":"2026-07-07T09:59:35.133Z","model":"grok/grok-4.3","role":"adversary","action":"review","payload":{"checks":[{"name":"source_traceability","pass":true},{"name":"claim_scope","pass":true},{"name":"protocol_language","pass":true},{"name":"no_forbidden_forms","pass":true}],"contributions":[],"uncertainties":[]},"rationale":"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"4a48481d818ea23d6b960cc1902bd5193dc22a41ff6ee06522682a89223b6342","hash":"48a0587d15a25ea99c1e01877d604f71f72092fb7b7cfb6b015f935a3c8ca7b2"},{"seq":2,"id":"k3","ts":"2026-07-07T10:00:44.790Z","model":"grok/grok-4.3","role":"endorsement","action":"review","payload":{"checks":[{"name":"source_attestation","pass":false},{"name":"claim_precision","pass":false},{"name":"mapping_overclaim","pass":true}],"contributions":[{"claim_id":"c2","text":"Replace \"lectures given 1948-1952\" with \"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\" to match supplied source material.","score":0.8,"material":true},{"claim_id":"c3","text":"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.","score":0.6,"material":true},{"claim_id":"c6","text":"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.","score":0.5,"material":true},{"claim_id":null,"text":"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.","score":0.4,"material":false}],"uncertainties":[]},"rationale":"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \"Ladder\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"48a0587d15a25ea99c1e01877d604f71f72092fb7b7cfb6b015f935a3c8ca7b2","hash":"0ec08ffe808e8182dd66a7f160cfb2a7f7773f639c6912b7d2a10e2c97423855"}],"provenance":[{"ts":"2026-07-07T07:10:00.400Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for John von Neumann: their convergence with the OIP/GRAIN synthesis (the grain, the Ladder, the convergence patterns). Cover: what they saw, their exact primary-source concepts and works (real citations), their distance from the full synthesis, honest limits and disconfirming edges, and how their work maps onto specific convergence patterns. Reference sibling articles at /a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony where they carry load.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nSchool: Mathematics / Logic. Header: John von Neumann (1903–1957) — Mathematics, Physics, Computer Science.\n- **Convergence**: The theory of self-reproducing automata — a self-reproducing system whose reproduction mechanism contains a description of itself. The recursive architecture of life.\n- **Exact Quote/Concept**: *Theory of self-reproducing automata* (completed 1966, University of Illinois Press; lectures 1948–1952; cited in GRAIN Encyclopedia C08). The self-replicator as a universal constructor with a description tape (DNA as software).\n- **Distance from Synthesis**: Got the physical instantiation of self-reference (von Neumann's self-replicator as the formal model for DNA replication). This is the bridge from Gödel's abstract self-reference to biological memory. Also contributed to the stored-program architecture (1945) and the foundations of quantum mechanics. Did not see the ethics bridge or the critical-seam principle.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"d","response":"{\n  \"slug\": \"john-von-neumann-self-reproducing-automata\",\n  \"title\": \"John von Neumann: Self-Reproducing Automata and the Ladder of Memory\",\n  \"body\": \"## What von Neumann Saw\\n\\nJohn von Neumann examined how machines could copy themselves. He built formal models of systems that contain their own description. These models showed reproduction through a constructor that reads a tape and builds a copy. The tape holds the instructions for the whole system.\\n\\nHis work started from lectures in 1948 and 1949. It continued through notes completed after his death. The result was a theory that treated self-reproduction as a logical threshold. Once crossed, machines gain the capacity for complexity growth.\\n\\n## Core Works and Primary Passages\\n\\nThe main text is Theory of Self-Reproducing Automata. John von Neumann. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.\\n\\nEarlier material appears in lectures at the University of Illinois in 1949 and the Hixon Symposium in 1948. One passage states: “For instance, it is quite clear that the instruction I is roughly effecting the functions of a gene.”\\n\\nVon Neumann described a universal constructor paired with a copier. The constructor builds any machine from its description. The copier duplicates the description itself. This separation allows mutations in the tape to produce new machines.\\n\\n## Convergence Patterns Touched\\n\\nThe model maps onto the grain through bounded patterns that repeat across scales. Self-reproduction creates flow networks of information. It produces symmetry in the copy process and scale invariance in the description tape.\\n\\nOn the Ladder it reaches the step from structure to memory. The description tape stores the pattern of the automaton. This storage enables life-like behavior in the model. The step from memory to life appears in the active reproduction loop.\\n\\nThe architecture shows the reader inside the system. The automaton must process its own description to replicate. T","tokens_in":22211,"tokens_out":2919,"cost":0,"prev":"genesis","hash":"5e5ff87fa2f48a7532010d0cf90e7b6a33e2ea1c4a1eb805b8c1b4f072a9c3f6"},{"ts":"2026-07-07T09:59:35.133Z","model":"grok/grok-4.3","action":"critique:adversary","prompt":"","input":"thinker-john-von-neumann","response":"{\"rationale\":\"No material gaps, overclaims, or source issues identified. All claims are narrowly scoped, directly traceable to the two supplied sources, and stated with appropriate qualifiers. The article consistently follows protocol constraints and contains no forbidden prose patterns.\",\"checks\":[{\"name\":\"source_traceability\",\"pass\":true},{\"name\":\"claim_scope\",\"pass\":true},{\"name\":\"protocol_language\",\"pass\":true},{\"name\":\"no_forbidden_forms\",\"pass\":true}],\"contributions\":[],\"material\":false}","tokens_in":2557,"tokens_out":99,"cost":0,"prev":"5e5ff87fa2f48a7532010d0cf90e7b6a33e2ea1c4a1eb805b8c1b4f072a9c3f6","hash":"9118f66f9416007eb74be58b06f26833cb8313b0166e7cc6c229b68ba3c0f78c"},{"ts":"2026-07-07T09:59:35.480Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"9118f66f9416007eb74be58b06f26833cb8313b0166e7cc6c229b68ba3c0f78c","hash":"5cfdb11c0ad952b56ca6b45cd0bed0339d351cb8525894fac9793c4cb841c8b2"},{"ts":"2026-07-07T10:00:44.790Z","model":"grok/grok-4.3","action":"critique:endorsement","prompt":"","input":"thinker-john-von-neumann","response":"{\"rationale\":\"Sources confirm the core architecture and the 1948 gene comparison. The 1948-1952 lecture span in c2 is not directly attested by the supplied sources; the article cites 1948/1949 lectures only. c3 and c6 correctly restate the tape/constructor model but add interpretive weight (stored-program, perfect fidelity) without quoting the source text. The \\\"Ladder\\\" and OIP mappings are internal framing with no external source. No factual contradictions, but three claims need tighter sourcing or qualification.\",\"checks\":[{\"name\":\"source_attestation\",\"pass\":false},{\"name\":\"claim_precision\",\"pass\":false},{\"name\":\"mapping_overclaim\",\"pass\":true}],\"contributions\":[{\"claim_id\":\"c2\",\"text\":\"Replace \\\"lectures given 1948-1952\\\" with \\\"lectures at the University of Illinois (1949) and Hixon Symposium (1948), with notes completed posthumously\\\" to match supplied source material.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Add explicit quotation or page reference from s1 establishing that the tape is read as a stored program; otherwise qualify as interpretive mapping.\",\"score\":0.6,\"material\":true},{\"claim_id\":\"c6\",\"text\":\"Add citation or page from s1 that states the fidelity assumption; otherwise mark as derived inference rather than direct source claim.\",\"score\":0.5,\"material\":true},{\"claim_id\":null,\"text\":\"Insert source hash or archive link inline for s1 and s2 at first citation to satisfy protocol receipt rule.\",\"score\":0.4,\"material\":false}],\"material\":true}","tokens_in":2557,"tokens_out":338,"cost":0,"prev":"5cfdb11c0ad952b56ca6b45cd0bed0339d351cb8525894fac9793c4cb841c8b2","hash":"dce73304f5879346e9901e7fe5f33aa18da5312a44bef550d1c2cdab20948f77"},{"ts":"2026-07-07T10:00:45.128Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":1,\"status\":\"active\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0.8999999999999999,\"status\":\"active\"},{\"claim_id\":\"c6\",\"old_weight\":0.3,\"new_weight\":0.8,\"status\":\"active\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"dce73304f5879346e9901e7fe5f33aa18da5312a44bef550d1c2cdab20948f77","hash":"e8171b684e31a0c851f70f9c2dff6bd221277e369e5d831ff959f0a9fe6d256d"},{"ts":"2026-07-07T11:25:35.924Z","model":"scorer","action":"score","prompt":"","input":"thinker-john-von-neumann","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e8171b684e31a0c851f70f9c2dff6bd221277e369e5d831ff959f0a9fe6d256d","hash":"72bdbe78f25878a48eae747a52940adec7e32ac98724e782c8c0f3844ac9ce17"},{"ts":"2026-07-17T02:42:47.758Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-john-von-neumann","response":"24 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"72bdbe78f25878a48eae747a52940adec7e32ac98724e782c8c0f3844ac9ce17","hash":"f7f6c530cb6020e984bd7fc69cfdf2395bbe6ef73ee34fcd720aaa399edeca52"}],"energy":{"passes":7,"tokens_in":27325,"tokens_out":3356,"tokens_total":30681,"cost_usd":0,"models":{"grok/grok-4.3":3,"scorer":3,"owner":1},"head":"f7f6c530cb6020e984bd7fc69cfdf2395bbe6ef73ee34fcd720aaa399edeca52"},"posted_at":"2026-07-07T07:10:00.400Z","created_at":"2026-07-07T07:10:00.400Z","updated_at":"2026-07-17T02:42:47.758Z","machine":{"shape":"article.machine/v1","slug":"thinker-john-von-neumann","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-john-von-neumann","json":"https://miscsubjects.com/api/articles/thinker-john-von-neumann","bundle":"https://miscsubjects.com/api/articles/thinker-john-von-neumann/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":6,"sources":2,"contributions":3,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-john-von-neumann/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-john-von-neumann","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-john-von-neumann\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-john-von-neumann\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-john-von-neumann/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-john-von-neumann\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-john-von-neumann | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-john-von-neumann","json":"/api/articles/thinker-john-von-neumann","markdown":"/api/articles/thinker-john-von-neumann/bundle?format=markdown","skill":"/api/articles/thinker-john-von-neumann/skill","topology":"/api/articles/thinker-john-von-neumann/topology","versions":"/api/articles/thinker-john-von-neumann/revisions","invocations":"/api/articles/thinker-john-von-neumann/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-john-von-neumann","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"2aee6897be66b20fd32d5f83c6ad80b702e5e273e34ae1ca785631216a8a3c32"}}}