“I just thought I was losing my mind,” said Williams, a theoretical computer scientist at the Massachusetts Institute of Technology.
Ryan Williams proved that any algorithm can run in memory roughly the square root of its time budget. The last real progress on this question came in 1975. He assumed his own proof had a bug and set it aside. The new simulation is slower and has no practical use. It does not settle P versus PSPACE either.