OpenAI research collection · 1 manuscript · Source checked 2026-10-19
Proves \mathsf L=\mathsf{RL}=\mathsf{BPL}, resolving derandomization for bounded-error logarithmic-space computation. An effective compiler converts each randomized polynomial-time logarithmic-space machine deciding a language with one-sided or two-sided error into a deterministic logarithmic-space decider with explicit polynomial running-time bounds.
Short excerpts below come from OpenAI's abstracts. The full abstract and original PDF preserve the paper's precise scope.
We prove \mathsf L=\mathsf{RL}=\mathsf{BPL}, resolving the derandomization problem for polynomial-time randomized logarithmic space.
This PDF is listed in OpenAI's formalization catalogue. See the scope and dependencies before interpreting coverage.
New mathematical reasoning could help AI tackle harder scientific and computational problems. How reliably these skills transfer beyond mathematics will determine how much they contribute to general intelligence.
Explore the AGI Clock ↗