scientific article; zbMATH DE number 5264766

MaRDI QIDQ5458618zbMATH OpenFDO

Authors Nenad Mihailovic

Publication date 16 April 2008

Full work available at URL http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2007/7786/

zbMATH Keywords

bounded machinesbounded testscomputable randomnesscomputably enumerableKolmogorov complexityLebesgue measurelownessrandom reals

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Probabilistic Algorithmic Randomness
• scientific article; zbMATH DE number 4020074
• Algorithms and Randomness
• scientific article; zbMATH DE number 4113619
• scientific article; zbMATH DE number 5057386
• scientific article; zbMATH DE number 1182927
• scientific article; zbMATH DE number 819814
• scientific article; zbMATH DE number 3930719

Cited in

(13)

• Some results on effective randomness
• On elementary computability-theoretic properties of algorithmic randomness
• Randomness for non-computable measures
• A survey of Mučnik and Medvedev degrees
• Separations of non-monotonic randomness notions
• Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
• Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
• Five lectures on algorithmic randomness
• On Languages Reducible to Algorithmically Random Languages
• scientific article; zbMATH DE number 4113619 (Why is no real title available?)
• Algorithmic Randomness
• Probabilistic Algorithmic Randomness
• Automata, Languages and Programming

This page was built for publication:

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