4 ms·
isn't the halting problem a non-computable phenomenon? Is P=NP computable? I would imagine there's something interesting around computing quantum phenomenon t
by sharemywin 4y ago
isn't the halting problem a non-computable phenomenon?
Is P=NP computable?
I would imagine there's something interesting around computing quantum phenomenon to precision since it's not measurable?
I don't really know anything other the high level about those but I would love to hear how they fit into the picture
- akasakahakada 4y agoHalting peoblem only proved that "not all program can detect infinite loop". But as you see a while True loop without break, you immediately know that this program will never end. You know halting problem is not a problem at all with the right tool.