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,882 of 262,912    |
|    olcott to All    |
|    The halting problem itself is unequivoca    |
|    13 Dec 25 15:07:25    |
      XPost: comp.theory, sci.math, comp.ai.philosophy       From: polcott333@gmail.com              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