Representation of left-computable \(\varepsilon \)-random reals (Q716316): Difference between revisions

From the authors' abstract: ``We introduce the notion of \(\varepsilon \)-universal prefix-free Turing machine (\(\varepsilon \) is a computable real in \((0,1]\)) and study its halting probability. The main result is the extension of the representability theorem for left-computable random reals to the case of \(\epsilon \)-random reals: a real is left-computable \(\varepsilon \)-random iff it is the halting probability of an \(\varepsilon \)-universal prefix-free Turing machine. We also show that left-computable \(\varepsilon \)-random reals are provable \(\varepsilon \)-random in Peano arithmetic.''