Rank #48

Halting Problem

math

Turing's proof that no algorithm can determine in general whether an arbitrary program halts. The foundational theorem of computability.

Open source ↗

01
Lv 1 · Browser0 pts
0 / 100 to Lv 2+1 / 200px scrolled
Theme
Display
Density