{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YUGQCJ434KQ5OUGEVEO75B5EIT","short_pith_number":"pith:YUGQCJ43","schema_version":"1.0","canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","source":{"kind":"arxiv","id":"1612.07400","version":1},"attestation_state":"computed","paper":{"title":"The \"paradox\" of computability and a recursive relative version of the Busy Beaver function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Felipe S. Abrah\\~ao","submitted_at":"2016-12-22T00:28:59Z","abstract_excerpt":"In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function which we will call Busy Beaver Plus function. Therefore, we will prove that the computable Busy Beaver Plus function defined on any Turing submachine is not computable by any program running on this submachine. We will thereby demonstrate the existence of a \"paradox\" of computability a la Skolem: a function is computable when \"seen from the "},"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":"1612.07400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"a5e372637567b2c892d856ee007d4a8e535bad812a06b0b3cb8b66ee630c6382","abstract_canon_sha256":"d20ddcb814e7f832f689c20d407602f0036dc8512db6b084805412f0ce0598ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.105923Z","signature_b64":"BJp2sw40Ia/lmTOLqIXqUtAE7qb89qkgCbv/DF6Wagdny0o1TRUInE8Kyb8m/X39yZudr5rXAT/uIqC1ytdoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","last_reissued_at":"2026-05-18T00:54:10.105455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.105455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The \"paradox\" of computability and a recursive relative version of the Busy Beaver function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Felipe S. Abrah\\~ao","submitted_at":"2016-12-22T00:28:59Z","abstract_excerpt":"In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function which we will call Busy Beaver Plus function. Therefore, we will prove that the computable Busy Beaver Plus function defined on any Turing submachine is not computable by any program running on this submachine. We will thereby demonstrate the existence of a \"paradox\" of computability a la Skolem: a function is computable when \"seen from the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07400","kind":"arxiv","version":1},"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":"1612.07400","created_at":"2026-05-18T00:54:10.105544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07400v1","created_at":"2026-05-18T00:54:10.105544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07400","created_at":"2026-05-18T00:54:10.105544+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUGQCJ434KQ5","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUGQCJ434KQ5OUGE","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUGQCJ43","created_at":"2026-05-18T12:30:53.716459+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/YUGQCJ434KQ5OUGEVEO75B5EIT","json":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT.json","graph_json":"https://pith.science/api/pith-number/YUGQCJ434KQ5OUGEVEO75B5EIT/graph.json","events_json":"https://pith.science/api/pith-number/YUGQCJ434KQ5OUGEVEO75B5EIT/events.json","paper":"https://pith.science/paper/YUGQCJ43"},"agent_actions":{"view_html":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT","download_json":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT.json","view_paper":"https://pith.science/paper/YUGQCJ43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07400&json=true","fetch_graph":"https://pith.science/api/pith-number/YUGQCJ434KQ5OUGEVEO75B5EIT/graph.json","fetch_events":"https://pith.science/api/pith-number/YUGQCJ434KQ5OUGEVEO75B5EIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/action/storage_attestation","attest_author":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/action/author_attestation","sign_citation":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/action/citation_signature","submit_replication":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/action/replication_record"}},"created_at":"2026-05-18T00:54:10.105544+00:00","updated_at":"2026-05-18T00:54:10.105544+00:00"}