Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
We consider the notion of algorithmic randomness relative to an oracle. We prove 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. Indeed, we prove that β is exactly as random as the halting probability of a universal machine equipped with an oracle for the second jump of the halting problem, in spite of the fact that β is defined without considering oracles.
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
John S. Lew
Mathematical Biosciences
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998