• Re: ct thesis

    From Lawrence =?iso-8859-13?q?D=FFOliveiro?=@ldo@nz.invalid to comp.theory on Sun Nov 8 00:07:16 2026
    From Newsgroup: comp.theory

    On Wed, 12 Aug 2026 22:15:15 -0700, dart200 wrote:

    turing for example tried to extend logical systems into transfinite
    ordinals in an attempt to get around incompleteness.

    That does work, though. There are perfectly reasonable logical systems
    (e.g. geometry) where G||delrCOs Incompleteness Theorem does not apply <https://www.youtube.com/watch?v=IuX8QMgy4qE>.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dart200@user7160@newsgrouper.org.invalid to comp.theory on Sat Nov 7 17:17:37 2026
    From Newsgroup: comp.theory

    On 11/7/26 4:07 PM, Lawrence DrCOOliveiro wrote:
    On Wed, 12 Aug 2026 22:15:15 -0700, dart200 wrote:

    turing for example tried to extend logical systems into transfinite
    ordinals in an attempt to get around incompleteness.

    That does work, though. There are perfectly reasonable logical systems
    (e.g. geometry) where G||delrCOs Incompleteness Theorem does not apply <https://www.youtube.com/watch?v=IuX8QMgy4qE>.

    err no, turing's thesis paper on how that doesn't work, and is built
    upon by post and kleene to establish the modern hierarchy of undecidability

    from watching that video maybe ur confusing real numbers with
    transfinite ordinals? those are not the same thing
    --
    arising us out of the computing dark ages,
    please excuse my pseudo-pyscript,
    ~ the lil crank that could
    --- Synchronet 3.22a-Linux NewsLink 1.2