The halting probability Omega: irreducible complexity in pure mathematics (Q931311)

The author gives here a philosophically oriented and essentially non-technical, but not really covincing explanation of his understanding of mathematical incompleteness phenomena, centering around the (first) incompleteness theorem of Gödel, the unsolvability of the halting problem, and his approach toward algorithmic information theory culminating in the idea to compress the core information of the halting behavior in his halting probability \(\Omega\).