https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/Head https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/assertion https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/provenance https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/pubinfo https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test http://purl.org/dc/terms/description analysis.py evolved 4-color nearest-neighbor totalistic code 1004600, with output for sum s equal to (1004600 // 4**s) mod 4, from all 81 nonzero rows of width 1, 2 or 3 on a white background, for 800 steps. Early deaths by step 5: 26. Deaths by step 800: 26. Still growing: 0. The book's pictured initial conditions are not in the text, so they were not used. Undecidability was not tested. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--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-ch12-20--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 width-1..3 initial rows still growing at step 800 (n = 81, exact on this finite family and cutoff). Interpretation: Pages 754-755 name a 4-color totalistic rule, code 1004600, and say that some simple initial conditions die only after a long time while others are still growing after millions of steps, which Wolfram ties to undecidability. The code and the base-4 digit convention are stated; the four pictured initial conditions are not. The test is a bounded search of rows of width at most 3. Death and continued growth inside 800 steps are the observations. They do not prove that the ultimate fate is undecidable, and they do not concern organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-20: refutes, confidence 0.42 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--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-ch12-20/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--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-ch12-20--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Totalistic code 1004600 under the page-60 digit convention, on the locked finite set of initial strings. No enumeration of a 2^32 template space. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Every short row that survives 5 steps has died or settled into a stable-width period by step 200. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Every one of the 81 rows either died by step 3 or became a tiny oscillator. The largest trimmed width at step 800 was 3. One survivor alternates between (2,2,2) and (1,). None was still growing. That does not prove the rule cannot grow from a longer seed. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The digit convention is the one on page 60: the least significant base-4 digit is the output for sum 0. The result says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The pictured initial conditions, including the pattern that dies at step 1017 and the ones still wide after ten million steps, are not printed as rows. A pattern still changing at a cutoff would not be a proof of undecidability, and this search found no such pattern. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/expectedObservation At least one of the 81 short rows becomes all white by step 800, and at least one has a wider active region at step 800 than at step 400 and a new trimmed row. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if every string that is not all zero by step 5 has died or become periodic with stable width by step 200, so none is still growing at step 800 and none dies late. Mixed if some die by step 800 but none is still growing, or some are still growing but none dies. Undecidability is not a possible verdict of this bounded search: a pattern still changing at step 800 is recorded as unsettled within the bound and is not called undecidable. The book's step counts 36 and 1017, and the widths after 10^7 steps, are not tested, because those initial conditions are in a figure and are not printed as rows. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.42 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-20--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/hasVerdict refutes https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/hypothesis For 4-color nearest-neighbor totalistic code 1004600, among all nonzero initial rows of width 1, 2 or 3 on a white background, at least one pattern dies out by step 800 and at least one is still growing at step 800. A pattern still changing at the cutoff is not a proof of undecidability. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/inferenceMethod Classify each string as early-dead, died by 800, periodic with stable width, or still growing. Support requires one death and one still-growing string. More than 90% dead by step 5 is not-operationalizable. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Code convention from page 60: the output for neighbor-sum s is (1004600 // 4**s) mod 4, for s = 0..9, colors 0..3, background 0. Family: every nonzero string of length 1, 2 or 3, centered on white cells (81 strings). Evolve each for 800 steps with white cells outside the light cone. Died: the row is all 0; record the first such step. Periodic: the active region, trimmed of leading and trailing zeros, together with its width, repeats some period p <= 40 among the last 80 steps, and the width at step 800 equals the width at step 400. Still growing: width of the trimmed region at step 800 is strictly greater than at step 400, and the trimmed row at step 800 does not appear in the trimmed rows of steps 720..799. Supports if at least one string dies by step 800 and at least one is still growing. If more than 90% of the 81 strings are all zero by step 5, the verdict is inconclusive with reason not-operationalizable (the encoding or the background does not yield a rule that survives, and the figure's initial conditions are not in the text). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch12-20 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-20--claim-test--dataset-1 http://purl.org/dc/terms/description bounded search of simple initial conditions; not the figure's four patterns https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-20--claim-test--dataset-1 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-20--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-ch12-20--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Code 1004600 from all nonzero rows of width at most 3 https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-20--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p754--undecidability-and-intractability/ https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/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-programs-c-b6e6) 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/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch12-20/result.json https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/test https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/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/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/plan https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/pubinfo https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://purl.org/dc/terms/created 2026-11-08T16:24:31.942Z https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-20--claim-test https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-20: refutes, confidence 0.42 https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/sig http://purl.org/nanopub/x/hasSignature PllHQHJ+s9EIB+/OeT/tRvGnTjx9Yoyjg9BNrNFCPnBRldeKV1vsClqTS0iUwgLjfHJecklfNin0nUhwMTlnWYeuTUPXCtvvUEj/Xh4UmMdSiaSB6SESzkGPDr7A17Dxghi9j9rmbe1lsRCYRgcisK4/lK/yTynG2raYGx7Ezj3QpTpOH5ePp8LdDgZKLNH5VzwKMgbsvwlDbwwNjyFy/7mvTVdFf/0SQD09fYEjqtYlZGfwAkwX7WIOnxbImf8phdQvLe1zDadVrtKmOSCkkWA7fOP6adEZW3j2rqCE7kL0tT1nRnHZeN8xO+P1C2S0yB2PdVi/69+GT9bPAKqwIg== https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M https://w3id.org/np/RA3ssNajPUlHzEqW_ux3RX9YansO_ln_uwLam2IS4rN3M/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192