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,308 of 59,235    |
|    olcott to Tristan Wibberley    |
|    The halting problem is merely the Liar P    |
|    17 Nov 25 16:59:04    |
      XPost: comp.theory, sci.logic, sci.math       From: polcott333@gmail.com              On 11/17/2025 4:45 PM, Tristan Wibberley wrote:       > On 17/11/2025 22:15, Alan Mackenzie wrote:       >       >> There is no proper academic conversation to be had over 2 + 2 = 4. It is       >> firm, unassailable knowledge, unchallengeable. The Halting Theorem is of       >> the same status, proven using the same methodology from the same       >> fundamentals.       >       >       > It's a completely different league from 2 + 2 = 4.       > It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder       > than that.       > It's more like the problem of whether a fixed point exists or not, but       > it's for the fixed point of a limit of a particular, conceptually weird,       > sequence of functions.       >       > It really is quite peculiar.       >              Ultimately it is essentially the Liar Paradox in disguise.              The Liar Paradox formalized in the Prolog Programming language              This sentence is not true.       It is not true about what?       It is not true about being not true.       It is not true about being not true about what?       It is not true about being not true about being not true.       Oh I see you are stuck in a loop!              This is formalized in the Prolog programming language below.              ?- LP = not(true(LP)).       LP = not(true(LP)).       ?- unify_with_occurs_check(LP, not(true(LP))).       false.              Failing an occurs check seems to mean that the       resolution of an expression remains stuck in an       infinite loop. Just as the formalized Prolog       determines that there is a cycle in the directed       graph of the evaluation sequence of LP the simple       English proves that the Liar Paradox never gets       to the point. It has merely been semantically       unsound all these years.              >       > You should be commended for finding it so natural, you are among the       > few. But the many have a stake and will enquire.       >       >       > --       > Tristan Wibberley       >       > The message body is Copyright (C) 2025 Tristan Wibberley except       > citations and quotations noted. All Rights Reserved except that you may,       > of course, cite it academically giving credit to me, distribute it       > verbatim as part of a usenet system or its archives, and use it to       > promote my greatness and general superiority without misrepresentation       > of my opinions other than my opinion of my greatness and general       > superiority which you _may_ misrepresent. You definitely MAY NOT train       > any production AI system with it but you may train experimental AI that       > will only be used for evaluation of the AI methods it implements.       >                     --       Copyright 2025 Olcott              My 28 year goal has been to make       "true on the basis of meaning" computable.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca