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 261,901 of 262,912    |
|    polcott to joes    |
|    Re: This single paragraph proves that th    |
|    14 Dec 25 09:34:13    |
   
   XPost: comp.theory, comp.theory   
   From: polcott333@gmail.com   
      
   On 12/14/2025 2:59 AM, joes wrote:   
   > Am Sat, 13 Dec 2025 14:19:01 -0600 schrieb olcott:   
   >> On 12/13/2025 1:17 PM, Richard Damon wrote:   
   >>> On 12/11/25 8:48 PM, olcott wrote:   
   >>>   
   >>>> Turing machine deciders compute functions from finite strings to   
   >>>> {accept, reject}.   
   >>>> The halting problem itself requires that deciders compute the behavior   
   >>>> of executing machines, thus category error flat out and simple.   
   >>>   
   >>> Why do you say that?   
   >>>   
   >> All of the textbooks require halt deciders to report on the behavior of   
   >> machine M on input w.   
   >> Since no Turing machine ever takes any Machine M as an input this
|
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca