Re: On infinite recursion, SHDs and the halting problem

Liste des GroupesRevenir à c theory 
Sujet : Re: On infinite recursion, SHDs and the halting problem
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theory
Date : 21. May 2025, 08:52:36
Autres entêtes
Organisation : -
Message-ID : <100k0o4$2o31c$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2025-05-20 18:47:06 +0000, Mr Flibble said:

It is sufficient for an SHD to DETECT infinite recursion without having to
SIMULATE it.  Indeed this has to be the case given that an SHD, like any
decider, must furnish a decision in FINITE time.
 This is consistent with Flibble's Law:
 If a problem permits infinite behavior in its formulation, it permits
infinite analysis of that behavior in its decidability scope.
If you want to permit infinte behaviour for decidability you need to
define how an infinite behaviour specifies a decision. With finite
and hyperfinite behaviour one can use the final state or the final
content of the tape but neither is there if there is no last state.
--
Mikko

Date Sujet#  Auteur
21 May08:52 o Re: On infinite recursion, SHDs and the halting problem1Mikko

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal