{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6SXZSY4VC376SD32LOJLL6D6XE","short_pith_number":"pith:6SXZSY4V","schema_version":"1.0","canonical_sha256":"f4af99639516ffe90f7a5b92b5f87eb91a8aefd1c2c98d2c458bec04fba30544","source":{"kind":"arxiv","id":"1302.1170","version":1},"attestation_state":"computed","paper":{"title":"Computability of the entropy of one-tape Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.DS","math.IT"],"primary_cat":"cs.FL","authors_text":"Emmanuel Jeandel (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-02-05T19:53:27Z","abstract_excerpt":"We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision $\\epsilon$. This is contrary to popular belief, as all dynamical properties are usually undecidable for Turing machines. The result is quite specific to one-tape Turing machines, as it is not true anymore for two-tape Turing machines by the results of Blondel et al., and uses the approach of crossing sequences introduced by Hennie."},"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":"1302.1170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-05T19:53:27Z","cross_cats_sorted":["cs.CC","cs.IT","math.DS","math.IT"],"title_canon_sha256":"f91ddb89824aaa1167713464d3f45a4b6952afc272aecbe770353287c4cde494","abstract_canon_sha256":"f6586830ede55f9da35472f9319da77ea52484f18f6c02eb9ec5c0c10a654e74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:26.016908Z","signature_b64":"/dotvXPaavmp45TAuNXcMPSIlThy8zwHUaR2H14BH8isbLbmsiNY0E7qJkMP5VtHWDd8XfUVye6/BYW/jjFzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4af99639516ffe90f7a5b92b5f87eb91a8aefd1c2c98d2c458bec04fba30544","last_reissued_at":"2026-05-18T03:34:26.016334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:26.016334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computability of the entropy of one-tape Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.DS","math.IT"],"primary_cat":"cs.FL","authors_text":"Emmanuel Jeandel (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-02-05T19:53:27Z","abstract_excerpt":"We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision $\\epsilon$. This is contrary to popular belief, as all dynamical properties are usually undecidable for Turing machines. The result is quite specific to one-tape Turing machines, as it is not true anymore for two-tape Turing machines by the results of Blondel et al., and uses the approach of crossing sequences introduced by Hennie."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1170","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":"1302.1170","created_at":"2026-05-18T03:34:26.016438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1170v1","created_at":"2026-05-18T03:34:26.016438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1170","created_at":"2026-05-18T03:34:26.016438+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SXZSY4VC376","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SXZSY4VC376SD32","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SXZSY4V","created_at":"2026-05-18T12:27:36.564083+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/6SXZSY4VC376SD32LOJLL6D6XE","json":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE.json","graph_json":"https://pith.science/api/pith-number/6SXZSY4VC376SD32LOJLL6D6XE/graph.json","events_json":"https://pith.science/api/pith-number/6SXZSY4VC376SD32LOJLL6D6XE/events.json","paper":"https://pith.science/paper/6SXZSY4V"},"agent_actions":{"view_html":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE","download_json":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE.json","view_paper":"https://pith.science/paper/6SXZSY4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1170&json=true","fetch_graph":"https://pith.science/api/pith-number/6SXZSY4VC376SD32LOJLL6D6XE/graph.json","fetch_events":"https://pith.science/api/pith-number/6SXZSY4VC376SD32LOJLL6D6XE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE/action/storage_attestation","attest_author":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE/action/author_attestation","sign_citation":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE/action/citation_signature","submit_replication":"https://pith.science/pith/6SXZSY4VC376SD32LOJLL6D6XE/action/replication_record"}},"created_at":"2026-05-18T03:34:26.016438+00:00","updated_at":"2026-05-18T03:34:26.016438+00:00"}