Comment Re:What's Polynomial Time? (Score 1) 444
The halting problem isn't in NP (this was proved by Turing). Since P subset NP, the halting problem can't in P either.
% "Every morning, I get up and look through the 'Forbes' list of the richest people in America. If I'm not there, I go to work" -- Robert Orben
