Liste des Groupes | Revenir à c theory |
On 5/13/2025 12:11 AM, Richard Heathfield wrote:On 13/05/2025 03:01, olcott wrote:
Cool! What are those steps?I am refuting the key halting problem proof, I am not refuting thethis requires testing against every element of the set of natural
numbers an infinite computation.
Only if it's true. So if it's true, the testing program will never
halt.
But if it's false, the tester will eventually find the counter-example,
print it, and stop.
So a program that can tell whether another program will halt can tell
us whether Goldbach's conjecture is true.
It would be the short cut that you say doesn't exist.
halting problem.
As soon as it is understood that I am correct that HHH(DD) computes the
mapping from its input to recursive emulation. Then in a few small steps
it will be know that I refuted the conventional Halting Problem proofs.
Les messages affichés proviennent d'usenet.