Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?= <agisaak@gm.invalid>
Newsgroups: comp.theory
Subject: Re: Turing Computations <are> finite string transformations of inputs
Date: Sat, 26 Apr 2025 16:18:20 -0600
Organization: Christians and Atheists United Against Creeping Agnosticism
Lines: 44
Message-ID: <vujm3c$397q3$1@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>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 27 Apr 2025 00:18:21 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="0559770474c6176db9489f7b158c6ca0";
	logging-data="3448643"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18UWdpmaHKeTZ0BAboRHvuz"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:/BqbQjtZzj34Y+OqGJUMtVixWYc=
Content-Language: en-US
In-Reply-To: <vujj6s$35hcg$6@dont-email.me>
Bytes: 2856

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é

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.