2226965 comment Comment Re:What's Polynomial Time? (Score 1) 444 by DaveUIUC on Wednesday August 07, 2002 @01:21PM (#4025988) Attached to: Turns out, Primes are in P The halting problem isn't in NP (this was proved by Turing). Since P subset NP, the halting problem can't in P either.
