{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PNFB22GO2ZL46PNN3CGTLCB7BF","short_pith_number":"pith:PNFB22GO","schema_version":"1.0","canonical_sha256":"7b4a1d68ced657cf3dadd88d35883f0958a0ad6d7661c3e83de30114d480c8ec","source":{"kind":"arxiv","id":"2411.01992","version":3},"attestation_state":"computed","paper":{"title":"Ask, and it shall be given: On the Turing completeness of prompting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Hanghang Tong, Ruizhong Qiu, Wenxuan Bao, Zhe Xu","submitted_at":"2024-11-04T11:26:38Z","abstract_excerpt":"Since the success of GPT, large language models (LLMs) have been revolutionizing machine learning and have initiated the so-called LLM prompting paradigm. In the era of LLMs, people train a single general-purpose LLM and provide the LLM with different prompts to perform different tasks. However, such empirical success largely lacks theoretical understanding. Here, we present the first theoretical study on the LLM prompting paradigm to the best of our knowledge. In this work, we show that prompting is in fact Turing-complete: there exists a finite-size Transformer such that for any computable f"},"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":"2411.01992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-04T11:26:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"17fc79bdd28ddad4501217bac09b313dea6475886dfdcfe6a4dcc2c3aa6dfe68","abstract_canon_sha256":"5d68a5c52cc37d67766e7113fa1ed64efd395ee03448874536c5ff9ec3db8170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:51.410062Z","signature_b64":"TL21wIjNyFOpa6AFGxLlQN07PqjruCwnvQYNabZyTtzu8rdz7dCG1VKV1xEjUAqZSgByD9R4E4DZrqHcRa9UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b4a1d68ced657cf3dadd88d35883f0958a0ad6d7661c3e83de30114d480c8ec","last_reissued_at":"2026-07-05T10:17:51.409626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:51.409626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ask, and it shall be given: On the Turing completeness of prompting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Hanghang Tong, Ruizhong Qiu, Wenxuan Bao, Zhe Xu","submitted_at":"2024-11-04T11:26:38Z","abstract_excerpt":"Since the success of GPT, large language models (LLMs) have been revolutionizing machine learning and have initiated the so-called LLM prompting paradigm. In the era of LLMs, people train a single general-purpose LLM and provide the LLM with different prompts to perform different tasks. However, such empirical success largely lacks theoretical understanding. Here, we present the first theoretical study on the LLM prompting paradigm to the best of our knowledge. In this work, we show that prompting is in fact Turing-complete: there exists a finite-size Transformer such that for any computable f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01992","kind":"arxiv","version":3},"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/2411.01992/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":"2411.01992","created_at":"2026-07-05T10:17:51.409678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01992v3","created_at":"2026-07-05T10:17:51.409678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01992","created_at":"2026-07-05T10:17:51.409678+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNFB22GO2ZL4","created_at":"2026-07-05T10:17:51.409678+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNFB22GO2ZL46PNN","created_at":"2026-07-05T10:17:51.409678+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNFB22GO","created_at":"2026-07-05T10:17:51.409678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01532","citing_title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF","json":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF.json","graph_json":"https://pith.science/api/pith-number/PNFB22GO2ZL46PNN3CGTLCB7BF/graph.json","events_json":"https://pith.science/api/pith-number/PNFB22GO2ZL46PNN3CGTLCB7BF/events.json","paper":"https://pith.science/paper/PNFB22GO"},"agent_actions":{"view_html":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF","download_json":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF.json","view_paper":"https://pith.science/paper/PNFB22GO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01992&json=true","fetch_graph":"https://pith.science/api/pith-number/PNFB22GO2ZL46PNN3CGTLCB7BF/graph.json","fetch_events":"https://pith.science/api/pith-number/PNFB22GO2ZL46PNN3CGTLCB7BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF/action/storage_attestation","attest_author":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF/action/author_attestation","sign_citation":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF/action/citation_signature","submit_replication":"https://pith.science/pith/PNFB22GO2ZL46PNN3CGTLCB7BF/action/replication_record"}},"created_at":"2026-07-05T10:17:51.409678+00:00","updated_at":"2026-07-05T10:17:51.409678+00:00"}