Post #2712423
2026-04-27 15:46 UTC
@esap@noc.social
Hm, OK. I'm not sure we need to know this for most programming situations, though with my math hat on it always seemed quite interesting. Thanks!
Replies (1)
-
@esap@noc.social 2026-04-27 18:18
@RonJeffries@mastodon.social I don't intend to say I'd claim this solves P=NP, this is more complicated unsolved problem. This is because complexity classes have complicated structure and it links with the abstraction on concurrency and parallelism. OTOH, decision problems have a fairly clear notion of verification that has been linked with the problem. And P = NP would immediately imply the password verification problem could be inverted too easily (breaking most cryptography using sophisticated guesses).