UNIFORM DISTRIBUTION AND ALGORITHMIC RANDOMNESS.

A seminal theorem due to Weyl [14] States that if (a) is any sequence of distinct integers, then, for almost every x ∈ ℝ, the sequence (ax) is uniformly distributed modulo one. In particular, for almost every x tu the unit interval, the sequence (ax) is uniformly distributed modulo one for every con...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 78; no. 1; pp. 334 - 345
Autor principal: AVIGAD, JEREMY
Formato: Artículo
Publicado: Cambridge University Press Mar2013
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario:A seminal theorem due to Weyl [14] States that if (a) is any sequence of distinct integers, then, for almost every x ∈ ℝ, the sequence (ax) is uniformly distributed modulo one. In particular, for almost every x tu the unit interval, the sequence (ax) is uniformly distributed modulo one for every conspusable sequence (a) of distinct integers. Call such an x UD random. Here it is shown that every Schnorr random real is UD random, but there are Kurtz random reals that are not UD random. On the other hand, Weyl's theorem still holds relative to a particular effectively closed null set, so there are UD random reals that are not Kurtz random.