Announcing: Slashdot Deals - Explore geek apps, games, gadgets and more. (what is this?)

Thank you!

We are sorry to see you leave - Beta is different and we value the time you took to try it out. Before you decide to go, please take a look at some value-adds for Beta and learn more about it. Thank you for reading Slashdot, and for making the site better!



Turns out, Primes are in P

DaveUIUC Re:What's Polynomial Time? (444 comments)

The halting problem isn't in NP (this was proved by Turing). Since P subset NP, the halting problem can't in P either.

more than 12 years ago


DaveUIUC hasn't submitted any stories.


DaveUIUC has no journal entries.

Slashdot Login

Need an Account?

Forgot your password?