The Probability of a Computable Output from a Random Oracle

  title={The Probability of a Computable Output from a Random Oracle},
  author={George Barmpalias and Douglas A. Cenzer and Christopher P. Porter},
  journal={ACM Transactions on Computational Logic (TOCL)},
  pages={1 - 15}
Consider a universal oracle Turing machine that prints a finite or an infinite binary sequence, based on the answers to the binary queries that it makes during the computation. We study the probability that this output is infinite and computable when the machine is given a random (in the probabilistic sense) stream of bits as the answers to its queries during an infinitary computation. Surprisingly, we find that these probabilities are the entire class of real numbers in (0,1) that can be… 
Aspects of Chaitin's Omega
The purpose of this survey is to expose developments and tell a story about Omega, which outlines its multifaceted mathematical properties and roles in algorithmic randomness.
It is proved that the continuous function $X:2^\omega \to $ for all $X is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic.


Random numbers as probabilities of machine behavior
A Highly Random Number
It is proved that α is a random number that goes beyond Ω, the probability that a universal self delimiting machine halts, and similar to the algorithmic complexity of Ω', the halting probability of an oracle machine.
Differences of halting probabilities
Randomness and halting probabilities
It follows that for any optimal machine U and any sufficiently small real r, there is a set X ⊆ 2≤ω recursive in ∅′ ⊕ r, such that ΩU[X] = r.
From index sets to randomness in ∅n: random reals and possibly infinite computations part II
A large class of significant examples of n-random reals (i.e., Martin-Löf random in oracle ∅(n−1)) à la Chaitin are obtained and methods to transfer many-one completeness results of index sets to n- randomness of associated probabilities are developed.
Another Example of Higher Order Randomness
It is proved that the probability β that a program for infinite computations (a program that never halts) outputs a cofinite set is random in the second jump of the halting problem.
Series Recursively Enumerable Reals and Chaitin Numbers
A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting probability of a universal selfdelimiting Turing machine (Chaitin's
Randomness and Computability
The two approaches that have been used to define randomness on Cantor space for non-computable measures: that of Reimann and Slaman, along with the uniform test approach first introduced by Levin and also used by Gacs, Hoyrup and Rojas, are equivalent.
The Definition of Random Sequences
Using random sets as oracles
It is shown that the bases for 1‐randomness are exactly the K‐trivial sets, and several consequences of this result are discussed.