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 57,571 of 59,235    |
|    olcott to Richard Damon    |
|    Re: Title: A Structural Analysis of the     |
|    20 Jul 25 09:34:58    |
      XPost: comp.theory, sci.logic       From: polcott333@gmail.com              On 7/20/2025 6:13 AM, Richard Damon wrote:       > On 7/20/25 12:58 AM, olcott wrote:       >> Title: A Structural Analysis of the Standard Halting Problem Proof       >>       >> Author: PL Olcott       >>       >> Abstract:       >> This paper presents a formal critique of the standard proof of the       >> undecidability of the Halting Problem. While we do not dispute the       >> conclusion that the Halting Problem is undecidable, we argue that the       >> conventional proof fails to establish this conclusion due to a       >> fundamental misapplication of Turing machine semantics. Specifically,       >> we show that the contradiction used in the proof arises from       >> conflating the behavior of encoded simulations with direct execution,       >> and from making assumptions about a decider's domain that do not hold       >> under a rigorous model of computation.       >>       >>       >       > Your problem is you don't understand the meaning of the words you are       > using.       >       > You are starting with an incorrect assumption that a "Correct       > Simulation" can possible show behavior that is not in the direct       > exectuion of the machine, but that is IMPOSSIBLE, as the DEFINITION of       > "Correct Simulation" is that it reveals exactly the same behavior as the       > direct execution of the machine.       >               |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca