Southperry.net › Social › Rubik's Cube v
Paper claims to prove P != NP

Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Linear Mode
Paper claims to prove P != NP
Kortestanov
Posting Freak
*****
Posts: 950
Threads: 65
Joined: 2009-05
Gender: Transgender - F2M
Sexual Orientation: Bi
Country Flag: israel
IGN: ....|_|0|_|
Server: |_|_|0|
Job: .....|0|0|0|
#7
2010-08-16, 06:28 PM
Cactuar Wrote:It means every encryption can be solved in a determinable amount of time.
P doesn't mean determinable amount of time. P means the time complexity of the algorithm would be polynomial on any deterministic turing machine.
Website Find
Reply


Messages In This Thread
Paper claims to prove P != NP - by Spaz - 2010-08-14, 06:46 PM
Paper claims to prove P != NP - by Takebacker - 2010-08-14, 06:52 PM
Paper claims to prove P != NP - by Cactuar - 2010-08-14, 06:59 PM
Paper claims to prove P != NP - by Spaz - 2010-08-14, 07:02 PM
Paper claims to prove P != NP - by Cactuar - 2010-08-14, 07:05 PM
Paper claims to prove P != NP - by Noah - 2010-08-14, 07:15 PM
Paper claims to prove P != NP - by Kortestanov - 2010-08-16, 06:28 PM

Forum Jump:


Users browsing this thread: 1 Guest(s)