https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/Head https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/assertion https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/provenance https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/pubinfo https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test http://purl.org/dc/terms/description analysis.py evolves each of the 128 instances with an integer stepper and an array stepper that must agree. A configuration that has not hit 0 within 32 steps has repeated a state, so it never hits 0. For a hit at time t the history integer is checked digit by digit against the truth table, including the final 0 and the absence of an earlier 0. sin(pi*n)=0 for integer n is used as the algebraic identity; math.sin on n=0..1000 is only a float cross-check. Distinct real roots of each polynomial are counted by Sturm's theorem and by exact rational bisection. An exact root is bracketed by shrinking the sample until the Sturm variation across the bracket is 1, so the split cannot step over a nearby root. The separation instance is x^2-2 together with the rational-root candidates plus or minus 1 and plus or minus 2. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--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-ch12-09--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0 mismatches between solvability of the trigonometric history equation and die-out, out of 128 instances (n = 128, exact). Interpretation: NKS pp. 731-732 says that real solutions of pure polynomial equations stay within ordinary discrete computation, while allowing trigonometric functions makes it possible to write an equation whose solvability is equivalent to the outcome of an unbounded cellular-automaton evolution. The note on p. 1137 records the mechanism used here: an algebraic expression together with factors sin(pi*x_i) vanishes at a real point exactly when an integer (Diophantine) condition holds. The test uses a cyclic width-5 line so that 'ever reaches zero' is an unbounded-t question with a finite certificate, not a claim about organisms. Rule 110's truth table is the standard one, output 01101110 in Wolfram order. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-09: supports, confidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--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-ch12-09/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--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-ch12-09--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Patterns generated by the committed truth table of elementary rules 0, 90, 110 and 204 on a cyclic line of 5 cells. Polynomials are the full coefficient box stated above, generated in the script, not downloaded. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation An initial condition whose die-out behaviour disagrees with solvability of the trigonometric equation, or an integer root of x^2-2, which would remove the contrast between polynomial solvability and the trigonometric constraint. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/evidenceAgainst A computation shows the mathematics, not that organisms follow it. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/evidenceAgainst On this ring, rule 110 reached zero from all 32 initial states and rule 90 from 2 of 32. Those are counts for width 5, not a statement about the infinite line. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The cellular automaton is a cyclic line of 5 cells. 'Ever hits zero' is an unbounded-time question with a 32-state certificate; it is a finite-state stand-in for the unbounded evolution named in the claim. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The polynomial half is the univariate class of degree at most 4 with coefficients in {-1,0,1}, decided by Sturm's theorem. Multivariate polynomial equations were not enumerated. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The sine constraint is the algebraic identity sin(pi*n)=0 for integer n. The largest absolute value of math.sin(pi*n) for n=0..1000 was 3.4493976816137795e-13, recorded as a float cross-check. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/expectedObservation The sine-augmented history equation is solvable exactly on the initial conditions that reach the zero configuration, the solved history matches direct evolution on all 128 instances, Sturm's theorem decides the pre-registered polynomial class with internal agreement, and x^2-2 is solvable over the reals but not under the sine integrality constraint. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. REFUTES if (A) fails on at least one instance while a second, array-based implementation of the same truth table agrees with the digit stepper (the equation then does not track the automaton). INCONCLUSIVE with reason 'other' if the two cellular-automaton implementations disagree, or if the Sturm count and the isolating-interval count disagree on any polynomial (the polynomial decision procedure is then not certified). The existential wording of the claim is not refuted by an implementation error; that outcome is inconclusive, not a refutation. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.9 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-09--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/hypothesis For every elementary rule in {0, 90, 110, 204} and every initial state of a cyclic width-5 line, the real equation formed by summing the squares of the exponential-Diophantine history residuals with sin(pi*t)^2 and sin(pi*H)^2 has a solution if and only if the cellular automaton reaches the all-zero configuration in finitely many steps, and the integer solution's base-32 digits are that history; a pure polynomial equation does not impose the same integrality constraint. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/inferenceMethod Exhaustive comparison of solvability against simulated die-out, closed by the 32-state pigeonhole. Polynomial decidability is Sturm's sign-count checked against exact bisection. One disagreement in (A) refutes; a disagreement inside the polynomial checker is inconclusive. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Cyclic elementary cellular automata, width w=5, B=32, rules 0, 90, 110 and 204 (Wolfram numbering), all 32 initial integers c. Direct evolution uses the 8-neighborhood truth table. The history integer of a run that first hits 0 at time t is H = sum_{k=0}^{t} r_k * B^k, with r_0=c, r_t=0 and r_k nonzero for k<t. The residuals, all required to be zero, are: H mod B - c; the base-B digits of H through t disagreeing with the truth-table step; the leading digit being nonzero when it should be the final zero row; and, for the trigonometric constraint, t and H not integers. sin(pi*n)=0 for integer n is the algebraic identity (e^{i*pi*n}=(-1)^n), cross-checked by math.sin on n=0..1000. Because the ring has 32 states, a configuration that has not hit 0 within 32 steps is on a cycle that never hits 0, so there is no solution at any larger t. PASS (supports) if (A) for all 128 instances, a real solution of the trigonometric equation exists exactly when the automaton hits 0, and every such solution with t<=32 decodes to the simulated first-hit history (0 mismatches); (B) Sturm's theorem and exact rational bisection agree on the number of distinct real roots of every univariate polynomial of degree at most 4 with coefficients in {-1,0,1} (243 polynomials, including those of lower degree); (C) the separation instance holds: x^2-2=0 has two real roots and no integer root (rational-root candidates ±1, ±2 all fail), so sin(pi*x)^2+(x^2-2)^2=0 has no real solution while (x^2-2)^2=0 does. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch12-09 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-09--claim-test--dataset-1 http://purl.org/dc/terms/description the automaton histories and the polynomial class named in the pass criterion https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-09--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-09--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-ch12-09--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Cyclic elementary rules 0, 90, 110 and 204 on width 5, all 32 initial states, plus the 243 univariate polynomials of degree at most 4 with coefficients in {-1,0,1} https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-09--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p731--the-validity-of-the-principle/ https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/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-nks-ch12-31-to-ch11-12-bd47) 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/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch12-09/result.json https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/test https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/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/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/plan https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/pubinfo https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://purl.org/dc/terms/created 2026-11-08T16:24:31.942Z https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-09--claim-test https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-09: supports, confidence 0.9 https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/sig http://purl.org/nanopub/x/hasSignature s2znXydvpANnDTJhjIV18hgleA/lRN91sb9ZYDtcV0jwDfQRZRBO/NNPsuuE1Q6MT9sB8e1tbdH3zDnKQ5kS2FDp/bppNiiFKYH9zrnTufe4Fr3CTmm8hl/NNuSGa9fPDoaR5caqbSccbDWITGslZFyzA3pHaq1QFBG/H9U3qG8DBIBsiEUIkVpng4x/a2HXWsNjZG2e9fQFQ2kG4hh0ui0vYTtwPEQvDhOO58wRULOW+g/eN6NDXrEv4cDygfCCCS8Ds1t1DQJMTGPnRS5ZqYpfc0OqdbMxLEkd5B5FiWR3//tXif1udnYYtpLNHzO9L8dFspm66kgQG6p4cGRkWA== https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI https://w3id.org/np/RAqx7Mnz3ydGmS2WlhLNYclSLVyXMnz0kx3TpU2Raa1rI/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192