• Re: Linz's proofs and other undecidable decision problems [LP as basis]

    From Mikko@21:1/5 to olcott on Sun May 12 10:47:13 2024
    On 2024-05-11 16:06:29 +0000, olcott said:

    On 5/11/2024 3:00 AM, Mikko wrote:
    On 2024-05-10 18:16:37 +0000, olcott said:

    On 3/1/2024 12:41 PM, Mike Terry wrote:

    Obviously a simulator has access to the internal state (tape contents
    etc.) of the simulated machine.  No problem there.

    What isn't allowed is the simulated machine altering its own behaviour >>>> by accessing data outside of its own state.  (I.e. accessing data from >>>> its parent simulators state.)

    While an "active-simulator" [my own term] is at liberty to combine
    straight simulation with add-on "enhancements" that extend the
    functionality of the simulated machine, in doing so it would no
    longer be a simulator in the sense you need it to be.  So you
    mustn't do this!

    In principle an incorrect simulation is permissible. However, to prove
    that the result inferred from an incorrect simulation is correct may
    be impossible.


    Within the conventional terms-of-the-art of {termination analyzer}
    and {simulator} an incorrect simulation is forbidden.

    The conventional meaning of "termination analyzer" does not prohibit
    incorrect simulation. Whether an incorrect simulation can be called "simulation" is a matter of opinion. In any case, when a methind that
    uses an incorrect simulation is described the incorrectness of the
    simulation, whther calles "simulation" or otherwise, must be mentioned
    and its role be explained.

    --
    Mikko

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