Classes
- Recursion 2NTIN074 | Faculty of Mathematics and Physics
- Algorithmic RandomnessNTIN088 | Faculty of Mathematics and Physics
- Algorithmic Randomness 2NTIN089 | Faculty of Mathematics and Physics
- ComputabilityNTIN064 | Faculty of Mathematics and Physics
- Computability 2NTIN065 | Faculty of Mathematics and Physics
- RecursionNTIN073 | Faculty of Mathematics and Physics
Publications
- Coherent randomness tests and computing the K-trivial sets2016 | Faculty of Mathematics and Physics
- DEMUTH'S PATH TO RANDOMNESS2015 | Faculty of Mathematics and Physics
- COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS2014 | Faculty of Mathematics and Physics
- Demuth's Path to Randomness2012 | Faculty of Mathematics and Physics
- K-Triviality, Oberwolfach Randomness, and Differentiability2012 | Faculty of Mathematics and Physics
- Demuth randomness and computational complexity2011 | Faculty of Mathematics and Physics
- Low Upper Bounds of Ideals2009 | Faculty of Mathematics and Physics
- Randomness and Recursive Enumerability2001 | Faculty of Mathematics and Physics
- Randomness in Computability Theory2000 | Faculty of Mathematics and Physics
- Lowness for the class of random sets1999 | Faculty of Mathematics and Physics
Loading network view...