Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: Turing Machine computable functions apply finite string transformations to inputs
Date: Mon, 28 Apr 2025 12:14:29 +0300
Organization: -
Lines: 50
Message-ID: <vungtl$2v2kr$1@dont-email.me>
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>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 28 Apr 2025 11:14:29 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="d8d12c83be41d40122cd358aabad745d";
	logging-data="3115675"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/8dkbbYBAsFojzX+EYFqQs"
User-Agent: Unison/2.2
Cancel-Lock: sha1:cL2tj7T5SlaAuunVCAsnc8/sf3E=
Bytes: 2882

On 2025-04-26 15:59:39 +0000, olcott said:

> On 4/26/2025 3:19 AM, Mikko wrote:
>> On 2025-04-25 16:31:58 +0000, olcott said:
>> 
>>> On 4/25/2025 3:46 AM, Mikko wrote:
>>>> On 2025-04-24 15:11:13 +0000, olcott said:
>>>> 
>>>>> On 4/23/2025 3:52 AM, Mikko wrote:
>>>>>> On 2025-04-21 23:52:15 +0000, olcott said:
>>>>>> 
>>>>>>> Computer Science Professor Eric Hehner PhD
>>>>>>> and I all seem to agree that the same view
>>>>>>> that Flibble has is the correct view.
>>>>>> 
>>>>>> Others can see that their justification is defective and contradicted
>>>>>> by a good proof.
>>>>>> 
>>>>>> Some people claim that the unsolvability of the halting problem is
>>>>>> unproven but nobody has solved the problem.
>>>>> 
>>>>> For the last 22 years I have only been refuting the
>>>>> conventional Halting Problem proof.
>>>> 
>>>> Trying to refute. You have not shown any defect in that proof of the
>>>> theorem. There are other proofs that you don't even try to refute.
>>> 
>>> Not at all. You have simply not been paying enough attention.
>>> 
>>> Once we understand that Turing computable functions are only
>>> allowed
>> 
>> Turing allowed Turing machines to do whatever they can do.
> 
> Strawman deception error of changing the subject away
> from computable functions.

Attempt to deceive by a false claim. The term "computable function" is
defined in terms of Turing machines so Turing machines are on topic.

> Turing Machine Computable Functions are not allowed
> to output anything besides the result of applying
> finite string transformations to their input.

A Turing Machine Computable function is allowed and required to output
the value of the function for the given argument and nothing else.

-- 
Mikko