Path: nntp.eternal-september.org!news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail
From: Mild Shock <janburse@fastmail.fm>
Newsgroups: comp.ai.philosophy
Subject: Re: Title: A Structural Analysis of the Standard Halting Problem
 Proof
Date: Wed, 23 Jul 2025 15:38:58 +0200
Message-ID: <105qolh$2nsia$1@solani.org>
References: <105ht1n$36s20$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 23 Jul 2025 13:38:57 -0000 (UTC)
Injection-Info: solani.org;
	logging-data="2880074"; mail-complaints-to="abuse@news.solani.org"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:128.0) Gecko/20100101
 Firefox/128.0 SeaMonkey/2.53.21
Cancel-Lock: sha1:15uRNFmSscc3r7iMSP1Y77q7TtI=
X-User-ID: eJwFwQERADEIAzBLA9ryyGEc8y/hE4ZMkxAFPj4FbxbNvRu7ploU5nzHoEEO43hqv+bzuN1av2Jt9rDUPyxvFNc=
In-Reply-To: <105ht1n$36s20$1@dont-email.me>


You bisimilarity is broken

It shows halting not as a decidable property.
If you have M1 ~ M2, and M2 is still not decidable
but has the same notion of termination nevertheless,

means logically you didn't really make any error,
only you showed nothing. Not much was gained.

I guess you need to start all over agan.

olcott schrieb:
> Title: A Structural Analysis of the Standard Halting Problem Proof
> 
> Author: PL Olcott
> 
> Abstract:
> This paper presents a formal critique of the standard proof of the 
> undecidability of the Halting Problem. While we do not dispute the 
> conclusion that the Halting Problem is undecidable, we argue that the 
> conventional proof fails to establish this conclusion due to a 
> fundamental misapplication of Turing machine semantics. Specifically, we 
> show that the contradiction used in the proof arises from conflating the 
> behavior of encoded simulations with direct execution, and from making 
> assumptions about a decider's domain that do not hold under a rigorous 
> model of computation.
> 
>