# The Halting Paradox

## TL;DR

This paper examines the foundational concept of the halting problem, questioning its traditional proof of non-computability and exploring alternative perspectives on its theoretical significance.

## Contribution

It challenges the conventional understanding of the halting problem's non-computability and discusses alternative viewpoints on its theoretical role.

## Key findings

- Questions the standard proof of the halting problem's non-computability
- Highlights dissenting views on the halting problem's specification
- Stimulates reconsideration of fundamental computability concepts

## 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.