Sujet : Re: Final Statement on the Halting Problem
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 15. Jun 2025, 15:50:01
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <102mmiq$uef9$9@dont-email.me>
References : 1
User-Agent : Mozilla Thunderbird
On 6/15/2025 8:55 AM, Mr Flibble wrote:
The halting problem as defined ignores recursive self reference focusing
on the paradox instead, I would argue the recursive self reference leads
to infinite regress in the definition of the problem thus creating a
category error making the problem definition itself ill-formed.
/Flibble
When we understand that all partial halt deciders are
required to report on the behavior of the sequence of
state transitions that its input actually specifies
then the conventional HP proof fails. The counter
example input is simply determined to be non-halting.
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its
input D until H correctly determines that its simulated D
would never stop running unless aborted then
H can abort its simulation of D and correctly report that D
specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
The criteria agreed to by the best selling author of theory
of computation textbooks agrees.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer