Deutsch   English   Français   Italiano  
<vs42pb$mmcb$2@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Turing computable functions
Date: Thu, 27 Mar 2025 12:44:11 -0500
Organization: A noiseless patient Spider
Lines: 31
Message-ID: <vs42pb$mmcb$2@dont-email.me>
References: <vruvsn$3tamc$3@dont-email.me> <vs0b8d$19qb8$1@dont-email.me>
 <vs19qe$2346o$2@dont-email.me> <vs389t$qiq$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Thu, 27 Mar 2025 18:44:11 +0100 (CET)
Injection-Info: dont-email.me; posting-host="8fbd84b24c3af7ac080451312d40f885";
	logging-data="743819"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+YTufm5lisZVsGXzTXGyxs"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:vOVMuNb+/vnzJOZsDQbWPe9o5Lc=
X-Antivirus: Norton (VPS 250327-8, 3/27/2025), Outbound message
Content-Language: en-US
In-Reply-To: <vs389t$qiq$1@dont-email.me>
X-Antivirus-Status: Clean
Bytes: 2344

On 3/27/2025 5:12 AM, Mikko wrote:
> On 2025-03-26 16:25:49 +0000, olcott said:
> 
>> On 3/26/2025 2:44 AM, Mikko wrote:
>>> On 2025-03-25 19:24:07 +0000, olcott said:
>>>
>>>> Cannot possibly derive any outputs not computed from
>>>> their inputs.
>>>>
>>>> A Turing machine halt decider cannot possibly report
>>>> on the behavior of any directly executing process.
>>>
>>> It can if that report is a computable function of their inputs.
>>> For example, whether the direct execution of another Turing machine
>>> is longer than 2 steps is Turing computable.
>>
>> When an input to a simulating termination analyzer
>> defines a pathological relationship to its simulating
>> termination analyzer this changes the behavior of this
>> input relative to its direct execution.
> 
> Irrelevant to the fact that it is Turing computable whether the direct
> exectuion of a Turing machine is longer that two steps.
> 

That would be a syntactic rather than semantic property
of the input thus off topic for these posts.

-- 
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer