flâneur

Arthur Knize

0 followers · 242 views

on the atlas — 1

highlights — 1

  • No halting probability is computable. The proof of this fact relies on an algorithm which, given the first n digits of Ω, solves Turing's halting problem for programs of length up to n. Since the halting problem is undecidable, Ω cannot be computed.
    Chaitin's constant - Wikipedia