scientific article; zbMATH DE number 5264766
zbMATH Open1140.68407MaRDI QIDQ5458618FDOQ5458618
Authors: Nenad Mihailovic
Publication date: 16 April 2008
Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2007/7786/
Title of this publication is not available (Why is that?)
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
Lebesgue measureKolmogorov complexitycomputable randomnesslownesscomputably enumerablerandom realsbounded machinesbounded tests
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Cited In (12)
- Title not available (Why is that?)
- Randomness for non-computable measures
- Separations of non-monotonic randomness notions
- A survey of Mučnik and Medvedev degrees
- Automata, Languages and Programming
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
- Some results on effective randomness
- Algorithmic Randomness
- Five lectures on algorithmic randomness
- On elementary computability-theoretic properties of algorithmic randomness
- Probabilistic Algorithmic Randomness
- Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence
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)