Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Fred. Zwarts" <F.Zwarts@HetNet.nl>
Newsgroups: comp.theory
Subject: Re: Turing Computations <are> finite string transformations of inputs
Date: Sun, 27 Apr 2025 08:27:18 +0200
Organization: A noiseless patient Spider
Lines: 51
Message-ID: <vukio6$646h$5@dont-email.me>
References: <vu6lnf$39fls$2@dont-email.me> <vua9oi$2lub6$1@dont-email.me>
 <vudkah$1ona3$1@dont-email.me> <vufi61$3k099$1@dont-email.me>
 <vugddv$b21g$2@dont-email.me> <vuh2a3$tkor$1@dont-email.me>
 <vuhjsk$1h0ma$1@dont-email.me> <vujhmf$36iqv$1@dont-email.me>
 <vujj6s$35hcg$6@dont-email.me> <vujm3c$397q3$1@dont-email.me>
 <vujn04$3a526$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 27 Apr 2025 08:27:19 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="ae23edbd9f2ff10f9b4e5eebfee85502";
	logging-data="200913"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/JX11xiPMr0ODu/w1dwWlN"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:9JGF/WTc+CTaHHtc5TMjEbdHZnk=
Content-Language: nl, en-GB
In-Reply-To: <vujn04$3a526$3@dont-email.me>
Bytes: 3375

Op 27.apr.2025 om 00:33 schreef olcott:
> On 4/26/2025 5:18 PM, André G. Isaak wrote:
>> On 2025-04-26 15:28, olcott wrote:
>>> On 4/26/2025 4:03 PM, André G. Isaak wrote:
>>>> On 2025-04-25 21:28, olcott wrote:
>>>>> On 4/25/2025 5:28 PM, André G. Isaak wrote:
>>>>>> On 2025-04-25 10:31, olcott wrote:
>>>>>>
>>>>>>> Once we understand that Turing computable functions are only
>>>>>>> allowed to derived their outputs by applying finite string
>>>>>>> operations to their inputs then my claim about the behavior
>>>>>>> of DD that HHH must report on is completely proven.
>>>>>>
>>>>>> You're very confused here.
>>>>>>
>>>>>> Computable functions are *functions*. That is, they are mappings 
>>>>>> from a domain to a codomain, neither of which are required to be 
>>>>>> strings. Functions don't involve finite string operations at all.
>>>>>>
>>>>>
>>>>> All Turing Machine based computation applies the/
>>>>> finite string transformations specified by the TM
>>>>> language to the input finite string.
>>>>
>>>> Turing machines and computable functions are not the same thing. You 
>>>> keep conflating the two. The point of my post was to try to get you 
>>>> to be more careful with your terminology.
>>>>
>>>> André
>>>>
>>>
>>> Yes so I must correct my words to say
>>>
>>> All Turing Machine based *Computable Functions* apply the
>>>  >> finite string transformations specified by the TM
>>>  >> language to the input finite string.
>>
>> Which is just as mangled as your earlier usage. Maybe learn what these 
>> things mean...
>>
>> André
>>
> 
> When HHH emulates DD once and then emulates itself
> emulating DD according to the finite string transformation
> rules specified by the x86 language then HHH 

should also analyse Halt7.c and conclude that there is a conditional 
abort, which makes the recursion finite and thus there is no need to 
abort the simulation. But HHH fails to do this correct analysis and 
prematurely aborts the simulation.