Project Sherlock

Computer Science · Theory of Computation

The Halting Problem

A topic within Theory of Computation, itself one of 13 topics in that field and part of Computer Science.

Reading on The Halting Problem

2

2 works

Essay2020

The Busy Beaver Frontier

Scott Aaronson

Surveys sixty years of the busy beaver function, arguing that pinning down each new value amounts to resolving a real open mathematical conjecture, since the function inherits its uncomputability directly from the halting problem.

23 pageslink checked 17 Sept 2026

Other topics in Theory of Computation