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

  • Re: Proof that the halting problem itself is a category error

    From polcott@polcott333@gmail.com to comp.theory,comp.ai.philosophy,comp.software-eng on Wed Dec 10 17:03:30 2025
    From Newsgroup: comp.ai.philosophy

    On 12/10/2025 4:58 PM, wij wrote:
    On Wed, 2025-12-10 at 16:43 -0600, polcott wrote:
    When the halting problem requires a halt decider
    to report on the behavior of a Turing machine
    this is always a category error.

    The corrected halting problem requires a Turing
    machine decider to report in the behavior that
    its finite string input specifies.

    If you honestly admit you are solving POO Problem, everything is fine.


    *It has take me 21 years to boil it down to this*

    When the halting problem requires a halt decider
    to report on the behavior of a Turing machine this
    is always a category error.

    The corrected halting problem requires a Turing
    machine decider to report in the behavior that
    its finite string input specifies.
    --
    Copyright 2025 Olcott

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

    This required establishing a new foundation
    for correct reasoning.
    --- Synchronet 3.21a-Linux NewsLink 1.2