ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS

DOI10.1017/S1755020316000113zbMath1393.03023MaRDI QIDQ5737950

Christopher P. Porter

Publication date: 31 May 2017

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (2)

Revisiting Chaitin's incompleteness theorem ⋮ A Church-Turing thesis for randomness?

Cites Work

• Unnamed Item
• Unnamed Item
• A separation of two randomness concepts
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• The perception of randomness
• Characterization of Kurtz randomness by a differentiation theorem
• Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
• An Application of Martin-Löf Randomness to Effective Probability Theory
• Probabilities over rich languages, testing and randomness
• A unified approach to the definition of random sequences
• The definition of random sequences
• Algorithmic information theory and undecidability

This page was built for publication: ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS