z-logo
open-access-imgOpen Access
Genericity and UD-random reals
Author(s) -
Wesley Calvert,
Johan. Y. Franklin
Publication year - 2015
Publication title -
journal of logic and analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.278
H-Index - 4
ISSN - 1759-9008
DOI - 10.4115/jla.2015.7.4
Subject(s) - modulo , randomness , mathematics , discrete mathematics , turing , combinatorics , computer science , statistics , programming language
Avigad introduced the notion of UD-randomness based in Weyl's 1916 definition of uniform distribution modulo one.  We prove that there exists a weakly 1-random real that is neither UD-random nor weakly 1-generic.  We also show that no 2-generic real can Turing compute a UD-random real.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom