arXiv (All)
open access
Store Languages of Turing Machines and Counter Machines
The store language of an automaton is the set of store configurations (state and store contents, but not the input) that can appear as an intermediate step in an accepting computation. A one-way nondeterministic finite-visit Turing machine (fvNTM) is a Turing machine with a one-way read-only input t
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
- Turing’s Wager?#699742
- Rethinking Turing’s Test and the Philosophical Implications#70875
- A Turing Machine for Exponential Function#747924
- Trained to Pass – _Autistic Masking and AI Alignment as Structurally Identical Forms of Enforced Self-Denial_#722074
- Non-Hermitian Foundations for Autopoietic Cognitive Architecture: Extending the Internal State Dynamics Model#83487
Record · ID 925807
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