Affiliation:
1. Department of Mathematics, University of Notre Dame, 255 Hurley Bldg Notre Dame, IN 46556, USA. jmille74@nd.edu
Abstract
Given any 1-random set X and any r in ( 0 , 1 ), we construct a set of intrinsic density r which is computable from both r and X. For almost all r, this set will be the first known example of an intrinsic density r set which cannot compute any r-Bernoulli random set. To achieve this, we shall formalize the into and within noncomputable coding methods which work well with intrinsic density.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference6 articles.
1. K. Ambos-Spies, Algorithmic randomness revisited, in: Language, Logic and Formalization of Knowledge, Coimbra Lecture and Proceedings of a Symposium Held in Siena, 1997.
2. Asymptotic density, immunity, and randomness;Astor;Computability,2015
3. Generic computability, Turing degrees, and asymptotic density;Jockusch;Journal of the London Mathematical Society,2012
4. R.G. Downey and D.R. Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, 2010.
5. A. Nies, Computability and Randomness, Oxford Logic Guides, Oxford University Press, 2009.