arXiv · 2611.17690
Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs
Abstract
We show that read-$k$ Probabilistic Turing Machines with bounded space $S$ and running time $T$ can be simulated by read-once Probabilistic Turing Machines with error $\varepsilon$, running in space $ O(k^2 (S + \log (n+ T)) + \log (1/ε))$ and time $\frac{1}{\varepsilon} \cdot 2^{O\left(k^2\left(S+\log(n+T) \right)\right)}$. As a direct consequence we show that read-$k$ $\mathsf{BPL}$ is equal to $\mathsf{BPL}$, for any constant $k$. Recently OpenAI announced that $\mathsf{BPL} = \mathsf{L}$. If this is true then our result immediately implies that read-$k$ $\mathsf{BPL}$ is equal to $\mathsf{L}$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kuan Cheng, Shengtang Huang, Ruiyang Wu. 2026-11-16. Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs. https://searcharxiv.com/abs/2611.17690
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.