2000 character limit reached
The Halting Paradox
Published 11 Jun 2019 in cs.LO | (1906.05340v1)
Abstract: The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in order to illustrate the limits of computation. However, Eric Hehner has a dissenting view, in which the specification of the halting problem is called into question.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.