A Church-Turing thesis for randomness?
From MaRDI portal
Publication:2117785
DOI10.1007/978-3-030-80049-9_20OpenAlexW3186627901MaRDI QIDQ2117785FDOQ2117785
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_20
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Randomness and Complexity
- A Theory of Program Size Formally Identical to Information Theory
- The definition of random sequences
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Randomness and non-ergodic systems
- Truth-table Schnorr randomness and truth-table reducible randomness
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
- Schnorr randomness
- Randomness on computable probability spaces -- a dynamical point of view
- Computability and Randomness
- A unified approach to the definition of random sequences
- Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
- Difference randomness
- Ergodic-Type Characterizations of Algorithmic Randomness
- The axiomatization of randomness
- Algorithmic randomness and Fourier analysis
- Van Lambalgen's theorem and high degrees
- ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
- Randomness and differentiability
- Algorithmic Randomness
- Uniform van Lambalgen's theorem fails for computable randomness
- The Equivalence of Definitions of Algorithmic Randomness†
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
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)
