3 ms·
No, is not the only class of program. An easy example is to take any of the unsolved math problems (like the Goldbach conjeture) and write a program for it, if
by diegof79 6y ago
No, is not the only class of program. An easy example is to take any of the unsolved math problems (like the Goldbach conjeture) and write a program for it, if the program halts it proves the conjeture.
Can you tell if the program halts? You can’t without proving the conjeture.
- sudosysgen 6y agoWell, maybe you can actually prove the conjecture? So wouldn't you have to take an unsolvable math problem first? Also, a lot of problems are proven unsolvable because solving them would imply solving the halting problem, but hey.