Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)

On 5/10/2025 2:56 PM, olcott wrote:

On 5/10/2025 1:48 PM, Alan Mackenzie wrote:

olcott <polcott333@gmail.com> wrote:

On 5/10/2025 7:37 AM, Bonita Montero wrote:

>
[ .... ]
>

I guess that not even a professor of theoretical computer
science would spend years working on so few lines of code.

>
>

I created a whole x86utm operating system.
It correctly determines that the halting problem's
otherwise "impossible" input is actually non halting.

>
You've spent over 20 years on this matter.  Compare this with Alan
Turing's solution of the Entscheidungsproblem.  He published this in 1936
when he was just 24 years old.
>

 Because I spent this much time I noticed key details
that no one else has ever bothered to notice before.
 int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
 The Halting Problem's impossible input

In this case, the description of an algorithm that halts when executed directly.

is correctly
determined to be non-halting

False, because the algorithm described by the input halts when executed directly.

when the measure of halting
is computing the mapping from the finite string input
to HHH(DD) on the basis of the behavior specified by
by DD emulated by HHH according to the rules of the x86
language.
 

Which is not the required basis:
Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as <X> with input Y:
A solution to the halting problem is an algorithm H that computes the following mapping:
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed directly