∈P is true, and provable in a simply consistent extension B′ of a first order theory B of computing, with a single finite axiomB characterizing a universal Turing machine. Therefore P !=NP is true, and
provable in a simply consistent extension B′′ of B.
How can something be "new" and "improved"? if it's new, what was it improving on?
when i sleep . loolz.
how much you love this community? (?%)
Last edited by GamerDn; 07-21-2009 at 11:33 PM.
I'm new here, but for this time i already love this community at 93%Originally Posted by GamerDn
^
you should make a question.
comedy
have you ever cheated?
No way... I'm not stupid... Cheaters and traders already cause me some troubles...
What do you think about public trackers?
no i don't
do you have drinking problems??!
A.) Nope! I've not drank for years. Never feel like it. Coke is my addiction! :(
Q.) What's the highest point on Earth you've been to?
The top of my roof.
Have you ever ridden a camel?
yes i have
how many countries have you visited?
Posting Permissions
LinkBack URL
About LinkBacks
