Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: dbush Newsgroups: comp.theory Subject: Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT Date: Thu, 1 May 2025 20:41:21 -0400 Organization: A noiseless patient Spider Lines: 96 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 02 May 2025 02:41:21 +0200 (CEST) Injection-Info: dont-email.me; posting-host="bfb965ae000e29628a09f9a13a748901"; logging-data="4040917"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/CDsaDnJgIO7X5O6KL8Ol7" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:15y6Gl7HBLR/OUzjb9B29qr7Yc4= In-Reply-To: Content-Language: en-US On 5/1/2025 8:15 PM, olcott wrote: > On 5/1/2025 2:51 AM, Richard Heathfield wrote: >> On 30/04/2025 19:30, Mike Terry wrote: >>> On 30/04/2025 16:46, Richard Heathfield wrote: >>>> On 30/04/2025 16:15, olcott wrote: >>>>> On 4/29/2025 5:03 PM, Richard Heathfield wrote: >>>>>> On 29/04/2025 22:38, olcott wrote: >>>>>> >>>>>> >>>>>> >>>>>>> >>>>>>> int DD() >>>>>>> { >>>>>>>    int Halt_Status = HHH(DD); >>>>>>>    if (Halt_Status) >>>>>>>      HERE: goto HERE; >>>>>>>    return Halt_Status; >>>>>>> } >>>>>>> >>>>>>> HHH is correct DD as non-halting BECAUSE THAT IS >>>>>>> WHAT THE INPUT TO HHH(DD) SPECIFIES. >>>>>> >>>>>> You're going round the same loop again. >>>>>> >>>>>> Either your HHH() is a universal termination analyser or it isn't. >>>>> >>>>> The domain of HHH is DD. >>>> >>>> Then it is attacking not the Halting Problem but the Olcott Problem, >>>> which is of interest to nobody but you. >>> >>> It would be (if correct) attacking the common proof for HP theorem as >>> it occurs for instance in the Linz book which PO links to from time >>> to time. >> >> Yes. That's what I call the Olcott Problem. >> >> De gustibus non est disputandum, but I venture to suggest that >> (correctly) overturning Turing's proof would be of cosmos-rocking >> interest to the world of computer science, compared to which pointing >> out a minor flaw in a minor[1] proof would, even if correct, have no >> more effect on our field than lobbing a pebble into the swash at high >> tide. >> > > int DD() > { >   int Halt_Status = HHH(DD); >   if (Halt_Status) >     HERE: goto HERE; >   return Halt_Status; > } > > Replacing the code of HHH with an unconditional simulator and > subsequently running HHH(DD) according to the rules of > the x86 language CANNOT POSSIBLY REACH ITS FINAL HALT > STATE NO MATTER WHAT HHH DOES. > Obviously, because you changed the input. Changing the input is not allowed. > > Unless we replace the code of HHH with an unconditional simulator and > subsequently run HHH(DD) we do > not have the actual correct mapping of the actual > input to the actual behavior of this actual input. > Changing the input is not allowed. > Unless we we replace the code of HHH with an unconditional simulator and > subsequently run HHH(DD) we do > not have the actual correct mapping of the actual > input to the actual behavior of this actual input. > Changing the input is not allowed. > Unless we we replace the code of HHH with an unconditional simulator and > subsequently run HHH(DD) we do > not have the actual correct mapping of the actual > input to the actual behavior of this actual input. > Changing the input is not allowed. > Unless we we replace the code of HHH with an unconditional simulator and > subsequently run HHH(DD) we do > not have the actual correct mapping of the actual > input to the actual behavior of this actual input. > Changing the input is now allowed. Changing the input is not allowed.