Deutsch   English   Français   Italiano  
<vrv4up$3t3k$1@dont-email.me>

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

Path: 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: Tue, 25 Mar 2025 15:50:33 -0500
Organization: A noiseless patient Spider
Lines: 56
Message-ID: <vrv4up$3t3k$1@dont-email.me>
References: <vruvsn$3tamc$3@dont-email.me> <vrv0d4$3hle3$10@dont-email.me>
 <vrv18e$3tamc$4@dont-email.me> <vrv2aa$3hle3$11@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 25 Mar 2025 21:50:37 +0100 (CET)
Injection-Info: dont-email.me; posting-host="28b8eab6d237e557af892b2ab104f6c1";
	logging-data="128116"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18LYFIWBzYOakyY8FeZq1gG"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:gVufBWuOPbfhL7M1U0UJcdxi55U=
X-Antivirus-Status: Clean
In-Reply-To: <vrv2aa$3hle3$11@dont-email.me>
X-Antivirus: Norton (VPS 250325-18, 3/25/2025), Outbound message
Content-Language: en-US

On 3/25/2025 3:05 PM, dbush wrote:
> On 3/25/2025 3:47 PM, olcott wrote:
>> On 3/25/2025 2:32 PM, dbush wrote:
>>> On 3/25/2025 3:24 PM, olcott wrote:
>>>> Cannot possibly derive any outputs not computed from
>>>> their inputs.
>>>
>>> Correct, algorithms can only compute computable mathematical function.
>>>
>>>>
>>>> A Turing machine halt decider 
>>>
>>> Does not exist because the required mapping is not computable:
>>>
>>>
>>> Given any algorithm (i.e. a fixed immutable sequence of instructions) 
>>> X described as <X> with input Y:
>>>
>>> A solution to the halting problem is an algorithm H that computes the 
>>> following mapping:
>>>
>>> (<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
>>> (<X>,Y) maps to 0 if and only if X(Y) does not halt when executed 
>>> directly
>>>
>>>
>>>
>>>> cannot possibly report
>>>> on the behavior of any directly executing process.
>>>> No Turing machine can every do this. This has always
>>>> been beyond what any Turing machine can ever do.
>>>
>>>
>>> Strawman: reporting on an executing process is not a requirement. 
>>
>> YOU JUST SAID THAT IT WAS
>> YOU KEEP MINDLESSLY REPEATING THAT IT IS
>>
>> On 3/25/2025 2:32 PM, dbush wrote:
>>  > (<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
>>
>>
> 
> I never said it had to actually watch an executing process, only report 
> what would happen if it did run.
> 

*It has been conclusively proven as a verified*
*fact many hundreds of times over several years*
That the behavior that the finite string input specifies
is not perfect proxy for the behavior of the underlying
directly executed machine.

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