Computability and Randomness

DOI10.1090/NOTI1905MaRDI QIDQ5238714zbMATH OpenOpenAlexFDO

Authors Denis R. Hirschfeldt, Rodney G. Downey

Publication date 28 October 2019

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/noti1905

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited in

(9)

• Complexity-based permutation entropies: from deterministic time series to white noise
• Extending the reach of the point-to-set principle
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Algorithmic dimensions via learning functions

This page was built for publication: Computability and Randomness

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