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
Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)
-
- Posts: 1514
- Joined: Mon Jul 25, 2016 6:55 pm
Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)
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.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.
Can you point to any error in Turing's proof?
https://www.cs.virginia.edu/~robins/Tur ... r_1936.pdf
-
- Posts: 1514
- Joined: Mon Jul 25, 2016 6:55 pm
Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)
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.
Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)
Peter, your one-sentence reply is unintelligible, which does not inspire confidence in your paper.
-
- Posts: 1514
- Joined: Mon Jul 25, 2016 6:55 pm
Re: Halting problem undecidability and infinitely nested simulation (V5) (adapted for software engineers)
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.