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,532 of 262,912    |
|    Richard Damon to olcott    |
|    Re: The halting problem proof fails unde    |
|    15 Jan 26 06:50:36    |
      XPost: comp.theory, comp.lang.prolog       From: news.x.richarddamon@xoxy.net              On 1/15/26 12:33 AM, olcott wrote:       > On 1/14/2026 9:45 PM, Richard Damon wrote:       >> On 1/14/26 7:51 PM, olcott wrote:       >>> On 1/14/2026 6:26 PM, Tristan Wibberley wrote:       >>>> On 15/01/2026 00:14, olcott wrote:       >>>>> The halting problem proof fails ...       >>>>       >>>> Do you mean "The halting problem proof supposition fails ..." ?       >>>>       >>>       >>> The proof does not prove that halting is undecidable.       >>>       >>> By proof‑theoretic semantics I mean the approach in which the       >>> meaning of a statement is determined by its rules of proof       >>> rather than by truth conditions in an external model.       >>> Operational semantics fits this pattern: programs have meaning       >>> through their execution rules, not through abstract denotations.       >>>       >>       >> But "Proof-Theoretic Semantics" aren't applicable to the system.       >>       >> I guess in you system you can't make a computation that verifies that       >> a proof is correct.       >>       >> Your problem is you are not ALLOWED to change the semantics of the       >> system the proof was done in.       >>       >       > Sure you are. "Proof-Theoretic Semantics" does not derive the       > incoherence of truth conditional semantics.              In other words, in your world words don't need to mean what they were       defined to mean.              That you the world of lies you live in.              I hereby define the words "Peter Olcott" to mean a totally brainless       pathological liar.              Your claim to be able to change the basis of a system is the same as       that decleration.              As I have said, if you want to try to derive a NEW system by some such       rule, go ahead, but you first need to show the basic results of what       that system can do, and that it is useful.              Note, I suspect you are going to find that you can't even support basic       math in your system.              >       >> At best, you can say it doesn't apply in other systems, but those       >> system end up being deficent in some needed criteria.       >>       >> Being able to handle the properties of the Natural Numbers is one of       >> them.       >       >              --- 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