Scott Aaronson
Professor of computer science, UT Austin · as of 2026-10-04 · source
Quantum-complexity theorist who worked on AI safety at OpenAI (2022-2024) and credited GPT-5 with a key step in a 2025 proof.
News mentioning Scott Aaronson (2)
- Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help (July–September catalogue) ★★★★
Between July and September 2026 arXiv saw a steady stream of papers that resolve a named conjecture or open question and disclose that a frontier model (mostly GPT-5.6 Sol/Pro and GPT-6 Astra, also Claude Fable 5/5.1, Opus 5/5.5, Gemini) found the key idea, the counterexample or the whole proof…
- Scott Aaronson credits GPT-5 with a key step in a quantum complexity proof ★★★
In 'Limits to black-box amplification in QMA' (Aaronson and Witteveen, arXiv 2509.21131), GPT-5-Thinking suggested the key function Tr[(I−E(θ))^−1] used in the proof. Aaronson called it the first paper of his where a key technical step came from AI.
Mentions are matched automatically by name, so a few may be about a namesake. Last checked 2026-10-04. All people · corrections: contact@postcutoff.com