Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion

Liste des GroupesRevenir à c theory 
Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theory
Date : 21. May 2025, 10:08:04
Autres entêtes
Organisation : -
Message-ID : <100k55k$2oqlk$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2025-05-20 19:10:36 +0000, Mr Flibble said:

Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion
=========================================================================
 Overview:
---------
Flibble distinguishes between detecting infinite recursion and simulating
it. His argument is that a Simulating Halt Decider (SHD) does not need to
perform unbounded execution to reach a decision—it only needs to *detect*
unbounded behavior structurally. This refinement aligns with the demands
placed on any decider: that it halt in finite time.
You could also add that an SHD needes not simulate at all if the
detection can be made before that. It can be called "simulating"
if it simuates in some cases.
--
Mikko

Date Sujet#  Auteur
21 May10:08 o Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion1Mikko

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal