https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/Head https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/assertion https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/provenance https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/pubinfo https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test http://purl.org/dc/terms/description analysis.py evolved outer-totalistic code 942, the page-171 rule that turns a cell black when exactly one or all four orthogonal neighbors are black, for 40 steps on an 81 by 81 grid from one black cell. The center row's light cone (1681 cells) was lzma-9 compressed and compared with elementary rule 90 packed the same way and with 1681 random bits. Sizes: slice 72, rule 90 172, random 272. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--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-ch05-02--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0.2647058823529412 lzma(code 942 center-row light cone) / lzma(random control of the same length) (n = 1681, exact). Interpretation: Page 176 says a one-dimensional slice through the two-dimensional totalistic patterns of the preceding pages looks like an ordinary one-dimensional cellular automaton. Code 942 is the numbered nested example on page 171. Similarity of complexity is compressibility of the center-row space-time against rule 90 and against noise. The grid is the light cone of 40 steps. This does not show that every two-dimensional rule has a complex interior, and it says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch05-02: refutes, confidence 0.48 https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--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-ch05-02/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--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-ch05-02--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Code 942 as defined on NKS page 171, and elementary rule 90, on the locked grids. The random array is a control, not a dataset of observations. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation The slice compresses like the random control, or it is nearly blank. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/evidenceAgainst One code and one slice do not survey two-dimensional rules. The comparison says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The center-row light cone of code 942 was 1681 black cells and 0 white cells: on this rule the symmetry axis is a solid bar. Rule 90's cone had 301 black cells. The solid bar compresses to 72 bytes against rule 90's 172, and it fails the requirement of at least 20 white cells. Off-axis slices were not scored. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/expectedObservation The light-cone cells of the center-row slice of code 942 compress to at most half a same-length random control and to at most three times rule 90, and the slice is not a blank or solid field. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if S(slice) > 0.80 * S(random), or the slice has fewer than 20 black or 20 white cells. Mixed if the slice is structured (S(slice) <= 0.50 * S(random) and both colors appear) but S(slice) > 3 * S(rule 90). The comparison is one code against one elementary rule. It does not survey two-dimensional rules. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.48 https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/hasVerdict refutes https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/hypothesis The center-row space-time of two-dimensional outer-totalistic code 942 is highly compressible, like elementary rule 90 and unlike a random array of the same shape. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/inferenceMethod Compare lzma-9 sizes of the three packed binary arrays with the ratios 0.50, 0.80 and 3, and require both colors in the slice. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered, with the packed cells corrected before any run so the untouched white margin is not counted. Code 942 is the 4-neighbor outer-totalistic rule on page 171: a cell becomes black if exactly one or all four orthogonal neighbors are black, and otherwise keeps its color. Digit convention checked against code 942 = 0b1110101110, where the least significant bit is (center white, zero black neighbors). Grid 81 by 81, 40 steps, one black cell at the center, fixed white outside the array. For each time t = 0..40 the slice keeps the center-row cells in [center - t, center + t] (1681 cells). Elementary rule 90 is packed the same way on width 81 for 40 steps from one black cell. The random control is 1681 Bernoulli(0.5) bits from numpy Generator PCG64 seed 20261102. Let S be the lzma-9 size of the packed bits. Supports if S(slice) <= 0.50 * S(random) and S(slice) <= 3 * S(rule 90), and the slice contains at least 20 black cells and 20 white cells. https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch05-02 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-1 http://purl.org/dc/terms/description the two-dimensional totalistic code named on page 171 https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-1 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--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-ch05-02--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Code 942 center-row light cone, 40 steps https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p171--cellular-automata/ https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 http://purl.org/dc/terms/description the one elementary rule used as the comparison https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Elementary rule 90 light cone, width 81, 40 steps https://w3id.org/delphi/resource/evidence/wolfram2002-ch05-02--claim-test--dataset-2 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p176--cellular-automata/ https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/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/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch05-02/result.json https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/test https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/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/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/plan https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/pubinfo https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://purl.org/dc/terms/created 2026-11-08T16:24:31.925Z https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch05-02--claim-test https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch05-02: refutes, confidence 0.48 https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/sig http://purl.org/nanopub/x/hasSignature hsyUk32c+kD/6Mdu8GcDBhYaAWjqaUYFvMTZN9t+HL1XC+UxPOayI0s9oXfOTwtbzoKywGEkPXRJeDgDgstI3/wzi43OCaRnba3H3AwwlKbph3bQfMn4wwwNpJSyiFQZAXH94cyB5i46joEo3kK5FmZUKIrMutN141AZCU9uvDi7c1FEh6fQOuemMSU94WHnPfOOyP701YsnJ5+dvNMfi04hRQL87fC7IlBhSr8iZrT51zOfBHyOpEEsvkoV07HfIHzQbKKlwKUD5E2/RUIHpQY3O0sdpqDYgB83i5E8OeH558XEuTp5uUtW5lRjfUwY1F9rERw+HBe3/SrCVpKgxA== https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY https://w3id.org/np/RA7mJgHOzgRE_B3jvs3KfsOkKk_1yX3m8ddQHuD7wYkUY/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192