Construct · 1 fields · 1 citations

Chaitin's constant: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Information theory

probability that a randomly generated program for a fixed prefix-free universal machine halts, an algorithmically random real number.

In information theory, Chaitin's constant refers to probability that a randomly generated program for a fixed prefix-free universal machine halts, an algorithmically random real number. This meaning comes from Chaitin (1975) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Chaitin's constant sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

constant2 fields · 2 citationsjingle · one word, two constructs information4 fields · 5 citationsjingle · one word, four constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Chaitin, G. J. (1975). A Theory of Program Size Formally Identical to Information Theory. Journal of the ACM, 22(3), 329-340. https://doi.org/10.1145/321892.321894

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct