Sujet : Re: Proof of Halting Problem Decidability in Typed Hypercomputational Programs (THP)
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 02. May 2025, 06:15:40
Autres entêtes
Organisation : Fix this later
Message-ID : <vv1kdt$d71j$1@dont-email.me>
References : 1
User-Agent : Mozilla Thunderbird
On 25/04/2025 20:01, Mr Flibble wrote:
The proof addresses the assumption that self-referential
conflation of a decider and its input constitutes a category (type) error,
which the type system eliminates to ensure decidability.
So you've designed a system in which you guarantee decidability. Great! Let's see the code for your decider.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within
Re: Proof of Halting Problem Decidability in Typed Hypercomputational Programs (THP)
Re: Proof of Halting Problem Decidability in Typed Hypercomputational Programs (THP)