跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17690 · v1

Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs

首次提交 2026-11-13 11:16
版本更新 2026-11-13 11:16
雷达观测 2026-11-17 04:57
arXiv ↗PDF ↗

摘要

We show that read-kk Probabilistic Turing Machines with bounded space SS and running time TT can be simulated by read-once Probabilistic Turing Machines with error ε\varepsilon, running in space O(k2(S+log⁡(n+T))+log⁡(1/ε)) O(k^2 (S + \log (n+ T)) + \log (1/ε)) and time 1ε⋅2O(k2(S+log⁡(n+T)))\frac{1}{\varepsilon} \cdot 2^{O\left(k^2\left(S+\log(n+T) \right)\right)}. As a direct consequence we show that read-kk BPL\mathsf{BPL} is equal to BPL\mathsf{BPL}, for any constant kk. Recently OpenAI announced that BPL=L\mathsf{BPL} = \mathsf{L}. If this is true then our result immediately implies that read-kk BPL\mathsf{BPL} is equal to L\mathsf{L}.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 11:16 · 最新观测版本

Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs

We show that read-kk Probabilistic Turing Machines with bounded space SS and running time TT can be simulated by read-once Probabilistic Turing Machines with error ε\varepsilon, running in space O(k2(S+log⁡(n+T))+log⁡(1/ε)) O(k^2 (S + \log (n+ T)) + \log (1/ε)) and time 1ε⋅2O(k2(S+log⁡(n+T)))\frac{1}{\varepsilon} \cdot 2^{O\left(k^2\left(S+\log(n+T) \right)\right)}. As a direct consequence we show that read-kk BPL\mathsf{BPL} is equal to BPL\mathsf{BPL}, for any constant kk. Recently OpenAI announced that BPL=L\mathsf{BPL} = \mathsf{L}. If this is true then our result immediately implies that read-kk BPL\mathsf{BPL} is equal to L\mathsf{L}.

查看此版本解读 →查看此版本原文 ↗