USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS.

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable functions. The corresponding randomness notions are slightl...

Full description

Bibliographic Details

Published in:	Bulletin of Symbolic Logic Vol. 22; no. 3; pp. 305 - 332
Main Authors:	MIYABE, KENSHI, NIES, ANDRÉ, ZHANG, JING
Format:	Article
Published:	Cambridge University Press Sep2016
Subjects:	Ergodic theory Random data (Statistics) Random effects model Birkhoff's theorem (Relativity) Relativistic theorems (Relativity) Random dynamical systems
Online Access:	View this record in EBSCOhost