/
LATENT REFERENCES / TAG1

Chaitin's Omega

This reference note belongs to Tag1 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Analysis. The note preserves its source text and links so that readers can trace the material behind the 3D map.

Collection
Tag1
Archive region
Analysis

Archived reference note

English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.

Language Add to watchlist Editing Chaitin's constant (Japanese reading: Chaitin no teisu; English: Chaitin's constant) is a concept in algorithmic information theory, a field of computer science, and informally is a real number expressing the probability that a randomly selected program halts. It emerged from Gregory Chaitin's research. Also called halting probability (Japanese reading: teishi kakuritsu; English: Halting probability). There are infinitely many halting probabilities, but they are usually represented by Ω as though they were 1. Because Ω depends on how programs are encoded, discussion without specifying an encoding scheme is sometimes called Chaitin's construction. #list

Source updated 2026-09-11 · Snapshot 2026-10-08