The equivalence of definitions of algorithmic randomness

DOI10.1093/PHILMAT/NKAA039MaRDI QIDQ5067708zbMATH OpenOpenAlexFDO

Authors Christopher P. Porter

Publication date 4 April 2022

Published in Philosophia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/philmat/nkaa039

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• On analogues of the Church-Turing thesis in algorithmic randomness
• scientific article; zbMATH DE number 4119313
• Do stronger definitions of randomness exist?
• A glimpse into algorithmic information theory
• scientific article; zbMATH DE number 6019530

Cited in

(7)

• Revisiting Chaitin's incompleteness theorem
• A Church-Turing thesis for randomness?
• On two mathematical definitions of observational equivalence: manifest isomorphism and \(\varepsilon\)-congruence reconsidered
• Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
• A relation between correctness and randomness in the computation of probabilistic algorithms
• Ergodic-Type Characterizations of Algorithmic Randomness
• On analogues of the Church-Turing thesis in algorithmic randomness

This page was built for publication: The equivalence of definitions of algorithmic randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067708)