[
    {
        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/pubinfo",
        "@graph": [
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M",
                "http://purl.org/dc/terms/created": [
                    {
                        "@value": "2026-11-08T16:24:31.938Z",
                        "@type": "http://www.w3.org/2001/XMLSchema#dateTime"
                    }
                ],
                "http://purl.org/dc/terms/creator": [
                    {
                        "@id": "https://orcid.org/0009-0007-4948-9192"
                    }
                ],
                "http://purl.org/dc/terms/license": [
                    {
                        "@id": "https://creativecommons.org/licenses/by/4.0/"
                    }
                ],
                "http://purl.org/nanopub/x/hasNanopubType": [
                    {
                        "@id": "https://w3id.org/delphi/ontology/Assessment"
                    }
                ],
                "http://purl.org/nanopub/x/introduces": [
                    {
                        "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-13--claim-test"
                    }
                ],
                "http://www.w3.org/2000/01/rdf-schema#label": [
                    {
                        "@value": "Claim test of wolfram2002-ch11-13: supports, confidence 0.9"
                    }
                ],
                "https://w3id.org/delphi/ontology/domain": [
                    {
                        "@id": "https://w3id.org/delphi/resource/domain/wolfram-nks-2002"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/sig",
                "http://purl.org/nanopub/x/hasAlgorithm": [
                    {
                        "@value": "RSA"
                    }
                ],
                "http://purl.org/nanopub/x/hasPublicKey": [
                    {
                        "@value": "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB"
                    }
                ],
                "http://purl.org/nanopub/x/hasSignature": [
                    {
                        "@value": "sWXuWTwqIr0EsfF1TdNiXU6ST/r02A6M2SZzwE0kSuJKSclhatPzrmUn1rXIcyftxSClIjIkCrbiwv75Er5kg7x/jTBL9120NdUhwatSI+kftAqVYQvqwIBXAXodDtuhiw5hKkO1F17kxylRyLiSSHmr4vRQ1Ty8tMU9tBU5pl9lSF+KQ+cefvHHnZ1PXTfVCK9Yhj04Gix1MmhKUdoDhvfc60vmbrjfZ1o0bYzAFunOW1XCWAxr2EkPTqUL56NlRLuogHlZOApoEvmWXbn5Ss9ESuFlQoIHujCzMq407jajs17mAek1u1JJt4o8pYlhxk+ivWDKihl3qyWpYomYwQ=="
                    }
                ],
                "http://purl.org/nanopub/x/hasSignatureTarget": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M"
                    }
                ],
                "http://purl.org/nanopub/x/signedBy": [
                    {
                        "@id": "https://orcid.org/0009-0007-4948-9192"
                    }
                ]
            }
        ]
    },
    {
        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/assertion",
        "@graph": [
            {
                "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-13--claim-test",
                "http://purl.org/dc/terms/description": [
                    {
                        "@value": "analysis.py lists all 16 affine coefficient tuples and the 256 elementary rules. The Turing machine is simulated on every rule table and every neighborhood. Its transition table contains three extra states; a breadth-first enumeration from the start state is used to see whether any transition enters them. The head-carrying cellular automaton is updated by the radius-1 rule that applies the same transition, and its output cell is read after it halts. Realized sets are compared as sets of Wolfram codes. Rules 90 (left XOR right) and 110 (table 01101110) are checked before the comparison."
                    }
                ],
                "@type": [
                    "https://w3id.org/delphi/ontology/Assessment"
                ],
                "http://www.w3.org/2000/01/rdf-schema#comment": [
                    {
                        "@value": "Measured: 0 functions in the symmetric difference between the elementary rules and each of the other realized sets (each set has size 256) (n = 256, exact). Interpretation: NKS p. 675 says that once a system passes the threshold of universality, the set of computations it can perform does not grow when the underlying rules become more sophisticated, and does not depend on whether the system is a cellular automaton or a Turing machine. The test reads 'computation' as a boolean function of 3 bits, a finite class that is full exactly when every elementary rule can be realized. Extra unreachable states are the 'more sophisticated' variant. This does not prove the Church-Turing thesis for unbounded inputs, and it does not say that a larger neighborhood is useless for functions of more than 3 bits. A computation shows the mathematics of these models, not that organisms follow it."
                    }
                ],
                "http://www.w3.org/2000/01/rdf-schema#label": [
                    {
                        "@value": "Claim test of wolfram2002-ch11-13: supports, confidence 0.9"
                    }
                ],
                "http://www.w3.org/2000/01/rdf-schema#seeAlso": [
                    {
                        "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-13/result.json"
                    }
                ],
                "http://www.w3.org/ns/prov#wasAttributedTo": [
                    {
                        "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7"
                    }
                ],
                "https://w3id.org/delphi/ontology/admissibleDatasets": [
                    {
                        "@value": "Functions and simulations generated by the committed script from the Wolfram elementary-rule numbering. No external dataset."
                    }
                ],
                "https://w3id.org/delphi/ontology/assessmentType": [
                    {
                        "@value": "claim-test/0.1.0"
                    }
                ],
                "https://w3id.org/delphi/ontology/dataKind": [
                    {
                        "@value": "computational"
                    }
                ],
                "https://w3id.org/delphi/ontology/disconfirmingObservation": [
                    {
                        "@value": "The enlarged machine realizes a different set from the smaller universal one, or a system that can encode an arbitrary 3-bit table still misses some function, or the affine class is not strictly smaller."
                    }
                ],
                "https://w3id.org/delphi/ontology/evidenceAgainst": [
                    {
                        "@value": "A computation shows the mathematics, not that organisms follow it."
                    },
                    {
                        "@value": "The class of computations is the 256 boolean functions of 3 bits. The run shows that, inside this class, the elementary rules, the Turing-machine table interpreter, the same table with three unreachable states, and the head-carrying cellular automaton realize the same set, while the 16 affine mod-2 rules are a proper subset."
                    },
                    {
                        "@value": "This is a finite proxy. It does not prove the Church-Turing thesis for unbounded inputs, and it does not say that a larger neighborhood is useless for functions of more than 3 bits."
                    },
                    {
                        "@value": "Three extra states sit in the transition table and were not entered from the start state (0 of the 102 reachable states). Adding them did not change the set of functions."
                    }
                ],
                "https://w3id.org/delphi/ontology/expectedObservation": [
                    {
                        "@value": "Affine mod-2 rules realize 16 of the 256 three-bit boolean functions; the full elementary rules, a Turing-machine rule-table interpreter, the same machine with three unreachable states, and a cellular automaton that emulates that machine each realize exactly those 256 functions."
                    }
                ],
                "https://w3id.org/delphi/ontology/failCriterion": [
                    {
                        "@value": "Pre-registered. REFUTES if |A| is not 16, or A is not a subset of C, or any of the systems (1)-(3) or the head automaton realizes fewer than 256 functions or a function outside C, or any pair of those realized sets differs. INCONCLUSIVE with reason 'other' if the direct truth-table evaluation of rules 90 and 110 disagrees with their known outputs (90 is left XOR right; 110 is the standard 01101110 table), because the comparator would then be untrustworthy."
                    }
                ],
                "https://w3id.org/delphi/ontology/hasConfidence": [
                    {
                        "@value": "0.9",
                        "@type": "http://www.w3.org/2001/XMLSchema#double"
                    }
                ],
                "https://w3id.org/delphi/ontology/hasEvidence": [
                    {
                        "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-13--claim-test--dataset-1"
                    }
                ],
                "https://w3id.org/delphi/ontology/hasVerdict": [
                    {
                        "@value": "supports"
                    }
                ],
                "https://w3id.org/delphi/ontology/hypothesis": [
                    {
                        "@value": "Once a system can realize every boolean function of 3 bits, giving it extra states or a second implementation does not enlarge that set of functions, while a system restricted to affine mod-2 rules realizes a strictly smaller set."
                    }
                ],
                "https://w3id.org/delphi/ontology/inferenceMethod": [
                    {
                        "@value": "Exact enumeration of realized truth tables. Equality of sets is equality of the 256-bit characteristic vectors. The thresholds are the exact sizes 16 and 256."
                    }
                ],
                "https://w3id.org/delphi/ontology/passCriterion": [
                    {
                        "@value": "Pre-registered. The class C is the set of all functions {0,1}^3 -> {0,1}, which has 256 members, each identified with one elementary cellular-automaton rule by Wolfram numbering. Affine subclass A: functions f(p,q,r) = a0 + a1*p + a2*q + a3*r mod 2, so |A| must equal 16, and A is a proper subset of C. Three systems that have passed the threshold, each required to realize all of C and no function outside C: (1) the set of all 256 elementary rules, each rule a one-step map; (2) a single Turing machine whose finite control evaluates a rule table written on the tape, run on all 256 tables and all 8 neighborhoods; (3) the same machine with three extra states that no transition enters. A head-on-tape cellular automaton that emulates machine (2) must realize the same set. PASS (supports) if |A|=16, the three realized sets and the head-automaton set are equal to each other and to C, and the symmetric difference of each pair among them is empty."
                    }
                ],
                "https://w3id.org/delphi/ontology/preregistered": [
                    {
                        "@value": "false",
                        "@type": "http://www.w3.org/2001/XMLSchema#boolean"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/delphi/resource/evidence/wolfram2002-ch11-13--claim-test--dataset-1",
                "http://purl.org/dc/terms/description": [
                    {
                        "@value": "the finite class of computations used as the threshold proxy"
                    }
                ],
                "http://purl.org/dc/terms/license": [
                    {
                        "@value": ""
                    }
                ],
                "@type": [
                    "https://w3id.org/delphi/ontology/EvidenceItem"
                ],
                "http://www.w3.org/2000/01/rdf-schema#label": [
                    {
                        "@value": "Dataset: All 256 boolean functions of 3 bits, realized by elementary rules, by one Turing machine, and by a head-carrying cellular automaton"
                    }
                ],
                "http://www.w3.org/ns/prov#wasDerivedFrom": [
                    {
                        "@id": "https://www.wolframscience.com/nks/p675--the-rule-110-cellular-automaton/"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/delphi/resource/claim/wolfram2002-ch11-13",
                "https://w3id.org/delphi/ontology/hasAssessment": [
                    {
                        "@id": "https://w3id.org/delphi/resource/assessment/wolfram2002-ch11-13--claim-test"
                    }
                ]
            }
        ]
    },
    {
        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/provenance",
        "@graph": [
            {
                "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7",
                "@type": [
                    "http://www.w3.org/ns/prov#SoftwareAgent"
                ],
                "http://www.w3.org/2000/01/rdf-schema#label": [
                    {
                        "@value": "delphisci claim tester (grok-4.7; cursor/wolfram-nks-ch12-31-to-ch11-12-bd47)"
                    }
                ],
                "http://www.w3.org/ns/prov#actedOnBehalfOf": [
                    {
                        "@id": "https://orcid.org/0009-0007-4948-9192"
                    }
                ],
                "https://w3id.org/delphi/ontology/usesModel": [
                    {
                        "@id": "https://w3id.org/delphi/resource/model/grok-4-7"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/delphi/resource/model/grok-4-7",
                "http://purl.org/dc/terms/identifier": [
                    {
                        "@value": "grok-4.7"
                    }
                ],
                "@type": [
                    "https://w3id.org/delphi/ontology/LanguageModel"
                ]
            },
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/assertion",
                "http://www.w3.org/ns/prov#wasAttributedTo": [
                    {
                        "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7"
                    }
                ],
                "http://www.w3.org/ns/prov#wasDerivedFrom": [
                    {
                        "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-13/result.json"
                    }
                ],
                "http://www.w3.org/ns/prov#wasGeneratedBy": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/test"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/test",
                "@type": [
                    "http://www.w3.org/ns/prov#Activity"
                ],
                "http://www.w3.org/ns/prov#qualifiedAssociation": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/plan"
                    }
                ],
                "http://www.w3.org/ns/prov#wasAssociatedWith": [
                    {
                        "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7"
                    }
                ]
            },
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/plan",
                "http://www.w3.org/ns/prov#hadPlan": [
                    {
                        "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md"
                    }
                ]
            }
        ]
    },
    {
        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/Head",
        "@graph": [
            {
                "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M",
                "http://www.nanopub.org/nschema#hasAssertion": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/assertion"
                    }
                ],
                "http://www.nanopub.org/nschema#hasProvenance": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/provenance"
                    }
                ],
                "http://www.nanopub.org/nschema#hasPublicationInfo": [
                    {
                        "@id": "https://w3id.org/np/RA0xjJ0ZbvHfURRMZdeK95-Rscsq-KLVF9Gz75LjkMT1M/pubinfo"
                    }
                ],
                "@type": [
                    "http://www.nanopub.org/nschema#Nanopublication"
                ]
            }
        ]
    }
]