Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Turing Machine computable functions apply finite string
 transformations to inputs
Date: Tue, 6 May 2025 07:29:23 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <41f4ae4e8e8e5342aa358b440411de773d08c581@i2pn2.org>
References: <TuuNP.2706011$nb1.2053729@fx01.ams4>
 <87cyd5182l.fsf@nosuchdomain.example.com> <vu6lnf$39fls$2@dont-email.me>
 <vugddv$b21g$2@dont-email.me> <vui4uf$20dpc$1@dont-email.me>
 <vuivtb$2lf64$3@dont-email.me> <vungtl$2v2kr$1@dont-email.me>
 <vuoaac$3jn5n$5@dont-email.me> <vuq81v$1hjka$1@dont-email.me>
 <vutefq$gmbi$3@dont-email.me> <vv22hs$puqs$1@dont-email.me>
 <vv89ll$2erlq$4@dont-email.me> <vv8en2$2kjgk$3@dont-email.me>
 <vv8ot8$2ub3p$1@dont-email.me> <vv8pqu$2ut5q$1@dont-email.me>
 <5YRRP.109778$_Npd.21893@fx01.ams4> <vv9142$35pgh$1@dont-email.me>
 <018f45d4807ba7b0092370889153d51d798e112e@i2pn2.org>
 <vvbsb1$1us1f$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 6 May 2025 11:29:48 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3368344"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vvbsb1$1us1f$4@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0

On 5/5/25 10:32 PM, olcott wrote:
> On 5/5/2025 8:19 PM, Richard Damon wrote:
>> On 5/4/25 8:35 PM, olcott wrote:
>>> On 5/4/2025 5:34 PM, Mr Flibble wrote:
>>>> On Sun, 04 May 2025 23:30:54 +0100, Richard Heathfield wrote:
>>>>
>>>>> On 04/05/2025 23:15, olcott wrote:
>>>>>> On 5/4/2025 2:21 PM, Richard Heathfield wrote:
>>>>>>> On 04/05/2025 18:55, olcott wrote:
>>>>>>>> Changing my words then rebutting these changed words is dishonest.
>>>>>>>>
>>>>>>>> Functions computed by Turing Machines require INPUTS and produce
>>>>>>>> OUTPUTS DERIVED FROM THESE INPUTS.
>>>>>>>
>>>>>>> Counter-example: a Turing Machine can calculate pi without any input
>>>>>>> whatsoever.
>>>>>>>
>>>>>>> As Mikko rightly said: a Turing machine does not need to require an
>>>>>>> input.
>>>>>>>
>>>>>>>
>>>>>> IT IS NOT COMPUTING FUNCTION THEN
>>>>>
>>>>> Quoth Alan Turing:
>>>>>
>>>>> (viii) The limit of a computably convergent sequence is computable.
>>>>>
>>>>>   From (viii) and TT— 4(1—i-|--i—...) we deduce that TT is computable.
>>>>>
>>>>> No input required.
>>>>>
>>>>>> IT IS NOT COMPUTING FUNCTION THEN IT IS NOT COMPUTING FUNCTION 
>>>>>> THEN IT
>>>>>> IS NOT COMPUTING FUNCTION THEN
>>>>>>
>>>>>> Computable functions are the basic objects of study in computability
>>>>>> theory. Computable functions are the formalized analogue of the
>>>>>> intuitive notion of algorithms, in the sense that a function is
>>>>>> computable if there exists an algorithm that can do the job of the
>>>>>> function, i.e. given an input of the function domain it can return 
>>>>>> the
>>>>>> corresponding output. https://en.wikipedia.org/wiki/ 
>>>>>> Computable_function
>>>>>
>>>>> That's a very second-rate summary of computability. Turing was far 
>>>>> more
>>>>> interested in whether a computation was possible than whether it 
>>>>> needed
>>>>> inputs. Do most computations need inputs? Most useful ones that we 
>>>>> care
>>>>> about, sure. But all? By no means.
>>>>>
>>>>>> *Computer science is ONLY concerned with computable functions*
>>>>>
>>>>> Computer science is concerned with the Halting Problem.
>>>>> The Halting Problem is concerned with an incomputable function.
>>>>> Therefore computer science is concerned with at least one incomputable
>>>>> function.
>>>>
>>>> The function is neither computable nor incomputable because there is no
>>>> function at all, just a category error.
>>>>
>>>> /Flibble
>>>
>>> You can look at it that way or you can look
>>> at it as simulating termination analyzer HHH(DD)
>>> does correctly determine that DD cannot possibly
>>> reach its own final state, thus is correctly
>>> rejected as non-halting.
>>>
>>
>> Except that isn't the question that is being asked.
>>
>> In fact, that question has a trivial answer, as we can make an H0 that 
>> just aborts its emulation and returns 0 and it is correct by your 
>> definition, 
> 
> No that is stupidly wrong as I have said at least 100 times recently.
> The termination analyzer must compute the mapping from the input
> on the basis of the behavior that this input actually specifies.
> 

Which *IS* by the DEFINITION of the problem, the behavior of the program 
the input represents when run.

IF you change the property to be what H sees, then H can just be blind 
and see nothing.

Your logic ALLOW H to be wrong about the correct simulation and make up 
its own answer, and thus your logic allows all deciders to be wrong 
about the correct simulation and make up their own answer.

This is the problem with basing your logic on the right to lie, it just 
doesn't work.

Since H *DOES* abort its simulation, to imagine the world changing so 
that it doesn't is just a LIE and a delusion, something you seem to like 
to live in.