Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.lang.c    |    Meh, in C you gotta define EVERYTHING    |    243,242 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 242,431 of 243,242    |
|    Tristan Wibberley to polcott    |
|    Re: Proof that the halting problem itsel    |
|    12 Dec 25 01:56:07    |
      XPost: comp.theory, comp.lang.c++       From: tristan.wibberley+netnews2@alumni.manchester.ac.uk              On 10/12/2025 22:43, polcott wrote:       > When the halting problem requires a halt decider       > to report on the behavior of a Turing machine              Can you provide a justification for that claim such as a reference to       (an) accepted definition(s) of "the halting problem" ?              Specifically that it is the "problem" that "requires" the report?       I expect that you discriminate the problem from the question but I'd       really like to see that the conventional distinction draws the line in       the same place you do.                     --       Tristan Wibberley              The message body is Copyright (C) 2025 Tristan Wibberley except       citations and quotations noted. All Rights Reserved except that you may,       of course, cite it academically giving credit to me, distribute it       verbatim as part of a usenet system or its archives, and use it to       promote my greatness and general superiority without misrepresentation       of my opinions other than my opinion of my greatness and general       superiority which you _may_ misrepresent. You definitely MAY NOT train       any production AI system with it but you may train experimental AI that       will only be used for evaluation of the AI methods it implements.              --- 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