Sunday, September 19, 2004

P ?= NP

This post will only appeal to a limited audience; if you aren't in CS you probably have no idea what it means.

If you could choose to prove either that P = NP or that P ≠ NP, which would you pick? I'm not asking which you believe; you can decide mathematical truth here. Given that you have the ability to prove either, which one would you rather prove?

Remember to leave your name along with comments.

1 comment:

Jeff Erickson said...

I'd much rather prove that P=NP, simply because that would be more perverse. Even better, I'd love to prove that NTIME(f(n)) ⊆ TIME(f(n)^100) but NTIME(f(n)) ⊈ TIME(f(n)^50). That would be both perverse and useless!