Characterizing strong randomness via Martin-Löf randomness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing strong randomness via Martin-Löf randomness

We introduce two methods to characterize strong randomness notions via Martin-Löf randomness. By applying these methods, we investigate ∅′-Schnorr randomness.

متن کامل

Pointed computations and Martin-Löf randomness

Schnorr showed that a real X is Martin-Löf random if and only if K(X ↾n) ≥ n − c for some constant c and all n, where K denotes the prefix-free complexity function. Fortnow (unpublished) and Nies, Stephan and Terwijn [NST05] observed that the condition K(X ↾n) ≥ n− c can be replaced with K(X ↾rn ) ≥ rn − c, for any fixed increasing computable sequence (rn), in this characterization. The purpose...

متن کامل

Martin-Löf randomness and Galton-Watson processes

The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton–Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...

متن کامل

Applications of Effective Probability Theory to Martin-Löf Randomness

We pursue the study of the framework of layerwise computability introduced in [HR09a] and give three applications. (i) We prove a general version of Birkhoff’s ergodic theorem for random points, where the transformation and the observable are supposed to be effectively measurable instead of computable. This result significantly improves [V’y97, Nan08]. (ii) We provide a general framework for de...

متن کامل

Martin-LöF Randomness in Spaces of Closed Sets

Algorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ω ([2] and [8]). In this paper we use the probability theory of closed set-valued random variables (RACS) to extend the definition of Martin-Löf randomness to spaces of closed subsets of locally compact, Haus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2012

ISSN: 0168-0072

DOI: 10.1016/j.apal.2011.08.006