1. Forum
  2. Newsgroups
  3. comp.lang.c

  • Defining a halt decider with perfect accuracy

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,comp.lang.c,comp.lang.c++ on Sat Dec 13 15:32:26 2025
    From Newsgroup: comp.lang.c

    All of the textbooks require halt deciders to
    report on the behavior of machine M on input w.
    This may be easy to understand yet not precisely
    accurate.

    Since no Turing machine ever takes any Machine
    M as an input this <is> a category error even
    when this makes no functional difference.

    They simply glossed over this key detail because
    they thought that it made no difference.

    *Defining a halt decider with perfect accuracy*
    Turing machine halt deciders compute the mapping
    from input finite strings to an {accept, reject}
    value on the basis of the behavior that this
    input finite string specifies.
    --
    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