https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/Head https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/assertion https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/provenance https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/pubinfo https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test http://purl.org/dc/terms/description analysis.py (1) runs every one-deletion rule for |s| steps from every sequence s of length 1-5 and compares with the substitution image, over 4 passes; (2) iterates every one-deletion rule from 1, 11 and 10 as a substitution system until the state recurs or empties (finite state space) or the sequence reaches 2000 symbols, where the number of distinct length-10 subwords p(10) is computed; (3) runs all 50625 two-deletion rules from 11 for 2000 steps, classifies them as emptied, recurrent or running, then runs the 400 running rules with the smallest length (and NKS p. 94 case (a)) for 50000 steps with exact state-recurrence detection and compares the lzma size of the length-difference series over steps 10000-50000 with that of its shuffles. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--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-ch03-13--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 376 two-deletion rules meeting the pre-registered complexity criterion (of 400 fully tested) (n = 50625, exact (deterministic computation)). Interpretation: Tag systems follow NKS p. 93-94 and the implementation note (p. 894): at each step n elements are removed from the front and a block determined by the removed n elements is appended; a sequence shorter than n becomes empty. 'Neighbor-independent substitution system' is the map replacing each symbol by its block (NKS p. 83). 'Repetitive or nested' is operationalized as finite state space (eventual periodicity) or linear factor complexity (p(10) <= 60 for a two-letter sequence; the Thue-Morse sequence has p(10) = 28). 'Very complicated' is operationalized as non-terminating, non-recurring evolution with a length series that lzma cannot compress much better than its own shuffle. The test is computational; the program family is generated by analysis.py. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch03-13: supports, confidence 0.93 https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--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-ch03-13/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--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-ch03-13--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: tag-system-enumeration-generator https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered. 'Refutes' if (1) fails in any case, or if any one-deletion rule reaches >= 2000 symbols with p(10) > 200, or if no two-deletion rule meets (3). Other combinations are 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Only the 400 survivors with the smallest length after 2000 steps were run to 50000 steps; the 376 count is therefore a lower bound on complicated rules in the family. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Part 2 'undetermined' (20 of 675 cases) are rules whose sequence exceeded 200000 symbols before reaching 2000 or recurring; these are exponentially growing substitutions with constant blocks, not evidence against the claim. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Run time is about 6 minutes on one core, mostly the 50625-rule census. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The complexity criterion is applied to the length series, so a tag system whose length grows steadily but whose contents are complex (e.g. NKS p. 94 case (a), ratio 0.028) does not count as 'complicated' here; the existence clause is nevertheless met by 376 other rules. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/evidenceAgainst p(10) <= 60 is a proxy for 'nested or repetitive' (linear factor complexity); the maximum observed was 43 (rule 0->0, 1->011), well within the nested range, and no rule exceeded the 200 refutation threshold. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered. (1) Equivalence: for all 225 one-deletion two-colour tag systems with blocks of length 0-3, all 62 initial sequences of length 1-5, and 4 consecutive passes, the sequence after each pass of |s| steps equals the substitution-system iterate exactly (100% of cases). (2) Simplicity: for every one-deletion rule started from the sequences 1, 11 and 10 and run for up to 400 passes, either the state space is finite (the sequence empties or an exact state recurs, i.e. repetitive) or the sequence reaches >= 2000 symbols and its factor complexity p(10) (number of distinct length-10 subwords) is <= 60 (nested, linear complexity). (3) Complexity with two deletions: at least one of the 50625 two-deletion two-colour tag systems with blocks of length 0-3, started from the pair 11, runs 50000 steps without emptying and without any exact state recurrence, and the lzma-compressed size of its length-difference series over steps 10000-50000 is at least 60% of the median compressed size of 5 random shuffles of the same series. 'Supports' requires (1), (2) and (3). https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. 'Refutes' if (1) fails in any case, or if any one-deletion rule reaches >= 2000 symbols with p(10) > 200, or if no two-deletion rule meets (3). Other combinations are 'mixed'. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.93 https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch03-13--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/hypothesis For every tag system that removes one element per step (Wolfram's convention: remove n elements from the front, append the block assigned to the removed n-tuple), running |s| steps from a sequence s yields exactly the neighbour-independent substitution image of s, so its long-run sequences are substitutive (eventually periodic or nested, with linear factor complexity); whereas among tag systems removing two elements per step some produce non-terminating, non-recurring evolution whose length series is nearly incompressible. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py (1) runs every one-deletion rule for |s| steps from every sequence s of length 1-5 and compares with the substitution image, over 4 passes; (2) iterates every one-deletion rule from 1, 11 and 10 as a substitution system until the state recurs or empties (finite state space) or the sequence reaches 2000 symbols, where the number of distinct length-10 subwords p(10) is computed; (3) runs all 50625 two-deletion rules from 11 for 2000 steps, classifies them as emptied, recurrent or running, then runs the 400 running rules with the smallest length (and NKS p. 94 case (a)) for 50000 steps with exact state-recurrence detection and compares the lzma size of the length-difference series over steps 10000-50000 with that of its shuffles. https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. (1) Equivalence: for all 225 one-deletion two-colour tag systems with blocks of length 0-3, all 62 initial sequences of length 1-5, and 4 consecutive passes, the sequence after each pass of |s| steps equals the substitution-system iterate exactly (100% of cases). (2) Simplicity: for every one-deletion rule started from the sequences 1, 11 and 10 and run for up to 400 passes, either the state space is finite (the sequence empties or an exact state recurs, i.e. repetitive) or the sequence reaches >= 2000 symbols and its factor complexity p(10) (number of distinct length-10 subwords) is <= 60 (nested, linear complexity). (3) Complexity with two deletions: at least one of the 50625 two-deletion two-colour tag systems with blocks of length 0-3, started from the pair 11, runs 50000 steps without emptying and without any exact state recurrence, and the lzma-compressed size of its length-difference series over steps 10000-50000 is at least 60% of the median compressed size of 5 random shuffles of the same series. 'Supports' requires (1), (2) and (3). https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch03-13 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch03-13--claim-test--dataset-1 http://purl.org/dc/terms/description enumerated program family whose behaviour is classified https://w3id.org/delphi/resource/evidence/wolfram2002-ch03-13--claim-test--dataset-1 http://purl.org/dc/terms/license CC0 (generated data) https://w3id.org/delphi/resource/evidence/wolfram2002-ch03-13--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-ch03-13--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Two-colour tag systems with blocks of length 0-3 (generated by analysis.py) https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/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/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/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/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch03-13/result.json https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/test https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/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/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/plan https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/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/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/pubinfo https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://purl.org/dc/terms/created 2026-11-08T16:24:31.920Z https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch03-13--claim-test https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch03-13: supports, confidence 0.93 https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/sig http://purl.org/nanopub/x/hasSignature s7p4NkyqTkvCfifPSBueHBhTBJ5PA0ytGYCCwV/Sx0T9P/wVE8zIqwW/PsmYiIAMl0URxpa7rfo+2PA1lJJV+sY3Ljt2OQvwVvr2Zv/GJZn6EWTe8saJLFXqqtF7qS5IG0hUrhVCyAkT6BYVh+sYKgGng6vjJkPcsZR3NxIi0jr8elE1+matIQbPbK6oi51CYZEThGHQHRfeNCPx8UR/VnGdIspoC4DWziKdCFuE+l4msQBgPd8oCgwXUlJlCZjdLEx0sci7bzLRhZFx0Kkg/Ip56IbX7SAtdG5u/k7FPyCVVU5bOM/v0pShfD/+FQzmFk7v3dagENobUfbK1LJ1FA== https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU https://w3id.org/np/RAAFOVnWyoXuApQ0Fk_UMIv8UZdIJRaIcteE4iC9jVWeU/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192