Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai.philosophy    |    Perhaps we should ask SkyNet about this    |    59,235 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 58,847 of 59,235    |
|    olcott to Richard Damon    |
|    Re: Proof that the halting problem is in    |
|    27 Dec 25 16:16:02    |
      [continued from previous message]              > infinity works, and it seems you don't actually understand how induction       > works, so nothine proven by it.       >       >       >>       >>>       >>>>       >>>>>>       >>>>>>       >>>>>>> True is a formal system means that there is a (possible infinite)       >>>>>>> sequence of the Truth Preserving operations (defined in the       >>>>>>> system) from the Fundamental Truth Makers (axiom) of the system.       >>>>>>>       >>>>>>> The problem is that any statement True by only an infinite       >>>>>>> sequence of Truth Preserving operations can't be proven, as       >>>>>>> Proofs are defined as Finite sequences.       >>>>>>>       >>>>>>       >>>>>>       >>>>>       >>>>       >>>>       >>>       >>       >>       >                     --       Copyright 2025 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca