Hacker News new | ask | show | jobs
by zornthewise 3785 days ago
Well, P/NP really has almost no bearing on this problem. That is a theoretical problem and even if P=NP, the algorithm could have a ginormous constant or degree. Conversely even if P=/=NP, the problem might be very easy to solve at human timescales with advanced enough algorithms/processing speed.
1 comments

P/NP has direct bearing on (a) how easy it is for an AI entity to HACK ALL THE INTERNETS that are accessible to it but protected with (NP) cryptography and stuff, and (b) how easy it is for an AI entity to design the next generation of itself in advance of this SINGULARITY APOCALYPSE I keep hearing about (and designing a better computer is probably a problem in NP as well, to say nothing of manufacturing concerns).