Re: faithful simulations [was: Formal systems that cannot possibly be incomplete except for unknowns and unknowable]

On 5/7/2025 4:30 PM, Richard Heathfield wrote:

On 07/05/2025 20:35, olcott wrote:

On 5/7/2025 1:59 PM, Richard Heathfield wrote:

On 07/05/2025 19:31, olcott wrote:

I already know that the contradictory part of the counter-example
input has always been unreachable code.

>
If the code is unreachable, it can't be part of a working program, so
simply remove it.

>
It is unreachable by the Halting Problem counter-example input D when
correctly simulated by the simulating termination analyzer H that it
has been defined to thwart.

 
If the simulation can't reach code that the directly executed program
reaches, then it's not a faithful simulation.
 

If is was true that it is not a faithful simulation then you would be
able to show exactly what sequence of instructions would be a faithful
simulation.