• Re: Church-Turing and computable functions

    From Mikko@mikko.levanto@iki.fi to comp.theory,sci.logic,comp.ai.philosophy,sci.math,sci.math.symbolic on Sun Oct 25 11:56:51 2026
    From Newsgroup: sci.math

    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, so
    what?

    it is solvable for an enumerable set of machines that includes all
    possible output sequences, it is not solvable for all possible machines >>>
    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior
    of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" or "main()".
    The halting problem asks "How can one determine whether a computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are
    also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this* https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant to how
    Linz has already defined the haliting problem on pages 317-318.

    Consequently, your false claims about the content of the page 319
    are irrlevant, too.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2