News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by anyfoo on Monday July 19, 2021 @06:43PM (#27888136)
Correct me if I'm wrong: So n is actually the size of the hash. That's indeed exponential if you try to brute force it, but a non-deterministic automaton would still give the answer immediately.
Re:A proof P = NP was accidentally published in TOCT by freemint on Tuesday July 20, 2021 @06:18AM (#27891931)
A non-deterministic automata can you give an answer after n steps which is polynomial.

NP is the class of problems that can be solved in polynomial time by a non-deterministic automaton.

Re:A proof P = NP was accidentally published in TOCT by anyfoo on Tuesday July 20, 2021 @02:38PM (#27897494)
That much was clear, and I believe also implied in my answers?
Re:A proof P = NP was accidentally published in TOCT by freemint on Tuesday July 20, 2021 @04:59PM (#27899250)
If what I said was your mental state then you are not wrong.