https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/Head https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/assertion https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/provenance https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/pubinfo https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test http://purl.org/dc/terms/description analysis.py builds, for each enumerated system, the complete transition map on its N global states and computes for every state the transient length and the eventual period from the functional graph (in-degree peeling to find cycle nodes, cycle walking for periods, vectorised relaxation for transients). It then counts orbits with period > N or transient + period > N. Families: 256 ECA x ring sizes 1..12 (3072 systems, 2,096,640 orbits), 4096 two-state two-colour Turing machines x cyclic tapes 1..5 (20,480 systems, 2,113,536 orbits), and x -> m x mod n for n = 2..200 (20,099 maps, 2,686,699 orbits). Total 43,651 systems and 6,896,875 orbits; run time about 4 s. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-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-ch06-12--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 1 fraction of orbits with eventual period <= N and transient + period <= N (n = 6896875, exact (exhaustive enumeration, no sampling)). Interpretation: Wolfram's 'system of limited size that involves discrete elements and follows definite rules' is read as a deterministic map f on a finite set of N global states, so 'definite rules' means the next state depends only on the current state. 'Eventually exhibit repetitive behavior' is read as: the orbit s, f(s), f(f(s)), ... is eventually periodic, with the eventual period (cycle length) at most N; the text's surrounding argument (p. 255) gives exactly this bound. Three concrete families of finite systems from the book's own repertoire are enumerated: the 256 elementary cellular automata on cyclic rings of n cells (N = 2^n), the 4096 two-state two-color Turing machines on cyclic tapes of n cells (N = 2 * n * 2^n: head state x head position x tape contents), and the modular multiplication maps x -> m x mod n (N = n). For every system every state is used as an initial condition, so the test is exhaustive within the enumerated sizes. The claim is a theorem (pigeonhole principle); the computation checks that the stated bound is never exceeded in these families and records how close observed periods come to it. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch06-12: supports, confidence 0.99 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-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-ch06-12/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: eca-cyclic-rings-n1-12, tm-2state-2color-cyclic-tape-n1-5, modular-multiplication-maps-n2-200 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered: at least one orbit of at least one enumerated system has eventual period > N, or never repeats within N + 1 steps (impossible to observe without a period > N, so equivalently a measured period exceeding N). https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Systems whose next state depends on more than the current state (external input, randomness, unbounded memory) are outside the claim's scope and were not tested. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The claim is a theorem (pigeonhole principle on a finite state set), so a finite enumeration can only fail to refute it; the enumeration here covers three concrete families exhaustively up to the stated sizes and finds the bound tight (period = N in degenerate 1-cell systems, period = N - 1 for x -> 3x mod 199). https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Wolfram's bound is on the eventual period; the test also checks the slightly stronger transient + period <= N, which is what the pigeonhole argument actually gives, and it held in every orbit. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered: across all enumerated systems and all initial states, 100% of orbits satisfy period <= N and transient + period <= N (zero violations), where N is the exact number of distinct global states of the system. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered: at least one orbit of at least one enumerated system has eventual period > N, or never repeats within N + 1 steps (impossible to observe without a period > N, so equivalently a measured period exceeding N). https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.99 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-3 https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/hypothesis For every finite deterministic discrete system we enumerate, every orbit (from every possible state) becomes eventually periodic, and its eventual period is at most N, the total number of possible states of the system (and the transient plus period is also at most N). https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py builds, for each enumerated system, the complete transition map on its N global states and computes for every state the transient length and the eventual period from the functional graph (in-degree peeling to find cycle nodes, cycle walking for periods, vectorised relaxation for transients). It then counts orbits with period > N or transient + period > N. Families: 256 ECA x ring sizes 1..12 (3072 systems, 2,096,640 orbits), 4096 two-state two-colour Turing machines x cyclic tapes 1..5 (20,480 systems, 2,113,536 orbits), and x -> m x mod n for n = 2..200 (20,099 maps, 2,686,699 orbits). Total 43,651 systems and 6,896,875 orbits; run time about 4 s. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered: across all enumerated systems and all initial states, 100% of orbits satisfy period <= N and transient + period <= N (zero violations), where N is the exact number of distinct global states of the system. https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch06-12 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-1 http://purl.org/dc/terms/description finite deterministic systems with N = 2^n states https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-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-ch06-12--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: All 256 elementary cellular automata on cyclic rings of n = 1..12 cells, all 2^n initial states (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-2 http://purl.org/dc/terms/description finite deterministic systems with N = 2 n 2^n states https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-2 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--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-ch06-12--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: All 4096 two-state two-colour Turing machines on cyclic tapes of n = 1..5 cells, all initial configurations (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-3 http://purl.org/dc/terms/description finite deterministic systems with N = n states (Wolfram's 'systems based on numbers' of limited size) https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-3 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-3 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch06-12--claim-test--dataset-3 http://www.w3.org/2000/01/rdf-schema#label Dataset: Maps x -> m x mod n for n = 2..200 and m = 0..n-1, all initial residues (generated by analysis.py) https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 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 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (claude-fable-5.1; cursor/claim-tests-wolfram-nks-0123) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 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 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/claude-fable-5-1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://purl.org/dc/terms/identifier claude-fable-5.1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch06-12/result.json https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/test https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/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/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/plan https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/pubinfo https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://purl.org/dc/terms/created 2026-11-08T16:24:31.927Z https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch06-12--claim-test https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch06-12: supports, confidence 0.99 https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/sig http://purl.org/nanopub/x/hasSignature VosdA8uQPSJ3DBvpD6jgvpQqw8yWl2urMtKS3gsj0/D5Hxe0OnwIt91ljP3j0UoKv3cLUKJnenrE3qDg5uHVL0OaVzvJKh6LPAYtxr8LDjJOHa3z5Zo8oZOAdvetfzgW1ck+E0j2nC5dFS3MK8kvElQQjLI4ovTa5RhQqgYHvzGQMf5IUgdRhICRkPYXpw1lxq9JonI/8NIluwU5xRttPdX+PeFLyNyLbpmrIbDKDbkBzX8yMCCvZ9vdykRc/l7FLjMApEEMu8erXBTpcEL6/NL8rfJ2OSXJUxK/QQvEv02GmhGfd852QRj3MgPJ9YiMKOMQ5NK8TyEA1ejXSfqlWQ== https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU https://w3id.org/np/RAWxWZ3B57ZOKuoa7picI6tu8L0Egq8103DIyGCdZ1ODU/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192