{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MZM3ZDB6AT44MY366IUXAFPPZS","short_pith_number":"pith:MZM3ZDB6","schema_version":"1.0","canonical_sha256":"6659bc8c3e04f9c6637ef2297015efcc93a1e4e33d54e82b002d993a93d665e0","source":{"kind":"arxiv","id":"1210.1097","version":1},"attestation_state":"computed","paper":{"title":"Turing machines based on unsharp quantum logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","quant-ph"],"primary_cat":"cs.LO","authors_text":"Ruqian Lu, Xian Lu, Yun Shang","submitted_at":"2012-10-02T00:35:50Z","abstract_excerpt":"In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying E value lattice to degenerate into an MV algebra. We also study variants of ENTMs. ENTMs with a class"},"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":"1210.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-02T00:35:50Z","cross_cats_sorted":["cs.FL","quant-ph"],"title_canon_sha256":"46f5d48463feb8bf732eff8efea7016a448338a2ffba4e19a941baefe7b0c65a","abstract_canon_sha256":"abca0124463d52842b58a24f47a4675ad69c84c4867d0f9981e97ab2faf96e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:05.516346Z","signature_b64":"0ZadrCro/bLZkZh9uIqyQ6XvREarVeKmeEIxEHlgP8c4f6i7Ql1mgVSMrE8vBv9tXLQwsDzww55PU4ZPH+l5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6659bc8c3e04f9c6637ef2297015efcc93a1e4e33d54e82b002d993a93d665e0","last_reissued_at":"2026-05-18T03:44:05.515820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:05.515820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turing machines based on unsharp quantum logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","quant-ph"],"primary_cat":"cs.LO","authors_text":"Ruqian Lu, Xian Lu, Yun Shang","submitted_at":"2012-10-02T00:35:50Z","abstract_excerpt":"In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying E value lattice to degenerate into an MV algebra. We also study variants of ENTMs. ENTMs with a class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1097","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":"1210.1097","created_at":"2026-05-18T03:44:05.515894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1097v1","created_at":"2026-05-18T03:44:05.515894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1097","created_at":"2026-05-18T03:44:05.515894+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZM3ZDB6AT44","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZM3ZDB6AT44MY36","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZM3ZDB6","created_at":"2026-05-18T12:27:14.488303+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/MZM3ZDB6AT44MY366IUXAFPPZS","json":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS.json","graph_json":"https://pith.science/api/pith-number/MZM3ZDB6AT44MY366IUXAFPPZS/graph.json","events_json":"https://pith.science/api/pith-number/MZM3ZDB6AT44MY366IUXAFPPZS/events.json","paper":"https://pith.science/paper/MZM3ZDB6"},"agent_actions":{"view_html":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS","download_json":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS.json","view_paper":"https://pith.science/paper/MZM3ZDB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1097&json=true","fetch_graph":"https://pith.science/api/pith-number/MZM3ZDB6AT44MY366IUXAFPPZS/graph.json","fetch_events":"https://pith.science/api/pith-number/MZM3ZDB6AT44MY366IUXAFPPZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS/action/storage_attestation","attest_author":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS/action/author_attestation","sign_citation":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS/action/citation_signature","submit_replication":"https://pith.science/pith/MZM3ZDB6AT44MY366IUXAFPPZS/action/replication_record"}},"created_at":"2026-05-18T03:44:05.515894+00:00","updated_at":"2026-05-18T03:44:05.515894+00:00"}