arXiv (All)
open access
On the Turing Completeness of Transformers and Agents
Transformers have emerged as the dominant architecture in sequence modeling, achieving remarkable success in natural language processing and reasoning tasks. While existing literature has established the Turing completeness of transformers under bounded input length, the reasoning power of a single
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
- The Grammar of Transformers: A Systematic Review of Interpretability Research on Syntactic Knowledge in Language Models#798745
- The Grammar of Transformers: A Systematic Review of Interpretability Research on Syntactic Knowledge in Language Models#797331
- Bringing order into the realm of Transformer-based language models for artificial intelligence and law#964326
- Book review D'Agostino et al.: Depth-Bounded Reasoning. Volume I: Classical Propositional Logic: College Publications, 2024, xvii + 225. ISBN 978-1-84890-442-2#111830
Record · ID 1034099
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive