Equivalent characterizations of partial randomness for a recursively enumerable real
Abstract
A real number α is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to α. The randomness of a recursively enumerable real α can be characterized in various ways using each of the notions; program-size complexity, Martin-L\"of test, Chaitin's number, the domination and -likeness of α, the universality of a computable, increasing sequence of rational numbers which converges to α, and universal probability. In this paper, we generalize these characterizations of randomness over the notion of partial randomness by parameterizing each of the notions above by a real number T∈(0,1]. We thus present several equivalent characterizations of partial randomness for a recursively enumerable real number.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.