LAX launches: natural math language meets Lean, already formalizes NL=coNL
fortnow · x · 2026-09-17
LAX launched today as a way to connect natural mathematical language with Lean. It provides machinery for defining complexity classes and has formalized results such as the Immerman–Szelepcsényi theorem (NL=coNL), proven by inductive counting on finite configuration graphs, constructing a nondeterministic Turing machine that generates paths and census witnesses sequentially, halts on every branch, and uses logarithmic space. The archived entry was formalized by Édouard Bonnet using Codex 5.6 and 6, built on Lean v4.33.0 and mathlib, with a concept map, proof network, and community review via ORCID.
More from Research
- AISTATS 2027 opens submissions with AI review as a first-time feature — qberthet · 2026-09-18
- New claim: model architecture can improve scaling exponents — madhavsinghal_ · 2026-09-18
- Schmidhuber Revives 2020 RSI Talk, Says His Systems Learned Self-Improvement Since 1994 — SchmidhuberAI · 2026-09-18
- Polymarket puts 57% odds on AI solving the Hodge Conjecture — Polymarket · 2026-09-18
- MetaMedium experiment: sketching as an AI interface where the canvas reads what you draw — anselm · 2026-09-18
- Q-Planning: frozen BC policy plus small Q-function enables robot self-improvement — animesh_garg · 2026-09-18