• Re: a computation is not allowed to report on the machine that it is em

    From Mild Shock@21:1/5 to olcott on Fri Oct 27 08:06:45 2023
    Olcotts trolling is still nothing
    compared to Edgar Daylights trolling:

    Edgar G. Daylight. The halting problem and security’s
    language-theoretic approach: Praise and criticism from a
    technical historian - IOS Press, Computability,
    Vol. 10, No. 2, pp. 141-158, 2021
    https://www.dijkstrascry.com/DaylightStrachey

    LoL

    olcott schrieb am Donnerstag, 26. Oktober 2023 um 20:17:34 UTC+2:
    https://www.liarparadox.org/Linz_Proof.pdf

    This Turing Machine description at the top of page 3
    q0 WM ⊢* Ĥq0 WM WM ⊢* Ĥ ∞
    q0 WM ⊢* Ĥq0 WM WM ⊢* Ĥ y1 qn y2

    Is simplified and clarified to this: when Ĥ is applied to ⟨Ĥ⟩

    Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
    Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn

    embedded_H is expressly not allowed to consider that Ĥ ⟨Ĥ⟩ reaches Ĥ.qn
    and halts because this requires embedded_H to report on the computation
    that contains itself thus breaking the rule that all computations must
    be a pure functions of their inputs.

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

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