On relative randomness
In algorithmic complexity theory, an element is declared random iff it does not belong to any constructive set of measure 0. In particular, ``relative randomness is defined as follows. Assume that an infinite binary sequence \(\alpha\) is given. By an \(\alpha\)-algorithm, we mean an algorithm that uses \(\alpha\) as an oracle. An interval \(I\) on a set of all binary sequences is a set of all sequences \(\beta\) that start with a given finite sequence \(\beta_ 1 \dots \beta_ p\). The measure \(\mu\) is defined as follows: for each interval \(I\) determined by a sequence \(\beta_ 1 \dots \beta_ p\), the measure \(\mu(I)\) of this intervals is \(2^{-p}\). We say that a set \(S\) of infinite binary sequences has \(\alpha\)-constructive measure 0, if there exists an \(\alpha\)-algorithm that for every \(n\), generates a sequence \(I_{mn}\) of intervals such that \(S \subseteq I_ n=\cup_ mI_{mn}\), and \(\mu(I_ n) \leq 2^{- n}\). A sequence \(\beta\) is called \(\alpha\)-random (or, to be more precise, \(\alpha-1\)-random) if it does not belong to any set of \(\alpha\)- constructive measure 0 (or, equivalently, for which the one-element set \(\{\beta\}\) is not of \(\alpha\)-constructive measure 0). Crudely speaking, if \(\beta\) is \(\alpha\)-random, this means in particular, that knowing \(\alpha\) will not help in computing \(\beta\). A natural question is: does this also mean that knowing \(\beta\) does not help in computing \(\alpha\)? This question was raised by M. van Lambalgen and D. Zambella. The author provides the following answer: there exist \(\alpha\) and \(\beta\) such that \(\beta\) is \(\alpha\)-random while \(\alpha\) is recursive in \(\beta\). Other results on relative randomness are also proved.
- Algorithms and Randomness
- Classical recursion theory. The theory of functions and sets of natural numbers
- scientific article; zbMATH DE number 4156423 (Why is no real title available?)
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1142293 (Why is no real title available?)
- scientific article; zbMATH DE number 3995657 (Why is no real title available?)
- scientific article; zbMATH DE number 4118353 (Why is no real title available?)
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- The axiomatization of randomness
- The definition of random sequences
- Von Mises' definition of random sequences reconsidered
- ∏ 0 1 Classes and Degrees of Theories
- Optimal redundancy in computations from random oracles
- Randomness relative to Cantor expansions
- Unified characterizations of lowness properties via Kolmogorov complexity
- Lowness properties and randomness
- On elementary computability-theoretic properties of algorithmic randomness
- Randomness for non-computable measures
- Separations of non-monotonic randomness notions
- Computuing K-trivial sets by incomplete random sets
- Algorithmically random universal algebras
- Truth-table Schnorr randomness and truth-table reducible randomness
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- scientific article; zbMATH DE number 4176096 (Why is no real title available?)
- Mass Problems and Randomness
- Randomness and Computability: Open Questions
- Calibrating Randomness
- On Empirical Meaning of Randomness with Respect to a Real Parameter
- scientific article; zbMATH DE number 4041257 (Why is no real title available?)
- scientific article; zbMATH DE number 4054673 (Why is no real title available?)
- Propagation of partial randomness
- scientific article; zbMATH DE number 1064112 (Why is no real title available?)
- scientific article; zbMATH DE number 1531917 (Why is no real title available?)
- Strong jump-traceability
- scientific article; zbMATH DE number 4119313 (Why is no real title available?)
- scientific article; zbMATH DE number 758020 (Why is no real title available?)
- Trivial Reals
- Lowness for the class of random sets
- Turing incomparability in Scott sets
- Randomness, relativization and Turing degrees
- Randomness in post-selected events
- Algorithmic randomness and monotone complexity on product space
- A measure-theoretic proof of Turing incomparability
- Comparing notions of randomness
- Random non-cupping revisited
- Relative randomness and cardinality
This page was built for publication: On relative randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688792)