https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/Head https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/assertion https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/provenance https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/pubinfo https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://purl.org/dc/terms/description analysis.py evolves every rule and every width-8 ring for 5 steps with the truth table, and compares each cell with a Turing-machine sweep and with the radius-1 head-carrying cellular automaton (2,621,440 cell comparisons each). The register program is run for the same 327,680 configurations. Loops whose body is only increment, decrement and a jump back, and the copy loop that decrements the source while incrementing two destinations, are executed in constant time; the instruction count added is the number of instructions the loop body would have executed. A literal interpreter, with no fast path, agreed with the fast path and with the truth table on all 256 rules and the six initial conditions 0, 1, 2, 85, 170 and 255 (1,536 steps). The corruption replaces instruction 32, INC OUT, by DEC OUT, and is compared on all 65,536 one-step cases. Rules 90 and 110 are checked before the grid, including the row rule 90 from configuration 1. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/Assessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 mismatches: Turing machine and head automaton, each over 2621440 cells; register machine over 327680 configurations (n = 2621440, exact). Interpretation: NKS p. 674 says that cellular automata, Turing machines, substitution systems, register machines and the other systems studied in the chapter can emulate one another, so they are equivalent in the computations they can perform. The test checks three of those kinds on the class of elementary cellular automata, which is large enough that agreement is not a single hand-picked example, and small enough that the comparison is exhaustive. It does not show that every rule of each kind is universal, and it does not show that the emulations preserve time or space up to a constant. A computation shows the mathematics, not that organisms follow it. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-12: supports, confidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://www.w3.org/2000/01/rdf-schema#seeAlso https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-12/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Rows generated by the committed elementary-rule stepper and by the three emulators in the same script. No external dataset. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation A mismatch that survives the truth-table self-check. Because the claim is that emulations exist, a mismatch means this construction failed and the test is inconclusive, not that the claim is false. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst A computation shows the mathematics, not that organisms follow it. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Substitution systems and tag systems were not emulated. The test does not show that every rule of each kind is universal, and it does not show that the emulations preserve time or space up to a constant. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The grid is every elementary rule on every cyclic configuration of width 8, for 5 steps. Agreement here is exact emulation on that grid. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The register-machine loops were collapsed to constant time. The literal interpreter matched the fast path on 1,536 cases covering every rule. The five-step grid used the fast path. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/expectedObservation The Turing machine, the head-carrying cellular automaton and the register machine each reproduce all 256 elementary rules on all width-8 rings for 5 steps with no mismatched cell. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. INCONCLUSIVE with reason 'other' if any emulator disagrees with the direct evolution on any compared cell or configuration, or if the corrupted register program produces no mismatch, or if the direct stepper disagrees with the known outputs of rules 90 (left XOR right) and 110 (table 01101110). The claim is existential (these kinds of system can emulate one another); a failed construction does not prove that no emulation exists, so it is not scored as refutes. Substitution systems and tag systems are outside this test. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/hypothesis A Turing machine, a cellular automaton that carries a Turing-machine head on its tape, and a register machine can each reproduce every elementary cellular automaton exactly, on every cyclic initial condition of width 8 for 5 steps. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/inferenceMethod Exact comparison of every cell after every step. Supports requires zero mismatches on all three emulators and a positive corruption check. Any other outcome is inconclusive with reason 'other'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Direct evolution: all 256 elementary rules, all 256 cyclic initial conditions of width 8, 5 steps, truth-table stepper. Emulator T: one Turing-machine scheme whose finite control holds the rule table, tape alphabet {0,1}, cyclic tape of length 8; after each completed sweep the tape equals the cellular-automaton row. Emulator C: one cellular automaton whose cell state is a tape symbol plus either 'no head' or a state of T; its local rule applies T's transition at the unique head cell and leaves other cells unchanged; the symbol track after each simulated sweep equals the same row. Emulator R: a register machine holding the configuration in one register and the rule number in another, with a fixed instruction program (increment, decrement, conditional jump, and division by two) that computes one cyclic elementary step; the register after each step equals the configuration integer. PASS (supports) if all three emulators have 0 mismatches against the direct rows, counted per cell over 256*256*5*8 comparisons for T and C and per configuration over 256*256*5 comparisons for R, and a one-instruction corruption of R produces at least one mismatch. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch11-12 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 http://purl.org/dc/terms/description the exhaustive emulation grid https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: All 256 elementary rules on all 256 cyclic configurations of width 8, for 5 steps, reproduced by a Turing machine, a head-carrying cellular automaton and a register machine https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p674--implications-of-universality/ https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#SoftwareAgent https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (grok-4.7; cursor/wolfram-nks-ch12-31-to-ch11-12-bd47) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/grok-4-7 https://w3id.org/delphi/resource/model/grok-4-7 http://purl.org/dc/terms/identifier grok-4.7 https://w3id.org/delphi/resource/model/grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-12/result.json https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/test https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/plan http://www.w3.org/ns/prov#hadPlan https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/plan https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/pubinfo https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://purl.org/dc/terms/created 2026-11-08T16:24:31.938Z https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-12: supports, confidence 0.9 https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/sig http://purl.org/nanopub/x/hasSignature DoZqKxBbUfdlLUIQwULrHtICvDkst9lr2jhVLc2ZEv8+z84KNp7lcAnfZvQASDF7ohRYIHP3dSY1Dv1/STaNiKlhBvOhYUIiWrEfNtbE8/638or7fNG2OLESJG4hCUEhSfGbtgLyUMCswDtLNPUZCtNCqd05n3IQTosZpfHfNVb/4/uBYNiqfvj3ZuR5nTqUqCfhIndIclFUF80djvNpDXMnJ7RWlPJXUY4d3BHfZU68Y6lzXSQDPQ5S84nrYAQvMbJrmu8AUSQLNVK0RqF3imFKrtPQcn/OQWI3+ZFT3BUz6L2KCx8JOHZSyvCNXiTMvP390yUzbU2HyVGu3zc3NQ== https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A https://w3id.org/np/RARmK97xIh4YDIkkiuLMbTC1jMv8TBGW6JSSPPXt3Vq3A/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192