{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SEF76J6PF6JKHNSNRAV5KQNOQ7","short_pith_number":"pith:SEF76J6P","schema_version":"1.0","canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","source":{"kind":"arxiv","id":"1712.08702","version":2},"attestation_state":"computed","paper":{"title":"On the Universality of Memcomputing Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.NE","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra, Yan Ru Pei","submitted_at":"2017-12-23T02:30:25Z","abstract_excerpt":"Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs have been shown to be Turing-complete, namely they can simulate any Turing machine. In this paper, using set theory and cardinality arguments, we compare them with liquid-state machines (or \"reservoir computing\") and quantum machines (\"quantum computing\"). We show that UMMs can simulate both types of machines, hence they are both \"liquid-\" or \"reservoir-comp"},"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":"1712.08702","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8ea7f71517f4b849794c3a009fed1ef02468a88b2b31bb4e748d1789cfd76a0c","abstract_canon_sha256":"888513d9c651e0c63231f6068f8656bacc24fe7fab5418e0e72ef034f3257121"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:59.902776Z","signature_b64":"bzfkE72ox5y9xl37feZoxVSKRKlOpRtYRKsLQq7dWZZClHX77KQCDXyA5FRcPa5+LL3MDApfLpN637HrUz8sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","last_reissued_at":"2026-05-17T23:44:59.902169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:59.902169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Universality of Memcomputing Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.NE","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra, Yan Ru Pei","submitted_at":"2017-12-23T02:30:25Z","abstract_excerpt":"Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs have been shown to be Turing-complete, namely they can simulate any Turing machine. In this paper, using set theory and cardinality arguments, we compare them with liquid-state machines (or \"reservoir computing\") and quantum machines (\"quantum computing\"). We show that UMMs can simulate both types of machines, hence they are both \"liquid-\" or \"reservoir-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08702","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":"1712.08702","created_at":"2026-05-17T23:44:59.902290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08702v2","created_at":"2026-05-17T23:44:59.902290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08702","created_at":"2026-05-17T23:44:59.902290+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEF76J6PF6JK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEF76J6PF6JKHNSN","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEF76J6P","created_at":"2026-05-18T12:31:43.269735+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/SEF76J6PF6JKHNSNRAV5KQNOQ7","json":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7.json","graph_json":"https://pith.science/api/pith-number/SEF76J6PF6JKHNSNRAV5KQNOQ7/graph.json","events_json":"https://pith.science/api/pith-number/SEF76J6PF6JKHNSNRAV5KQNOQ7/events.json","paper":"https://pith.science/paper/SEF76J6P"},"agent_actions":{"view_html":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7","download_json":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7.json","view_paper":"https://pith.science/paper/SEF76J6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08702&json=true","fetch_graph":"https://pith.science/api/pith-number/SEF76J6PF6JKHNSNRAV5KQNOQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/SEF76J6PF6JKHNSNRAV5KQNOQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/action/storage_attestation","attest_author":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/action/author_attestation","sign_citation":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/action/citation_signature","submit_replication":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/action/replication_record"}},"created_at":"2026-05-17T23:44:59.902290+00:00","updated_at":"2026-05-17T23:44:59.902290+00:00"}