https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/Head https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/assertion https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/provenance https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/pubinfo https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test http://purl.org/dc/terms/description analysis.py computed partial quotients of sqrt(2) (Decimal.sqrt), e (series), pi (Machin) and cbrt(2) (Newton) at 4000 and 8000 decimal digits, kept the agreeing prefix, and classified the first 300 terms. Classes: {'sqrt(2)': 'purely_repetitive', 'e': 'intermediate', 'pi': 'complicated', 'cbrt(2)': 'complicated'}. Purely repetitive means a period p<=40 with preperiod s<=5 covering the rest of the prefix. Otherwise the lzma-9 size of the comma-separated terms is divided by the mean size of 20 shuffles (PCG64 seed 20261102). Thresholds 0.55 and 0.80 are the pre-registered ones. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--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-16--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 3 constants matching the locked class (sqrt(2) purely repetitive, e regular, pi and cbrt(2) complicated) (n = 4, exact on the agreeing 300-term prefix). Interpretation: Wolfram's page 143 statement is that square roots have purely repetitive continued fractions, that e (and its roots) shows definite regularity, and that pi and cube roots look essentially random. 'Purely repetitive' is eventual periodicity of the partial quotients with preperiod at most 5. 'Definite regularity' is order that an LZMA compressor exploits far beyond the multiset of terms. 'Essentially random' is the absence of that order. A finite prefix does not prove that pi or cbrt(2) is non-periodic, and it does not say anything about organisms. Fourth roots and roots of e are outside this locked set. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-16: mixed, confidence 0.55 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--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-16/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--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-16--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Partial quotients generated in this directory by integer/decimal arithmetic at two precisions, with only the agreeing prefix used. No external table. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation sqrt(2) is not periodic on the prefix, e compresses no better than a complicated sequence, or pi or cbrt(2) is periodic on the prefix. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/evidenceAgainst A finite prefix cannot prove that pi or cbrt(2) never becomes periodic, and it does not prove a theorem about all cube roots or fourth roots. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The four arithmetic programs say nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/evidenceAgainst sqrt(2) was purely periodic with period 1 after the first term. pi and cbrt(2) had compression ratios 1.021 and 1.003 against shuffles of their own terms. e began 2, 1, 2, 1, 1, 4, 1, 1, 6 and compressed to 0.634 of a shuffle, which is between the locked cutoffs 0.55 and 0.80, so the pre-registered test calls e intermediate rather than regular. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/expectedObservation Among 300 partial quotients, sqrt(2) is eventually periodic with preperiod <= 5 and period <= 40, e is not, but compresses to at most 55% of a shuffle of its own terms, and pi and cbrt(2) compress to at least 80% of a shuffle and are not periodic on this prefix. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if sqrt(2) is not purely repetitive, or e is complicated, or pi or cbrt(2) is purely repetitive. Mixed if sqrt(2) is purely repetitive but e, pi or cbrt(2) falls strictly between the two compression thresholds (ratio in (0.55, 0.80)). Inconclusive with reason underpowered if fewer than 300 partial quotients agree across the two precisions. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.55 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-16--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/hasVerdict mixed https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/hypothesis The first 300 continued-fraction partial quotients of sqrt(2) are purely repetitive, those of e are regular but not purely repetitive, and those of pi and cbrt(2) are neither periodic nor substantially more compressible than a shuffle of the same terms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/inferenceMethod Classify each of the four sequences by the locked periodicity test and, if that fails, by the lzma-to-shuffle ratio with thresholds 0.55 and 0.80. The claim is supported only if all four classifications match the hypothesis. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Compute partial quotients of sqrt(2), e, pi and cbrt(2) from Decimal series (sqrt via Decimal.sqrt; e via sum 1/n!; pi via Machin 16*arctan(1/5)-4*arctan(1/239); cbrt(2) via Newton). Keep the longest prefix on which precisions 4000 and 8000 decimal digits agree, and require at least 300 agreeing terms; otherwise the test is inconclusive (underpowered). Regularity statistic, locked before the run: a sequence a[0..n) is purely repetitive if there exist a period p in 1..40 and a start s <= 5 such that n - s >= 250 and a[i] == a[i+p] for every i in s..n-p-1. Otherwise form the comma-separated decimal text of the 300 terms and let compression_ratio be its lzma-9 size divided by the mean lzma-9 size of 20 shuffles of those terms (numpy Generator PCG64 seed 20261102). Regular means compression_ratio <= 0.55. Complicated means compression_ratio >= 0.80. Supports if sqrt(2) is purely repetitive, e is regular, and both pi and cbrt(2) are complicated. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch04-16 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-16--claim-test--dataset-1 http://purl.org/dc/terms/description the four continued fractions named in the pre-registration https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-16--claim-test--dataset-1 http://purl.org/dc/terms/license generated https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-16--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-16--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: 300 agreeing partial quotients of sqrt(2), e, pi and cbrt(2) https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-16--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p143--mathematical-constants/ https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/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/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-16/result.json https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/test https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/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/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/plan https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/pubinfo https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://purl.org/dc/terms/created 2026-11-08T16:24:31.924Z https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-16--claim-test https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-16: mixed, confidence 0.55 https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/sig http://purl.org/nanopub/x/hasSignature jNCkfd2cbgqaZzQZs4bQW/T+RL5pAqzVKAdIRVtoXswtBHqU8pA2FxsVe2jVtRnXvqqIp8FH4kfCggkU4WmilgRfrD/LexnyceXRSbkJEcGBKPBzoepJRlA8TzEeARHlgCcCt/q+sdQhklegm1dta0OrEG2Bn+Y726QvbJ1xr2P5N2RpDJZNnaM2LbnjRzN3gEanDvsUbDRcC4BzeFLOKOUvDZZYgkbGq6rksoyOHPC80TZLXOzGemDAwWOfEFX3XCMjKD6DAU1usf0FuT/mCYMPGTj1E6C/iw7QnE9hAMKMWS29uitlW9K50INymFfYdhwWrQPFWig2pkeTYYKKdw== https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A https://w3id.org/np/RATT7_-oxUeb8_vKmgJnM1egnADHiHQ6qsL5gEhts4B-A/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192