https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/Head https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/assertion https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/provenance https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/pubinfo https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test http://purl.org/dc/terms/description analysis.py holds the five generating programs as Python source strings (94-207 bytes each, all under the pre-registered 400), executes them to produce 4096-byte strings, draws 4096 bytes from os.urandom, and applies zlib level 9, bz2 level 9 and lzma preset 9 extreme (recognition = compressed size <= 0.97 x the compressed size of the urandom string), the Berlekamp-Massey algorithm over GF(2) on the 32768-bit sequence (recognition = linear complexity < 8192), and an affine-recurrence fit modulo 2^32 solved from the first three 32-bit words and verified on the remaining 1021 (recognition = exact fit). Sanity checks: the pi string starts with the known hex expansion 243F6A88..., Berlekamp-Massey returns 4 for a degree-4 LFSR, and the rule 30 column matches OEIS A051023 (checked by hand on the first 32 bits). https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--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-ch10-23--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 2 number of the four simple-description strings (description <= 207 bytes) recognized by none of the five methods (criterion c; pre-registered requirement >= 1) (n = 6, compression sizes are deterministic except the os.urandom baseline, which varies by a few bytes between runs). Interpretation: Operationalizes 'recognize a regularity' as achieving a non-trivial compression or an exact fit by a specialized recognizer, and 'simple description' as a generating program of under 400 bytes. Criteria (a) and (c) exhibit the first half of the claim (current methods miss regularities with short descriptions); criterion (b) exhibits the second half (higher or different methods recognize some of what others miss). The expected witnesses are the rule 30 centre column and the digits of pi (missed by everything tested) and the xorshift/LCG outputs (missed by compressors, caught by linear-complexity or affine fitting). This is finite evidence for the empirical content of a mathematical theorem, not a proof; the theorem itself (Kolmogorov 1965, Chaitin 1966; see Li & Vitanyi) is not re-derived. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-23: supports, confidence 0.7 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--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-ch10-23/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--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-ch10-23--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: simple-description-sequences-generator, os-urandom-baseline https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered. The claim is a theorem (uncomputability of Kolmogorov complexity) and cannot be refuted by a finite computation; this test checks whether its concrete content is exhibited by actual methods. 'Mixed' if any compressor recognizes all four simple-description strings (the chosen simple descriptions are all perceptible to a standard method) or if any method recognizes the urandom baseline (false alarm, so 'recognition' is not meaningful at this length). 'Inconclusive' with reason 'construction-failed' if (b) or (c) fails, i.e. the chosen generators do not exhibit a regularity that some method misses while another catches, or none that every method misses. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/evidenceAgainst 'Recognition' thresholds (3% compression gain, linear complexity below n/4, exact affine fit) are the pre-registered operationalization; they are conservative but still arbitrary. The bz2 ratios of 0.991-0.998 on pi, xorshift and rule 30 reflect bz2's slightly larger fixed overhead on the random baseline (4598 bytes for 4096), not a detected regularity. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The os.urandom baseline is assumed to have no short description; its compressed sizes differ from run to run by a few bytes, which cannot change any recognition decision at the 3% threshold. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The rule 30 centre column and the binary digits of pi are missed by all five methods; that they have short descriptions is shown by construction. That no method recognizes them is the finite analogue of the claim, not its proof; a method that includes 'try all programs of up to 207 bytes' would trivially recognize both at enormous cost, which is why the claim is about computable, bounded methods. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/evidenceAgainst This is finite evidence for the empirical content of a theorem (uncomputability of Kolmogorov complexity), using five specific methods and four specific short programs; it cannot prove the universal statement and was not designed to refute it. Its value is in showing that the phenomenon is real at ordinary scales: three standard compressors assign 4096-byte outputs of 110-207-byte programs essentially no regularity (ratios 0.99-1.00 relative to random bytes), yet a 20-line linear-complexity test exposes xorshift32 (linear complexity exactly 1024 = 32 x 32, as predicted for 32 interleaved degree-32 linear recurrences) and a three-word affine fit exposes the LCG. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered. Generate six byte strings of 4096 bytes (32768 bits) each: (1) rule 30 centre column from a single black cell; (2) a linear congruential generator modulo 2^32 (a = 1664525, c = 1013904223, seed 1), 32-bit words little-endian; (3) xorshift32 (shifts 13, 17, 5, seed 2463534242), 32-bit words; (4) binary digits of pi after the binary point (Machin formula, exact integer arithmetic); (5) Thue-Morse sequence bits (positive control, obviously regular); (6) os.urandom bytes (baseline, no short description assumed). Generating source for (1)-(5) must be under 400 bytes each (recorded). A method 'recognizes' a string if: for a compressor, its output is at most 0.97 times the compressed size of the urandom baseline of the same length (3% gain); for Berlekamp-Massey, the linear complexity of the bit sequence is below one quarter of its length; for the affine recognizer, the recurrence x_{i+1} = a x_i + c mod 2^32 solved from the first three words holds for every remaining word. 'Supports' if ALL of the following hold: (a) each of the three compressors fails to recognize at least two of the four simple-description strings (1)-(4); (b) at least one of (1)-(4) is recognized by a specialized method but by none of the three compressors; (c) at least one of (1)-(4) is recognized by none of the five methods; (d) controls: all three compressors recognize (5) with output below 0.2 of the urandom size, and no method recognizes (6). https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. The claim is a theorem (uncomputability of Kolmogorov complexity) and cannot be refuted by a finite computation; this test checks whether its concrete content is exhibited by actual methods. 'Mixed' if any compressor recognizes all four simple-description strings (the chosen simple descriptions are all perceptible to a standard method) or if any method recognizes the urandom baseline (false alarm, so 'recognition' is not meaningful at this length). 'Inconclusive' with reason 'construction-failed' if (b) or (c) fails, i.e. the chosen generators do not exhibit a regularity that some method misses while another catches, or none that every method misses. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.7 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/hypothesis For any fixed, mechanical method of perception and analysis there exist data with a very short generating description that the method fails to recognize as regular (assigns no significant compression), while a different, more specialized method does recognize some of these. In the limit this is the uncomputability of Kolmogorov complexity (no total computable function lower-bounds description length usefully); here the testable content is checked on concrete methods: three general-purpose compressors (zlib, bz2, lzma) and two specialized recognizers (Berlekamp-Massey linear complexity over GF(2); affine-recurrence detection modulo 2^32), applied to sequences generated by programs of under 400 bytes. https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py holds the five generating programs as Python source strings (94-207 bytes each, all under the pre-registered 400), executes them to produce 4096-byte strings, draws 4096 bytes from os.urandom, and applies zlib level 9, bz2 level 9 and lzma preset 9 extreme (recognition = compressed size <= 0.97 x the compressed size of the urandom string), the Berlekamp-Massey algorithm over GF(2) on the 32768-bit sequence (recognition = linear complexity < 8192), and an affine-recurrence fit modulo 2^32 solved from the first three 32-bit words and verified on the remaining 1021 (recognition = exact fit). Sanity checks: the pi string starts with the known hex expansion 243F6A88..., Berlekamp-Massey returns 4 for a degree-4 LFSR, and the rule 30 column matches OEIS A051023 (checked by hand on the first 32 bits). https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Generate six byte strings of 4096 bytes (32768 bits) each: (1) rule 30 centre column from a single black cell; (2) a linear congruential generator modulo 2^32 (a = 1664525, c = 1013904223, seed 1), 32-bit words little-endian; (3) xorshift32 (shifts 13, 17, 5, seed 2463534242), 32-bit words; (4) binary digits of pi after the binary point (Machin formula, exact integer arithmetic); (5) Thue-Morse sequence bits (positive control, obviously regular); (6) os.urandom bytes (baseline, no short description assumed). Generating source for (1)-(5) must be under 400 bytes each (recorded). A method 'recognizes' a string if: for a compressor, its output is at most 0.97 times the compressed size of the urandom baseline of the same length (3% gain); for Berlekamp-Massey, the linear complexity of the bit sequence is below one quarter of its length; for the affine recognizer, the recurrence x_{i+1} = a x_i + c mod 2^32 solved from the first three words holds for every remaining word. 'Supports' if ALL of the following hold: (a) each of the three compressors fails to recognize at least two of the four simple-description strings (1)-(4); (b) at least one of (1)-(4) is recognized by a specialized method but by none of the three compressors; (c) at least one of (1)-(4) is recognized by none of the five methods; (d) controls: all three compressors recognize (5) with output below 0.2 of the urandom size, and no method recognizes (6). https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch10-23 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-1 http://purl.org/dc/terms/description data with short descriptions, a regular control and a random baseline https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-1 http://purl.org/dc/terms/license CC0 (generated data) https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--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-ch10-23--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Six 4096-byte strings generated by analysis.py https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-2 http://purl.org/dc/terms/description reference compressed size for strings with no short description https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--claim-test--dataset-2 http://purl.org/dc/terms/license n/a https://w3id.org/delphi/resource/evidence/wolfram2002-ch10-23--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-ch10-23--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Operating-system random bytes (os.urandom) https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/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/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/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/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch10-23/result.json https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/test https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/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/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/plan https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/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/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/pubinfo https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://purl.org/dc/terms/created 2026-11-08T16:24:31.936Z https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch10-23--claim-test https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch10-23: supports, confidence 0.7 https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/sig http://purl.org/nanopub/x/hasSignature sjzmaZgQ+AluU2wqarx8qGLoZVqk9wpX+zTF3Un7M/5V7pjrtZFK8wm1Z6D8d4MXpOnltOuUP9/hUcxpPbD/evqJ2Gv+HYHu/WcLCEHdVHe1FjDUMDQcI/1cuyNIk4BHAgmzhLZ3mia79OEalG6yi1iNfZoib3VODNrvepJd/l+LMdIBP5+a6xZc278K34umU8jHEi09NmH4m62TqvRCi9qBLADrLXc5lXTNO2FgIanjSnu/SiXzvAdNJpG6LvuS+bw5tiiaoBn4EiZUN6BnCsRk3CD+NaGR0LCuzjUuonPBvtF9UTJWbjxAsuaY0/vWBNypw8eoEALOLJx3PiE/3g== https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c https://w3id.org/np/RAOy3c24OzMcVeMKUiYfwJwXZwhT9SjX14opzWPx2M22c/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192