Lance Fortnow

@fortnow

Computational Complexity Theorist

Chicago

Lance Fortnow
@fortnow
Sep 14
I was only being semi-serious two months ago.
Lance Fortnow
@fortnow
Jul 11
Does it seem like we're seeing an acceleration in new theorems, especially in combinatorics. Some proved by AI, some assisted by AI, some inspired by AI and some by humans trying to prove what they can before AI takes over.
Lance Fortnow
@fortnow
Sep 14
Bill's take on all things AI and Math blog.computationalcomplexity.org/2026/09/math-a…
2
Lance Fortnow
@fortnow
Sep 11
A tenet of the theory of computing is the interchangeability between program and data. So if an ML system uses a persistent writable memory, it could reprogram itself, potentially enabling recursive self-improvement, especially if many agents share the same storage space.
4
Lance Fortnow
@fortnow
Sep 11
While P vs NP will remain out of the reach of AI, there are other complexity problems, like separating NP from L (log space) or BPP from NEXP, that might be more tractable and would still make an incredible splash.
12
Lance Fortnow
@fortnow
Sep 9
Both OpenAI and Alpöge-Buckmaster heavily leaned on Lean in their Navier-Stokes announcements. Is this a new requirement for publishing? blog.computationalcomplexity.org/2026/09/navier…
11