arXiv (All)
open access
Accepting-Path Counting at the One-Tape $n\log n$ Threshold
We observe that the classical $n\log n$ time threshold for one-tape Turing machines is also a threshold for their accepting-path counts. Below it, every nondeterministic one-tape machine running in strong $o(n\log n)$ time has a rational ordinary generating function of accepting-path counts. At stro
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
- Quantum Dynamics of Full Counting Statistics in Fermionic Lattices with Localized Gain#1118797
- Some applications of binary numeration systems with nonzero redundancy to the theory of locally complex functions#1129004
- Store Languages of Turing Machines and Counter Machines#925807
- Disjoint crossings, positive speed and deviation estimates for first passage percolation#420276
- Retornando al Hotel de Hilbert#85571
Record · ID 1117671
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