{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4JASXLNNFYUDZL74R7WSO42SHT","short_pith_number":"pith:4JASXLNN","schema_version":"1.0","canonical_sha256":"e2412badad2e283caffc8fed2773523cf5723d97e47f599522f666adfb911d6f","source":{"kind":"arxiv","id":"1410.7103","version":2},"attestation_state":"computed","paper":{"title":"Confusion in the Church-Turing Thesis","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Barry Jay, Jose Vergara","submitted_at":"2014-10-27T00:38:47Z","abstract_excerpt":"The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is not equivalent to the Turing model. However, a modern combinatory calculus, the SF-calculus, can define equality of its closed normal forms, and so yields a model of computability that is equivalent to the Turing model. This has profound implications for programming language design."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.7103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2014-10-27T00:38:47Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"3066988f0a8334625461affab652db559757c3f2145bf89505b6ee6e9df708d9","abstract_canon_sha256":"71fe861b76cfcef4d3feba5397f117ebc9c2bfcbc924473ff1d86c2f2ba9d6e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:28.158707Z","signature_b64":"8zVM2CB0aYXbkrcMbQm0//h8BchJI3iJV/fFfdDsJYllAZsUNMO5c9fzhny8oOshUwIFLFFSYFRiIhA/Lsz2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2412badad2e283caffc8fed2773523cf5723d97e47f599522f666adfb911d6f","last_reissued_at":"2026-05-18T02:38:28.158074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:28.158074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Confusion in the Church-Turing Thesis","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Barry Jay, Jose Vergara","submitted_at":"2014-10-27T00:38:47Z","abstract_excerpt":"The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is not equivalent to the Turing model. However, a modern combinatory calculus, the SF-calculus, can define equality of its closed normal forms, and so yields a model of computability that is equivalent to the Turing model. This has profound implications for programming language design."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7103","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.7103","created_at":"2026-05-18T02:38:28.158178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7103v2","created_at":"2026-05-18T02:38:28.158178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7103","created_at":"2026-05-18T02:38:28.158178+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JASXLNNFYUD","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JASXLNNFYUDZL74","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JASXLNN","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT","json":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT.json","graph_json":"https://pith.science/api/pith-number/4JASXLNNFYUDZL74R7WSO42SHT/graph.json","events_json":"https://pith.science/api/pith-number/4JASXLNNFYUDZL74R7WSO42SHT/events.json","paper":"https://pith.science/paper/4JASXLNN"},"agent_actions":{"view_html":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT","download_json":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT.json","view_paper":"https://pith.science/paper/4JASXLNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7103&json=true","fetch_graph":"https://pith.science/api/pith-number/4JASXLNNFYUDZL74R7WSO42SHT/graph.json","fetch_events":"https://pith.science/api/pith-number/4JASXLNNFYUDZL74R7WSO42SHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT/action/storage_attestation","attest_author":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT/action/author_attestation","sign_citation":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT/action/citation_signature","submit_replication":"https://pith.science/pith/4JASXLNNFYUDZL74R7WSO42SHT/action/replication_record"}},"created_at":"2026-05-18T02:38:28.158178+00:00","updated_at":"2026-05-18T02:38:28.158178+00:00"}