Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.logic    |    Logic -- math, philosophy & computationa    |    262,912 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 262,094 of 262,912    |
|    olcott to Richard Damon    |
|    Re: Carol's question + my Prolog are a c    |
|    22 Dec 25 11:30:50    |
      XPost: comp.theory, comp.lang.prolog, sci.math       From: polcott333@gmail.com              On 12/22/2025 11:23 AM, Richard Damon wrote:       > On 12/22/25 12:19 PM, olcott wrote:       >> On 12/22/2025 11:11 AM, Mikko wrote:       >>> On 22/12/2025 18:39, olcott wrote:       >>>       >>>> % This sentence is not true.       >>>> ?- LP = not(true(LP)).       >>>> LP = not(true(LP)).       >>>       >>> The Prolog implementation's opinion is that it is true.       >>>       >>       >> % This sentence is not true.       >> ?- LP = not(true(LP)).       >> LP = not(true(LP)).       >> ?- unify_with_occurs_check(LP, not(true(LP))).       >> false.       >>       >> By erasing the last line you seem to be dishonest       >> was that your intention?       >>       >> Also you do not seem to understand exactly       >> what unify_with_occurs_check() means even       >> when I quoted Clocksin & Mellish on this.       >>       >       > It means that the input sentence didn't obey Prologs non-recursvie nature.       >              No that is not what it means.       It means that the evaluation of LP is stuck       in infinite recursion. LLMs are smart enough       to immediately see this.              > That works for the Liar Paradox, but not for the Halting Problem, as P       > include a copy of the algorithm of H, not a reference to the name H.       >       > All yoy are doing is pointing out that your logic system is too weak to       > handle the problem you are talking about and blaiming it for using       > something you don't understand how to do.              H(P) essentially performs unify_with_occurs_check()       on P, yet H is smart enough to see this and reject       P as non-halting.              --       Copyright 2025 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca