Chaitin's constant

Chaitin's constant, Ω (capital omega), also called the halting probability, is a construction by Gregory Chaitin. For a given model of computation or programming language, Ω is the probability that a randomly produced string will represent a program that, when run, will eventually halt.

The fact that this number can be defined is important because the question whether an individual program halts isn't decidable with a general algorithm (see halting problem). The number Ω can be defined, but it cannot be computed; we don't know its value for any programming language, nor will we ever.

It is important to realize that Chaitin's constant isn't a constant in the usual sense: it isn't a fixed, canonically defined number such as π or e since its definition depends on the arbitrary choice of computation model and program encoding. It should more properly be referred to as "Chaitin's construction".

To define Ω formally, we first need to fix a model of computation, for instance Turing machines or Lisp or Pascal programs. We then need to specify an unambiguous encoding of programs (or machines) as bit strings. This encoding must have the property that if w encodes a syntactically correct program, then no proper prefix of w encodes a syntactically correct program. This can always be achieved by using a special end symbol. We only consider programs that don't require any input.

Let P be the set of all programs which halt. Ω is then defined as:

<math>\Omega = \sum_{p \in P} 2^{-|p|}</math>

This is an infinite sum which has one summand for every syntactically correct program which halts. |p| stands for the length of the bit string of ps encoding. The above requirement that programs be prefix-free ensures that this sum converges to a real number between 0 and 1.

It can then be shown that Ω represents the probability that a randomly produced bit string will encode a halting program. This means that if you start flipping coins, always recording a head as a one and a tail as a zero, the probability is Ω that you will eventually reach the encoding of a syntactically correct halting program.

One can prove that there is no algorithm which produces the digits of Ω: Ω is definable but not computable. Furthermore, Ω is a normal number.

If you fix, in addition to the computation model and encoding mentioned above, a specific consistent axiomatic system for the natural numbers, say Peano's axioms, then there exists a constant N such that no digit of Ω after the N-th can be proven to be one or zero within that system. (The constant N heavily depends on the encoding choices and doesn't reflect the complexity of the axiomatic system in any way.) This is an incompleteness result akin to Gödel's incompleteness theorem and Chaitin's own result mentioned under algorithmic information theory.

Common misspelling and questions (FAQ)

haitin's-constant  caitin's-constant  chitin's-constant  chatin's-constant  chaiin's-constant  chaitn's-constant  chaiti's-constant  chaitins-constant  chaitin'-constant  chaitin'sconstant  chaitin's-onstant  chaitin's-cnstant  chaitin's-costant  chaitin's-contant  chaitin's-consant  chaitin's-constnt  chaitin's-constat  chaitin's-constan  hcaitin's-constant  cahitin's-constant  chiatin's-constant  chatiin's-constant  chaiitn's-constant  chaitni's-constant  chaiti'ns-constant  chaitins'-constant  chaitin'-sconstant  chaitin'sc-onstant  chaitin's-ocnstant  chaitin's-cnostant  chaitin's-cosntant  chaitin's-contsant  chaitin's-consatnt  chaitin's-constnat  chaitin's-constatn  chaitin's-constan  cchaitin's-constant  chhaitin's-constant  chaaitin's-constant  chaiitin's-constant  chaittin's-constant  chaitiin's-constant  chaitinn's-constant  chaitin''s-constant  chaitin'ss-constant  chaitin's--constant  chaitin's-cconstant  chaitin's-coonstant  chaitin's-connstant  chaitin's-consstant  chaitin's-consttant  chaitin's-constaant  chaitin's-constannt  chaitin's-constantt  dhaitin's-constant  xhaitin's-constant  fhaitin's-constant  fhaitin's-constant  vhaitin's-constant  cyaitin's-constant  cgaitin's-constant  cbaitin's-constant  cuaitin's-constant  cnaitin's-constant  cuaitin's-constant  cjaitin's-constant  cnaitin's-constant  chqitin's-constant  chwitin's-constant  chzitin's-constant  chwitin's-constant  chsitin's-constant  chzitin's-constant  cha8tin's-constant  chautin's-constant  chajtin's-constant  cha9tin's-constant  chaktin's-constant  cha9tin's-constant  chaotin's-constant  chaktin's-constant  chai5in's-constant  chairin's-constant  chaifin's-constant  chai6in's-constant  chaigin's-constant  chai6in's-constant  chaiyin's-constant  chaigin's-constant  chait8n's-constant  chaitun's-constant  chaitjn's-constant  chait9n's-constant  chaitkn's-constant  chait9n's-constant  chaiton's-constant  chaitkn's-constant  chaitih's-constant  chaitib's-constant  chaitij's-constant  chaitij's-constant  chaitim's-constant  chaitin[s-constant  chaitin;s-constant  chaitin/s-constant  chaitin]s-constant  chaitin'w-constant  chaitin'a-constant  chaitin'z-constant  chaitin'e-constant  chaitin'x-constant  chaitin'e-constant  chaitin'd-constant  chaitin'x-constant  chaitin's0constant  chaitin'spconstant  chaitin's[constant  chaitin's-donstant  chaitin's-xonstant  chaitin's-fonstant  chaitin's-fonstant  chaitin's-vonstant  chaitin's-c9nstant  chaitin's-cinstant  chaitin's-cknstant  chaitin's-c0nstant  chaitin's-clnstant  chaitin's-c0nstant  chaitin's-cpnstant  chaitin's-clnstant  chaitin's-cohstant  chaitin's-cobstant  chaitin's-cojstant  chaitin's-cojstant  chaitin's-comstant  chaitin's-conwtant  chaitin's-conatant  chaitin's-conztant  chaitin's-conetant  chaitin's-conxtant  chaitin's-conetant  chaitin's-condtant  chaitin's-conxtant  chaitin's-cons5ant  chaitin's-consrant  chaitin's-consfant  chaitin's-cons6ant  chaitin's-consgant  chaitin's-cons6ant  chaitin's-consyant  chaitin's-consgant  chaitin's-constqnt  chaitin's-constwnt  chaitin's-constznt  chaitin's-constwnt  chaitin's-constsnt  chaitin's-constznt  chaitin's-constaht  chaitin's-constabt  chaitin's-constajt  chaitin's-constajt  chaitin's-constamt  chaitin's-constan5  chaitin's-constanr  chaitin's-constanf  chaitin's-constan6  chaitin's-constang  chaitin's-constan6  chaitin's-constany  chaitin's-constang  chaytin's-constant  chaitins-constant  chaiyin's-constant  chaityin's-constant  chaitin's-constants 


walls of earth commands and curses came. Above ground the saps were so "Howdy, Yank!" Both sides were starving, the one for tobacco and the sometimes wrapped in the Vicksburg news-sheet printed on the white side indulged in. Hand-grenades were thrown and shells with lighted fuses replied from wooden coehorns hooped with iron. The Union generals learned (common item in a siege) that the citizens of Vicksburg armies who does not remember the 25th of June, and the hour of wound into position behind the earth barriers which hid them from the Jackson road should rise heavenwards. By common consent the rifle crack Stillness closed around the white house of Shirley once more, but not the stillness of the death prayer. Eyes staring at the big redoubt were blast fanned the upturned faces. In the sky, through the film of arms and legs and head less trunks and shapeless bits of wood and iron. thousand bayonets, and a hundred shells were shrieking across the across that rim of a summer's after-noon died in torture under tier upon scarred and baked hillside, outside of the Confederate lines at Nation's birthday, stood two men who typified the future and the past. into the hands of another. Now she chose to kiss the one upon whom she .

getting around

home

adv.search

site map



Current spider themes

news archive

 

Licence of article: GNU FDL.
Original source @ wikipedia.