News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by mikewarot on Monday July 19, 2021 @08:18PM (#27888798)
While we're at it... the halting problem CAN be solved, for a computer with N bits of state, in a time proportional to 2^N.

It remains unsolvable for Turing machines, however. 8-)

There are no comments on this comment yet.