https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/Head https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/provenance https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/pubinfo https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test http://purl.org/dc/terms/description analysis.py generated 2048 symbols of the Thue-Morse, period-doubling, Fibonacci and Cantor substitution sequences and the first 512 fractional digits of sqrt(2), sqrt(3), cbrt(2) and cbrt(3) in bases 2 and 10. Unequal pairs: 32 of 32. A 512-digit agreement would have been recomputed to 2048 digits. The universal reading is marked not-proved. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--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-ch04-15--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 sequence-root-base pairs equal on the checked prefix (n = 32, exact inequality when any digit differs; universal reading not proved). Interpretation: Page 142 says a nested digit sequence produced by a substitution system never corresponds to a number obtained by taking roots. 'Corresponds' is equality of digits. Inequality on a prefix proves that pair unequal. It does not prove the universal statement, which is marked not-proved and is not given a support verdict of its own. The scored claim is the locked family of 4 sequences, 4 roots and 2 bases (32 pairs). Nothing here is about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-15: supports, confidence 0.45 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--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-ch04-15/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--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-ch04-15--claim-test https://w3id.org/delphi/ontology/admissibleDatasets The four substitution systems and four roots named in pass_criterion, generated by analysis.py. No other sequence is searched after the run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Some locked nested sequence equals the expansion of one locked root through 2048 digits. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/evidenceAgainst A differing digit proves that pair unequal. It does not prove that no substitution system produces a root. The universal reading is not proved. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Nothing in this computation is about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The scored family is four sequences, four roots and two bases. Confidence is capped at 0.45 because the claim's 'never' is wider than the family. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/expectedObservation All 32 sequence-root-base comparisons differ in at least one of the first 512 digits. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if any pair agrees on 512 digits and still agrees on a recomputed prefix of 2048 digits. If a 512-digit agreement fails at 2048, the pair is not a counterexample and the example reading is scored on the 512-digit comparisons that remain unequal. A finite family cannot prove 'never'. Inconclusive is not used merely because the universal quantifier is open; that limit is stated in the verdict's caveats while the examples are scored. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.45 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/hypothesis None of four locked nested digit sequences agrees with the first 512 fractional digits of sqrt(2), sqrt(3), cbrt(2) or cbrt(3) in base 2 or base 10. The universal reading, that no nested sequence from any substitution system equals any root, is not proved by this check. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/inferenceMethod Count exact prefix agreements. Zero agreements supports the example reading with the universal reading marked not-proved. An agreement that survives 2048 digits refutes the universal claim by counterexample. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Substitution sequences, each truncated to 512 symbols, started as specified: Thue-Morse 0->01, 1->10 from 0; period-doubling 0->01, 1->00 from 0; Fibonacci word 0->01, 1->0 from 0; Cantor 1->101, 0->000 from 1. Roots: sqrt(2), sqrt(3), cbrt(2), cbrt(3), fractional digits in base 2 and base 10, 512 digits, from Decimal at precision 2000. A pair matches only if all 512 digits agree. The example reading is supported if the number of matches is 0. The universal reading is recorded as not-proved regardless. Confidence in a support verdict is capped at 0.45. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch04-15 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1 http://purl.org/dc/terms/description the locked nested digit sequences https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--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-ch04-15--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Thue-Morse, period-doubling, Fibonacci word and Cantor substitution sequences https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p142--mathematical-constants/ https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2 http://purl.org/dc/terms/description the locked roots https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--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-ch04-15--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Fractional digits of four roots in bases 2 and 10 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-15--claim-test--dataset-2 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p142--mathematical-constants/ https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-15/result.json https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/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/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/plan https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/pubinfo https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://purl.org/dc/terms/created 2026-11-08T16:24:31.923Z https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-15--claim-test https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-15: supports, confidence 0.45 https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/sig http://purl.org/nanopub/x/hasSignature Y3tbrwOlbkvnLib6cSSq6LGLGjoE/n9jHusde9pxbMLKEkB4pt8z1Li+iaBiiP7rAFHfTJfX4FU/NqD8nTmZzs4FKAr4f8u9Es79pXtjnfNCwmMl4R2cS+A4H9yiVHlTV0kX3/DG0T8zzljm3YqexcjixK94WLdKzyAww0XW+Rdd7d1copTyvLfe4MKbo0WHw88/Bw5keG0bbw1JIdKdMDek/I31wzR1xEANSUQHyI86DnIg5zU4F9YQ2tG5V+3qkbZKNnPZ6VkQlVJBNF0ij2wIkX2ygDAitFZ1pOPAv/eMmQ+7l18lrPCMvWq7UtdyCqoBSLJBKA+mSrtSZPYOkA== https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg https://w3id.org/np/RATTfBjt88vncGi5Yu1qPTy-If7NxrYTidBM3adku3Xmg/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192