Kairos@lemmy.today to Ask Lemmy@lemmy.world · edit-214 hours agoIf you could ask one question and be guaranteed the correct answer, what would you ask?message-squaremessage-square108linkfedilinkarrow-up134arrow-down11
arrow-up133arrow-down1message-squareIf you could ask one question and be guaranteed the correct answer, what would you ask?Kairos@lemmy.today to Ask Lemmy@lemmy.world · edit-214 hours agomessage-square108linkfedilink
minus-squareKairos@lemmy.todayOPlinkfedilinkarrow-up5·11 hours agoYou have to ask for the proof otherwise noone will believe you
minus-squarechunes@lemmy.worldlinkfedilinkarrow-up4·10 hours agoI imagine getting a yes answer would be enough to cause quite a bit of chaos lol. it would almost be more fun watching people squirm to figure it out. Also, if the answer is guaranteed to be correct, it would be silly to not believe it…
minus-squareKairos@lemmy.todayOPlinkfedilinkarrow-up1·10 hours agoI don’t usually see people considering the possibility that P = NP but it is a large polynomial conversion. If it’s x^64 or something then a 256 bit AES key would baloon to 2^(8*64) = 2^(512) which is still massive.
Does P = NP?
You have to ask for the proof otherwise noone will believe you
I imagine getting a yes answer would be enough to cause quite a bit of chaos lol. it would almost be more fun watching people squirm to figure it out.
Also, if the answer is guaranteed to be correct, it would be silly to not believe it…
I don’t usually see people considering the possibility that P = NP but it is a large polynomial conversion. If it’s x^64 or something then a 256 bit AES key would baloon to 2^(8*64) = 2^(512) which is still massive.