https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/Head https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/assertion https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/provenance https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/pubinfo https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test http://purl.org/dc/terms/description analysis.py evolves rule 30 from one black cell on 131075 cells for 65536 steps and records the centre column; compresses the packed bits with lzma (preset 9 extreme) and compares with 65536 bits from os.urandom; checks every period p <= 32768 from offset 32768 for a mismatch; applies the monobit, Wald-Wolfowitz runs and 8-bit block chi-square tests; evolves all 256 rules for 1000 steps on 2003 cells and computes the lzma ratio of the packed pattern, comparing rule 30 with rules 90 and 250 and counting rules whose ratio exceeds half of rule 30's. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--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-ch02-03--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 1 lzma size of 2^16 rule-30 centre-column bits divided by lzma size of 2^16 os.urandom bits (threshold 0.95) (n = 65536, exact for rule 30; urandom baseline varies by a few bytes between runs). Interpretation: The claim is a general-principle existence statement ('can nevertheless show'); it is tested on its canonical witness, rule 30, as both assessors propose. 'Simple rule' = 8-bit rule table; 'simple initial condition' = one black cell. 'Highly complex behaviour' is operationalized as incompressibility (lzma), absence of periodicity, and passing standard randomness tests of the centre column, plus a comparison of pattern compressibility with nested (rule 90) and repetitive (rule 250) rules of identical description length. Rule numbering is Wolfram's. A single test battery is used; a sequence can be complex under these tests and simple under others (the assessors' obstacle), and the claim's 'general phenomenon' aspect is only illustrated by the census, not established. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch02-03: supports, confidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--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-ch02-03/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: eca-single-cell-generator https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered. 'Refutes' (for the witness, and hence failing to confirm the existence claim) if the rule-30 centre column is eventually periodic with period <= 2^15 within 2^16 steps, or if its lzma ratio is below 0.5 of the random baseline. Other combinations are 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Pre-registered criterion (b) was mis-specified at its upper end: for a period p close to 2^15 only n - p - t0 positions can be compared (one position for p = 32767, none for p = 32768), so those two periods 'pass' the literal test vacuously and analysis.py reports preregistered_verdict = 'refutes'. Every period p <= 32766 is contradicted (the hardest, p = 32764, still has a mismatch at index 32768). The post-hoc rule requires at least 64 comparisons for a period to count; under it no period passes and the verdict is 'supports'. Both outcomes are recorded in measured.extra. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The claim is a general principle; one witness confirms the existence reading. The census shows that 9 of the 256 elementary rules (30, 45, 73, 75, 86, 89, 101, 135, 149; mostly rule 30's and rule 45's symmetry equivalents) have pattern compressibility within a factor 2 of rule 30, the median rule compressing to 0.08% of raw size. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The complexity tests are a specific battery (lzma, periodicity, three NIST-style tests); rule 30's centre column is known to fail no standard test at this length, but a sequence can be complex under these and simple under others. Compression ratio 1.0 relative to os.urandom means lzma found no exploitable regularity, not that none exists. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The os.urandom baseline is non-deterministic; the rule-30 compressed size (8252 bytes for 8192 raw bytes) can be compared directly with the raw size: lzma expands it slightly, as it does for random data. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered. Rule 30 from a single black cell on a lattice wide enough that boundaries never influence the measured cells. (a) Compressibility: the lzma-compressed size of the first 2^16 centre-column bits (packed 8 per byte) is at least 0.95 times the compressed size of 2^16 bits from os.urandom packed the same way. (b) Aperiodicity: no period p <= 2^15 holds from any offset t0 <= 2^15 within the first 2^16 centre-column bits (i.e. for every p there is a t >= 2^15 with x[t] != x[t+p]). (c) Randomness tests on the 2^16 centre-column bits: monobit frequency test p > 0.01, Wald-Wolfowitz runs test p > 0.01, chi-square test on the 256 frequencies of non-overlapping 8-bit blocks p > 0.01. (d) Pattern complexity relative to simple rules: the lzma ratio (compressed/raw bytes of the packed bit image) of the 1001-step single-cell pattern (rows of 2001 cells) is at least 5 times larger for rule 30 than for the nested rule 90 and at least 5 times larger than for the repetitive rule 250. 'Supports' requires (a)-(d). In addition the census of all 256 elementary rules by the same pattern ratio is reported (number of rules with ratio > 0.5 of rule 30's ratio), without bearing on the verdict. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. 'Refutes' (for the witness, and hence failing to confirm the existence claim) if the rule-30 centre column is eventually periodic with period <= 2^15 within 2^16 steps, or if its lzma ratio is below 0.5 of the random baseline. Other combinations are 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-03--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/hypothesis There exists a system with a very short rule and a trivial initial condition whose behaviour is complex by standard operational measures: elementary rule 30 (an 8-bit rule) started from a single black cell produces a centre column that is not eventually periodic, is essentially incompressible, and passes standard randomness tests, and a space-time pattern that is far less compressible than those of nested or repetitive rules of the same description length. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py evolves rule 30 from one black cell on 131075 cells for 65536 steps and records the centre column; compresses the packed bits with lzma (preset 9 extreme) and compares with 65536 bits from os.urandom; checks every period p <= 32768 from offset 32768 for a mismatch; applies the monobit, Wald-Wolfowitz runs and 8-bit block chi-square tests; evolves all 256 rules for 1000 steps on 2003 cells and computes the lzma ratio of the packed pattern, comparing rule 30 with rules 90 and 250 and counting rules whose ratio exceeds half of rule 30's. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Rule 30 from a single black cell on a lattice wide enough that boundaries never influence the measured cells. (a) Compressibility: the lzma-compressed size of the first 2^16 centre-column bits (packed 8 per byte) is at least 0.95 times the compressed size of 2^16 bits from os.urandom packed the same way. (b) Aperiodicity: no period p <= 2^15 holds from any offset t0 <= 2^15 within the first 2^16 centre-column bits (i.e. for every p there is a t >= 2^15 with x[t] != x[t+p]). (c) Randomness tests on the 2^16 centre-column bits: monobit frequency test p > 0.01, Wald-Wolfowitz runs test p > 0.01, chi-square test on the 256 frequencies of non-overlapping 8-bit blocks p > 0.01. (d) Pattern complexity relative to simple rules: the lzma ratio (compressed/raw bytes of the packed bit image) of the 1001-step single-cell pattern (rows of 2001 cells) is at least 5 times larger for rule 30 than for the nested rule 90 and at least 5 times larger than for the repetitive rule 250. 'Supports' requires (a)-(d). In addition the census of all 256 elementary rules by the same pattern ratio is reported (number of rules with ratio > 0.5 of rule 30's ratio), without bearing on the verdict. https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch02-03 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-03--claim-test--dataset-1 http://purl.org/dc/terms/description the witness system and the comparison rules https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-03--claim-test--dataset-1 http://purl.org/dc/terms/license CC0 (generated data) https://w3id.org/delphi/resource/evidence/wolfram2002-ch02-03--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-ch02-03--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Elementary cellular automata from a single black cell (generated by analysis.py) https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent 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-claude-fable-5-1-cursor-cloud-agent http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (Claude Fable 5.1 (Cursor cloud agent); cursor/claim-tests-wolfram-nks-f0e1) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/claude-fable-5-1-cursor-cloud-agent https://w3id.org/delphi/resource/model/claude-fable-5-1-cursor-cloud-agent http://purl.org/dc/terms/identifier Claude Fable 5.1 (Cursor cloud agent) https://w3id.org/delphi/resource/model/claude-fable-5-1-cursor-cloud-agent http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch02-03/result.json https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/test https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/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/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/plan https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1-cursor-cloud-agent https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/pubinfo https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://purl.org/dc/terms/created 2026-11-08T16:24:31.914Z https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch02-03--claim-test https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch02-03: supports, confidence 0.9 https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/sig http://purl.org/nanopub/x/hasSignature hhGJ8jngnCB9cgcPpHm+YHRqP7AbDvjvEtzJL3crNPxdvCmXy5cfxjVpJRc6OwK63GVUJPPxtJAXhBrul8Nun2Rrh85AR9/n7nMtZ1u5scroaueDexXmSwljrFqi9ipYYYdxLFP1mfyqc+06br77K8ISRvLdMA5R/cev2rI+S5RJxADawRwKjmUtMTSL154U/DI/1wCtQDGHRpUo4VjDbhCzWM1Vs3RD+EM29SU2jYPoWsGgBAXgSBDJ8FEZg4UrUacs8Z2/6ku1swhinIIQPBeE1oPQlsnDg1ACc+SUaSrV6QaS6UC4rHT7CSfPpS03Mssy0lDxJSBmyysab2N5UA== https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ https://w3id.org/np/RAV6kNcYeeI2SbRdO_7trtemZEOea3AQlLNuUxxS_C3OQ/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192