News for hackers. Stuff that matters.
Re:P = NP by taejo on Wednesday December 04, 2013 @07:08AM (#6846372)
Turing machines have may have infinite memory, but they can also only write one step per cell. So a polynomial-time TM can't use superpolynomial memory.

There are no comments on this comment yet.