Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

What is the basis for reason? And mathematics?

Moderators: AMod, iMod

Post Reply
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

Post by PeteOlcott »

This is an explanation of a key new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms.

Anyone that is an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 processor emulator is can easily verify that the correctly simulated input to H(P,P) by H specifies a non-halting sequence of configurations, thus H correctly decides the halt status of the halting problem's "impossible" input.

Halting problem undecidability and infinitely nested simulation (V5)
https://www.researchgate.net/publicatio ... ulation_V5
wtf
Posts: 1178
Joined: Tue Sep 08, 2015 11:36 pm

Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

Post by wtf »

PeteOlcott wrote: Sat Apr 23, 2022 4:29 pm
Anyone that is an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 processor emulator is can easily verify that the correctly simulated input to H(P,P) by H specifies a non-halting sequence of configurations, thus H correctly decides the halt status of the halting problem's "impossible" input.
You have surely made an error, since your claim contradicts a well-known result from Turing's 1936 paper in which he proved that the Halting problem can not be solved by a computer program.

Can you point to any error in Turing's proof?

https://www.cs.virginia.edu/~robins/Tur ... r_1936.pdf
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

Post by PeteOlcott »

When the conventional halting problem proof counter-example are examined with a simulating halt decider they are found to simply be a non-halting sequences of configurations in that they specify infinitely nested simulation. See my paper.
alan1000
Posts: 313
Joined: Fri Oct 12, 2012 10:03 am

Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

Post by alan1000 »

Peter, your one-sentence reply is unintelligible, which does not inspire confidence in your paper.
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)

Post by PeteOlcott »

alan1000 wrote: Wed Apr 27, 2022 4:13 pm Peter, your one-sentence reply is unintelligible, which does not inspire confidence in your paper.
No one ever bothered to notice that the conventional halting problem proof counter-examples specify non-halting behavior when their halt decider is based on simulating its input to see what it does.
Post Reply