Sujet : Re: Unpartial Halt Decider 4.0
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 19. Apr 2025, 08:54:49
Autres entêtes
Organisation : -
Message-ID : <vtvks9$vu3s$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2025-04-18 18:45:31 +0000, Mr Flibble said:
Hi!
I, aka Mr Flibble, have created a new computer science term, the
"Unpartial Halt Decider". It is a Partial Halt Decider over the domain of
all *finite* program-input pairs excluding pathological input (a
manifestation of the self referencial category error).
It is a Simulating Halt Decider with *infinite resources*.
Turing’s statement of the problem included logically invalid inputs. Once
we correct the domain to disallow self-reference, the rest (of *finite*
size) are decidable.
You haven't proven that your "decider" can actually correctly determine
all cases of non-halting that do not have any pahological relation to
anyhing.
-- Mikko