1. Forum
  2. Newsgroups
  3. comp.theory

  • Three page proof that the Halting Problem is incorrect

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.theory on Sat Dec 20 06:07:49 2025
    From Newsgroup: comp.theory

    https://philpapers.org/archive/OLCDTF.pdf
    --
    Copyright 2025 Olcott<br><br>

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

    This required establishing a new foundation<br>

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.theory on Sat Dec 20 08:32:21 2025
    From Newsgroup: comp.theory

    On 12/20/25 7:07 AM, olcott wrote:
    https://philpapers.org/archive/OLCDTF.pdf



    Which begins by the assertion of a lie.

    That H can contain an actual UTM that exhibits different behavior then
    the actual independent UTM.

    That means you system of programs allows programs to have non-determined behavior, and thus your whole world of programs are useless.
    --- Synchronet 3.21a-Linux NewsLink 1.2