Deutsch   English   Français   Italiano  
<7e21b112fdc26ae53735147dbf1c11c589655ed4@i2pn2.org>

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

Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Why Peter Olcott is correct
Date: Sun, 18 May 2025 07:05:24 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <7e21b112fdc26ae53735147dbf1c11c589655ed4@i2pn2.org>
References: <KA9WP.124192$vK4b.46873@fx09.ams4>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 18 May 2025 11:20:54 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="873321"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <KA9WP.124192$vK4b.46873@fx09.ams4>
Bytes: 2399
Lines: 36

On 5/17/25 8:11 PM, Mr Flibble wrote:
> Hi!
> 
> In the case of pathological input, Peter's SHD only needs to report a
> correct halting result *as if* the simulation was run to completion:
> whether we abort, or continue until we run out of stack space makes no
> difference: we are detecting INFINITE recursion which can be viewed as non-
> halting.
> 
> This is valid due to Flibble's Law:
> 
> If a problem permits infinite behavior in its formulation, it permits
> infinite analysis of that behavior in its decidability scope.
> 
> /Flibble

Right, but if the input is the actual program as derived in the halting 
proof, then the simulation, if run to completion will halt, and does not 
show infinite behavior of any form.

The DDD given as the input is built from the HHH that is claimed to get 
the right answer, and thus is the HHH that will abort at some point and 
return 0.

The code for that HHH that does that is made part of the program DDD, 
and is encoded in the input.

Therefore the correct simulation of that input by the hypothetical HHH, 
which is given that same input, which has the aborting code, will see 
tht it will reach the end.

The error that Olcott makes is the type error of giving a non-leaf 
function, without all the code needed as an input when it needs to be a 
program. His input is just invalid, and shows that he doesn't understand 
what he is talking about.

Agreeing with him will also show the same confusion.