Time Space Tradeoff in Turing Machines: How OpenAI’s Proof Reduces Simulation Memory

Time space tradeoff in Turing machines shown as a looping paper tape passing through one small reusable workspace.

A machine may spend a trillion steps changing its tape, yet a simulator need not remember every changed cell to recover its answer. OpenAI’s September 25, 2026 preprint advances the time space tradeoff in Turing machines: a fixed deterministic machine with one writable tape can be simulated using two-fifths-power space, up to polylogarithmic factors, when … Read more

Quadratic Sensitivity Conjecture: How OpenAI’s Proof Broke the Square Barrier

Quadratic sensitivity conjecture artwork: grouped tiles breaking a copper square barrier.

A square looked like a plausible ceiling. OpenAI’s September 25, 2026 paper constructs Boolean functions that break it: for every positive constant CC, some total function satisfies bs(f)>Cs(f)2\mathrm{bs}(f)>C\,s(f)^2. That disproves the quadratic sensitivity conjecture, while leaving Hao Huang’s 2019 polynomial Sensitivity Conjecture theorem intact. The construction combines separated Hamming balls, labelled tournaments, and recursive target-and-gate … Read more

Counting Perfect Matchings: How the OpenAI Proof Escapes the Exponential Sampling Trap

Counting perfect matchings shown as three paired sculptures escaping an ultramarine sampling trap.

A graph can reveal one perfect pairing quickly while concealing how many others exist. Counting perfect matchings asks for that hidden population, and arbitrary graphs have resisted a general randomized approximation guarantee for decades. OpenAI’s September 23, 2026 paper supplies a fully polynomial randomized approximation scheme, or FPRAS: an estimate with selectable relative accuracy and … Read more

Quantum Circuit Lower Bounds: How OpenAI Proved Parity Is Beyond QAC⁰

Quantum circuit lower bounds shown as a shallow ceramic loom beneath a global parity braid.

Adding four bits modulo two is easy. Proving that a powerful family of shallow quantum circuits cannot reliably do the same job took a much subtler argument. OpenAI’s September 24, 2026 paper establishes quantum circuit lower bounds excluding parity from QAC⁰, even with polynomially many workspace qubits, arbitrary discarded outputs, and any fixed positive worst-case … Read more

Existential Theory of the Reals: How OpenAI Proved a Counting Hierarchy Bound Without Building Giant Matrices

Existential Theory of the Reals artwork links vast implicit matrix architecture to a compact exact decision.

A matrix with 5n5^n rows is a peculiar starting point for avoiding enormous computations. OpenAI’s October 4, 2026 preprint does exactly that: it uses the matrix mathematically, then computes the information it needs without constructing it. The resulting Existential Theory of the Reals proof places exact polynomial feasibility in a fixed level of the counting … Read more

Maximum Cardinality Matching: How the OpenAI Proof Breaks the √n Barrier

Maximum cardinality matching illustrated with woven graph strands, paired pearls, and the full article title.

A greedy pairing can stop after one edge even when two fit. Finding the best pairing is easy to describe, yet odd cycles have made fast, exact solutions surprisingly difficult. OpenAI’s September 24, 2026 manuscript presents a maximum cardinality matching algorithm running in almost-linear time in the graph’s explicit input size, including the cost of … Read more

Quantum Query Complexity: The OpenAI Proof That Breaks the Cubic Conjecture

Quantum query complexity illustrated by a hidden certificate unlocked inside a fractured glass archive.

An algorithm can lose badly even when it may toss coins, adapt its questions, and perform unlimited computation between them. OpenAI’s October 5, 2026 preprint constructs precisely that situation: total Boolean functions where classical randomized algorithms need almost the fourth power of the quantum query count. The result concerns quantum query complexity, the number of … Read more