3 ms·
A program that tries to find a solution to the Goldbach conjecture will eventually halt. Either it finds a solution or the numbers themselves become so large th
by bjourne 12y ago
A program that tries to find a solution to the Goldbach conjecture will eventually halt. Either it finds a solution or the numbers themselves become so large that they overflow the computers working memory. The halting problem I think is only interesting for Idealized Turing Machines. For real computers, the Second law of thermodynamics should be enough to prove that any program will halt sooner or later.
- pjungwir 12y agoFor real computers, yes, but we're talking about Turing machines. :-) By your logic there is no halting problem at all because every machine will eventually halt. A Turing machine has infinite tape and infinite time.