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, 17:31:30
Autres entêtes
Organisation : Fix this later
Message-ID : <vv2s12$1fkkq$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 02/05/2025 16:09, Mr Flibble wrote:
On Fri, 02 May 2025 06:15:40 +0100, Richard Heathfield wrote:
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.
The code for a decider would be trivial:
And yet it remains conspicuous by its absence.
it merely needs to be of the
simulating type, possibly stack machine based; such a machine is already a
solved problem: the only question is the magnitude of the resources that
can be allocated to it (infinite in this case).
Great! No problem there, then. Off you go...
-- 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)