Loading activity…
@rrwilliams
Professor @MITEECS and @MIT_CSAIL. Complexity, algorithms, and related math. I'll let you know when P != NP (and when it's not)
AI
OpenAI says its claimed refutation of the Exponential Time Hypothesis was formalized in Lean and made public.
AI
One post argues that “essentially zero direct progress” on proving P ≠ NP leaves advanced AI little to build on, unless P = NP.
