Source: wikibot/chaitin-s-constant
= Chaitin's constant
{wiki=Chaitin's_constant}
Chaitin's constant, often denoted by \\(\\Omega\\), is a real number associated with algorithmic information theory, specifically related to the concept of algorithmic randomness and incompleteness. It represents the probability that a randomly chosen program (in a specific programming language, typically a universal Turing machine) will halt.