• On infinite recursion, SHDs and the halting problem

    From Mr Flibble@21:1/5 to All on Tue May 20 18:47:06 2025
    Hi!

    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.

    /Flibble

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to Mr Flibble on Wed May 21 10:52:36 2025
    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

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)