Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site utcsri.UUCP
Path: utzoo!utcsri!mendel
From: mendel@utcsri.UUCP (Alberto Mendelzon)
Newsgroups: net.math
Subject: Re: Omega
Message-ID: <2002@utcsri.UUCP>
Date: Sun, 26-Jan-86 19:18:53 EST
Article-I.D.: utcsri.2002
Posted: Sun Jan 26 19:18:53 1986
Date-Received: Sun, 26-Jan-86 19:19:50 EST
References: <440@faron.UUCP> <2565@pucc-h>
Reply-To: mendel@utcsri.UUCP (Alberto Mendelzon)
Distribution: net
Organization: CSRI, University of Toronto
Lines: 12
Summary: 

Consider a universal Turing machine that is fed a random
sequence of bits, e.g. by flipping a coin whenever the
machine requests another bit. Omega was defined by Gregory
Chaitin as the probability that the machine will eventually
halt. The exact value of omega depends on the particular
universal Turing machine.
Martin Gardner's relevant column in Scientific American
appeared in November 1979 (Vol 241, No. 5).
-- 
Alberto Mendelzon
utcsri!mendel
mendel@toronto