1. Forum
  2. Newsgroups
  3. comp.ai.philosophy

  • Alan Turing's Halting Problem is incorrectly formed --- My first post on the Halting Problem

    From olcott@NoOne@NoWhere.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Fri Dec 5 10:36:48 2025
    From Newsgroup: comp.ai.philosophy

    Alan Turing's Halting Problem is incorrectly formed
    Jun 6, 2004, 9:11:19 AM https://groups.google.com/g/sci.logic/c/V7wzVvx8IMw/m/ggPE6a-60cUJ

    *21 years of additional work later*

    Halting Problem Proof Counter-Example is Isomorphic to the Liar Paradox https://www.researchgate.net/publication/398375553_Halting_Problem_Proof_Counter-Example_is_Isomorphic_to_the_Liar_Paradox

    On 6/6/2004 9:11 AM, Peter Olcott wrote:
    One very simple transformation of the problem into a solvable problem
    is to convert the Boolean function DoesItHalt() into a tertiary response: True, False, Neither.

    if (DoesItHalt() == True)
    while(True) // loop forever
    ;
    else if (DoesItHalt() == False)
    return False;

    else if (DoesItHalt() == NeitherTrueNorFalse)
    return NeitherTrueNorFalse;

    So the original Halting Problem was incorrectly formed specifically
    because it was framed as a Boolean function, thus failing to account
    for possible inputs that result in a reply other than True or False.



    --
    Copyright 2025 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning" computable.

    This required establishing a new foundation
    for correct reasoning.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Sun Dec 7 13:11:45 2025
    From Newsgroup: comp.ai.philosophy

    olcott kirjoitti 6.12.2025 klo 14.22:
    On 12/6/2025 2:21 AM, Mikko wrote:
    olcott kirjoitti 5.12.2025 klo 18.36:
    Alan Turing's Halting Problem is incorrectly formed
    Jun 6, 2004, 9:11:19 AM
    https://groups.google.com/g/sci.logic/c/V7wzVvx8IMw/m/ggPE6a-60cUJ

    There is nothing incorrect in Turing's problem formulation. TUring's

    Failing to find a mistake my proof counts as
    not any rebuttal what-so-ever.

    Failing to find a mistake in Turing's halting problem counts as
    not any rebuttal what-so-ever.

    And so does failing to find Turing's halting problem.
    --
    Mikko
    --- Synchronet 3.21a-Linux NewsLink 1.2