{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SKFNARGPZSISZAXQXA43QK7HQZ","short_pith_number":"pith:SKFNARGP","schema_version":"1.0","canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","source":{"kind":"arxiv","id":"2301.04589","version":1},"attestation_state":"computed","paper":{"title":"Memory Augmented Large Language Models are Computationally Universal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CL","authors_text":"Dale Schuurmans","submitted_at":"2023-01-10T02:37:44Z","abstract_excerpt":"We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton, hence computationally limited. However, augmenting such models with a read-write memory creates the possibility of processing arbitrarily large inputs and, potentially, simulating any algorithm. We establish that an existing large language model, Flan-U-PaLM 540B, can be combined with an associative read-write memory to exactly simulate the execution of a univ"},"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":"2301.04589","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"86b3c92963c7637ea1a7695a655a9248d23dbc3ec6353a5a72615c4ba8532661","abstract_canon_sha256":"6d263cbe94b57dde7e6c9e6e0a54adb79cce0739a05b7b93a8dcdf7247e7f5e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:27.017402Z","signature_b64":"SoUap8qtYRIR2TLk0LRhL4C42Nx7LHFUdtlkpaxfNnzS0mcRTL4T4wrRr/JeIoIg49F4YhAIhiW9ZobNz6K3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","last_reissued_at":"2026-07-05T05:32:27.017065Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:27.017065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory Augmented Large Language Models are Computationally Universal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CL","authors_text":"Dale Schuurmans","submitted_at":"2023-01-10T02:37:44Z","abstract_excerpt":"We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton, hence computationally limited. However, augmenting such models with a read-write memory creates the possibility of processing arbitrarily large inputs and, potentially, simulating any algorithm. We establish that an existing large language model, Flan-U-PaLM 540B, can be combined with an associative read-write memory to exactly simulate the execution of a univ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04589","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.04589/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.04589","created_at":"2026-07-05T05:32:27.017118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.04589v1","created_at":"2026-07-05T05:32:27.017118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04589","created_at":"2026-07-05T05:32:27.017118+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKFNARGPZSIS","created_at":"2026-07-05T05:32:27.017118+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKFNARGPZSISZAXQ","created_at":"2026-07-05T05:32:27.017118+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKFNARGP","created_at":"2026-07-05T05:32:27.017118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19514","citing_title":"Position: The Turing-Completeness of Autoregressive Transformers Relies Heavily on Context Management","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19514","citing_title":"Position: The Turing-Completeness of Autoregressive Transformers Relies Heavily on Context Management","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2307.06435","citing_title":"A Comprehensive Overview of Large Language Models","ref_index":200,"is_internal_anchor":false},{"citing_arxiv_id":"2303.17491","citing_title":"Language Models can Solve Computer Tasks","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2308.11432","citing_title":"A Survey on Large Language Model based Autonomous Agents","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ","json":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ.json","graph_json":"https://pith.science/api/pith-number/SKFNARGPZSISZAXQXA43QK7HQZ/graph.json","events_json":"https://pith.science/api/pith-number/SKFNARGPZSISZAXQXA43QK7HQZ/events.json","paper":"https://pith.science/paper/SKFNARGP"},"agent_actions":{"view_html":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ","download_json":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ.json","view_paper":"https://pith.science/paper/SKFNARGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.04589&json=true","fetch_graph":"https://pith.science/api/pith-number/SKFNARGPZSISZAXQXA43QK7HQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SKFNARGPZSISZAXQXA43QK7HQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/action/storage_attestation","attest_author":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/action/author_attestation","sign_citation":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/action/citation_signature","submit_replication":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/action/replication_record"}},"created_at":"2026-07-05T05:32:27.017118+00:00","updated_at":"2026-07-05T05:32:27.017118+00:00"}