A Church-Turing thesis for randomness?
From MaRDI portal
Publication:2117785
Cites work
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 3489017 (Why is no real title available?)
- scientific article; zbMATH DE number 5064956 (Why is no real title available?)
- scientific article; zbMATH DE number 3349336 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- A unified approach to the definition of random sequences
- Algorithmic Randomness
- Algorithmic randomness and Fourier analysis
- Algorithmic randomness and complexity.
- Computability and Randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Difference randomness
- Ergodic-Type Characterizations of Algorithmic Randomness
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- On analogues of the Church-Turing thesis in algorithmic randomness
- Randomness and differentiability
- Randomness and non-ergodic systems
- Randomness on computable probability spaces -- a dynamical point of view
- Schnorr randomness
- The axiomatization of randomness
- The definition of random sequences
- The equivalence of definitions of algorithmic randomness
- Truth-table Schnorr randomness and truth-table reducible randomness
- Uniform van Lambalgen's theorem fails for computable randomness
- Van Lambalgen's theorem and high degrees
- Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
Cited in
(2)
This page was built for publication: A Church-Turing thesis for randomness?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117785)
