https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/Head https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/assertion https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/provenance https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/pubinfo https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 http://purl.org/dc/terms/description analysis.py evolves every elementary rule on every periodic row of width 5 for 3 steps, and evolves the same rows with a sequential substitution system and a Turing machine that carry the original first bit in their finite control, and with one register-machine program of INC, DEC and JZ instructions that extracts periodic bits and writes the rule bit. In the other direction a six-color radius-1 cellular automaton is compared with the flip-zeros Turing machine on every tape of length 6, every head position and 6 steps. Criteria were frozen in commit 093ca8002a77b774b469b965ff599d123fdaefbb before this run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 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--pr-130 http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 cell or step disagreements between emulators (n = 122880, exact). Interpretation: The claim (NKS p. 674) says cellular automata, Turing machines, substitution systems, register machines and other simple programs can emulate one another, so structurally different systems perform the same computations and computation can be discussed without naming a substrate. The test builds one emulator of each named kind and checks exact agreement on a finite but complete box: every elementary rule, every width-5 periodic seed, three steps, and, in the other direction, one cellular automaton against every short run of one Turing machine. Agreement is an existence proof that these particular systems emulate these particular computations. It is not a proof that every rule of every kind is universal, and it says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-12 (pr-130): supports, confidence 0.86 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 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/pr-130/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 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--pr-130 https://w3id.org/delphi/ontology/admissibleDatasets Only configurations generated by analysis.py from the rules, widths, step counts and transition tables in the pass criterion. No external dataset. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/disconfirmingObservation Any cell disagreement in the forward box, which refutes the claim that these systems compute the same configurations. A reverse-direction disagreement with a clean forward box is mixed rather than a refutation of the forward emulations. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/evidenceAgainst The computation shows that these particular programs produce the same configurations on the pre-registered boxes. It does not show that organisms follow the claim, and it does not show that every rule of every kind is universal. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/evidenceAgainst The forward emulators are general elementary-rule interpreters: the same substitution rules, Turing control and register program run every Wolfram number from 0 through 255. The reverse direction is one Turing machine, not every Turing machine. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/expectedObservation Zero cell disagreements among the elementary cellular automaton, the Turing machine, the register machine and the sequential substitution system on all 256 rules, all 32 seeds of width 5 and 3 steps, and zero step disagreements between the six-color cellular automaton and the flip-zeros Turing machine on all 64 tapes, 6 head positions and 6 steps. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/failCriterion Pre-registered. REFUTES if forward_mismatched_cells > 0 (the Turing machine, the register machine or the substitution system disagrees with the elementary cellular automaton on any rule, seed or step in the box). MIXED if forward_mismatched_cells == 0 and reverse_mismatched_steps > 0 (the other systems emulate every elementary rule in the box, and the cellular automaton fails to emulate the specified Turing machine). INCONCLUSIVE with reason 'other' if a simulator fails to halt within the pre-registered step budget: 100 substitution or Turing steps per cellular-automaton step, and 100000 register instructions per cellular-automaton step. Confidence: mixed 0.70, refutes 0.88, inconclusive 0.45. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/hasConfidence 0.86 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--pr-130--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/hypothesis A Turing machine, a register machine and a sequential substitution system can each emulate every elementary cellular automaton on every short periodic configuration, and one six-color cellular automaton can emulate a specified Turing machine, so these structurally different systems produce the same computed configurations. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/inferenceMethod Exact equality of configurations. Supports only if both mismatch counts are zero. Refutes if the forward count is positive. Mixed if only the reverse count is positive. Inconclusive if a simulator exceeds its step budget. Confidence: supports 0.86, mixed 0.70, refutes 0.88, inconclusive 0.45. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/delphi/ontology/passCriterion Pre-registered. Forward direction. Periodic elementary cellular automata, Wolfram rules 0..255, width W = 5, every one of the 32 initial rows, evolution for T = 3 steps. Three emulators must match the cellular automaton cell for cell at every step. (1) Sequential substitution system. Symbols are the bits plus an end marker E and markers M_{p,f} with p,f in {0,1}. Initial string is M_{c4, c0} followed by c0 c1 c2 c3 c4 E. Leftmost sequential rules: M_{p,f} c r -> new(p,c,r) M_{c,f} r whenever r is a bit, and M_{p,f} c E -> new(p,c,f) Mdone E, where new(L,C,R) is the elementary rule on that neighborhood. After 5 substitutions the bit prefix must equal one periodic step; repeat from the new row for 3 steps. (2) Turing machine with the same finite control: symbols {0,1,E}, states M_{p,f} plus Halt. Head starts on c0. In state M_{p,f}, read c; if the next symbol is a bit r, write new(p,c,r), enter M_{c,f}, and leave the head on r; if the next symbol is E, write new(p,c,f) and halt. (3) Register machine with instructions INC, DEC, JZ and HALT only. Registers hold the packed row and the rule number. The program, compiled into those instructions, extracts the periodic bits (i-1, i, i+1) mod 5 for i = 0..4, writes rule bit 4*L+2*C+R into an output register, and replaces the row. It does this for 3 steps. Reverse direction. Turing machine 'flip-zeros': symbols {0,1}, states {Q, H}, tape a ring of length 6. Transitions: (Q,0) writes 1 and moves right staying in Q; (Q,1) writes 1 and stays in H; (H,0) and (H,1) stay, writing the same symbol. Six-color radius-1 periodic cellular automaton with colors 0,1 = tape symbols without a head, 2,3 = head Q on symbol 0,1, and 4,5 = head H on symbol 0,1. Local rule, applied to every neighborhood: center 2 becomes 1; center 3 becomes 5; center 0 or 1 whose left neighbor is 2 becomes 2 or 3 respectively; every other center stays. Every one of the 64 tapes, head starting in Q at every one of the 6 positions, for 6 successive steps, must match the Turing machine. SUPPORTS if forward_mismatched_cells == 0 and reverse_mismatched_steps == 0. Confidence if supports: 0.86. https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 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--pr-130 https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--pr-130--dataset-1 http://purl.org/dc/terms/description the programs whose configurations are compared cell by cell https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--pr-130--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--pr-130--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--pr-130--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Elementary rules 0..255 emulated by a Turing machine, a register machine and a sequential substitution system, plus one six-color cellular automaton emulating flip-zeros, generated by analysis.py https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-12--claim-test--pr-130--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p674--implications-of-universality/ https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/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-claim-tests-7ca2) 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/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-12/pr-130/result.json https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/test https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/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/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/plan https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/pubinfo https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://purl.org/dc/terms/created 2026-11-08T16:24:31.938Z https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-12--claim-test--pr-130 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch11-12 (pr-130): supports, confidence 0.86 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/sig http://purl.org/nanopub/x/hasSignature ij33uHdpP3K359B8C0ITaeKbYCzVDFlAtOPB2Hs+nJdcSnx14JtlM51XHADtlOH/QqCy4G08j6f1muWpy2MBvBNR8P6o1nSmLszo5OqxK5+6pGl8ggB43/9oE8pSei0SpdCiJDrz0CV5ORyKnpjKp/JnREM3I3Oz54dXanwsDRv3C4N4qYUTnx/Hv8gKve9RGeZPjtlqDzbBfRq6bxY76UWBRlt4aGk9pscf1cGfdWU8yhQciQNuPncmWg8aQpNTtoggp3YnKKGCOfwiZKMhkwN3Vv9AUl9iOVZ/+pLBULVlSq50XXkxiySX/wtOLoW+dVYJRdpobVbKsr0z/VQ2Aw== https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I https://w3id.org/np/RA7jY_E4iFCrDrmRiwUqU6BJMqpKk2PaKHlKuGOg-sU_I/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192