Deutsch   English   Français   Italiano  
<vsflef$1s8b0$4@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: DDD specifies recursive emulation to HHH and halting to HHH1
Date: Mon, 31 Mar 2025 22:10:07 -0500
Organization: A noiseless patient Spider
Lines: 84
Message-ID: <vsflef$1s8b0$4@dont-email.me>
References: <vrfuob$256og$1@dont-email.me>
 <9f2ff3ab9b99a7bb6dfa0885f9757f810ce52e66@i2pn2.org>
 <vsaam4$2sfhq$1@dont-email.me> <vsbi7e$1hblk$1@dont-email.me>
 <vsc6qi$27lbo$2@dont-email.me>
 <8a3e7e93e6cad20b29d23405a0e6dbd497a492ac@i2pn2.org>
 <vscegq$2fv3s$2@dont-email.me>
 <26f33bb039fda7d28ae164cfc4d0f582d4698f31@i2pn2.org>
 <vsclsb$2n4jc$1@dont-email.me>
 <36a4c76730b23cf78ddde73c723116b5380973a1@i2pn2.org>
 <vsctnm$2ub5m$2@dont-email.me>
 <72d003704b5bacf77110750e8c973d62869ad204@i2pn2.org>
 <vsf402$1crun$4@dont-email.me> <vsf49v$1adee$1@dont-email.me>
 <vsf520$1crun$5@dont-email.me> <vsf6fp$1adee$2@dont-email.me>
 <vsf8pp$1i673$1@dont-email.me> <vsfbp9$1l8n5$1@dont-email.me>
 <vsfdji$1m8qr$1@dont-email.me> <vsfe0c$1l8n5$2@dont-email.me>
 <vsffcj$1m8qr$5@dont-email.me> <vsfg3q$1l8n5$3@dont-email.me>
 <vsfi2t$1r8rb$1@dont-email.me> <vsfisi$1l8n5$4@dont-email.me>
 <vsfjj1$1s8b0$1@dont-email.me> <vsfk61$1l8n5$5@dont-email.me>
 <vsfkn6$1s8b0$2@dont-email.me> <vsfl0l$1l8n5$6@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 01 Apr 2025 05:10:08 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="5ed314de766e2c5f0206a803d6d07134";
	logging-data="1974624"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18vJZZIC3qC1S2g7girq8HH"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:31Gwlo4/LOGVijzWm4UCjrSncHA=
X-Antivirus-Status: Clean
In-Reply-To: <vsfl0l$1l8n5$6@dont-email.me>
Content-Language: en-US
X-Antivirus: Norton (VPS 250331-6, 3/31/2025), Outbound message
Bytes: 4582

On 3/31/2025 10:02 PM, dbush wrote:
> On 3/31/2025 10:57 PM, olcott wrote:
>> On 3/31/2025 9:48 PM, dbush wrote:
>>> On 3/31/2025 10:38 PM, olcott wrote:
>>>>
>>>> HHH must report on the behavior that its input
>>>> actually specifies. 
>>>
>>> And the input specifies an algorithm that halts when executed directly.
>>>
>>
>> Which is NOT how it is executed.
> 
> But IS what it is required to report on.
> 
>> It IS executed with recursive emulation.
> 
> Finitely recursive emulation, which is part of the algorithm DDD that 
> halts.
> 
>>
>>>> This seems way too difficult
>>>> for people that can only spout off words that
>>>> they learned by rote, with no actual understanding
>>>> of the underlying principles involved.
>>>>
>>>> Every actual computation can only transform input
>>>> finite strings into outputs. HHH does do this.
>>>
>>> But not as per the requirements:
>>>
>>
>>>
>>> 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
>>>
>>>
>>>>
>>>> The "requirements" that you mindlessly spout off
>>>
>>> Which would make all true statements provable if they could be met.
>>>
>>>> violate this foundational principle of functions
>>>> computed by Turing machines.
>>>
>>> Which just says that no Turing machine satisfies those requirements, 
>>> as Linz and others proved.
>>>
>>>>
>>>> int sum(int x, int y)
>>>> {
>>>>    return 5;
>>>> }
>>>>
>>>> sum(2,3) does not compute the sum of 2 + 3.
>>>>
>>>
>>>
>>> It absolutely does.  There are *NO* requirements on the 
>>> implementation, only the result.
>>
>> Unless and algorithm transforms its inputs
>> into its outputs it is not a Turing computable
>> function.
>>
> 
> The only requirements of an algorithm are to generate the results of a 
> mapping.  How that is accomplished is irrelevant.

It may have been historically considered irrelevant.
When it comes down to determining that mere guesses
are not any sort of: "computing the mapping" then it
does become relevant.

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