Re: Title: A Structural Analysis of the Standard Halting Problem Proof

Liste des GroupesRevenir à s logic 
Sujet : Re: Title: A Structural Analysis of the Standard Halting Problem Proof
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 21. Jul 2025, 14:45:24
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <105lg9k$3v8t8$6@dont-email.me>
References : 1 2 3 4
User-Agent : Mozilla Thunderbird
On 7/21/2025 4:06 AM, Mikko wrote:
On 2025-07-20 11:48:37 +0000, Mr Flibble said:
 
On Sun, 20 Jul 2025 07:13:43 -0400, Richard Damon wrote:
>
On 7/20/25 12:58 AM, olcott wrote:
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.
>
Your problem is you don't understand the meaning of the words you are
using.
>
This is an ad hominem attack, not argumentation.
 It is also honest and truthful, which is not as common as it should.
 
It is also honest and truthful that people
that deny verified facts are either liars
or lack sufficient technical competence.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
23 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal