Classes
- ComputabilityNTIN064 | Faculty of Mathematics and Physics
- Algorithmic RandomnessNTIN088 | Faculty of Mathematics and Physics
- Computability 2NTIN065 | Faculty of Mathematics and Physics
- RecursionNTIN073 | Faculty of Mathematics and Physics
- Recursion 2NTIN074 | Faculty of Mathematics and Physics
- Algorithmic Randomness 2NTIN089 | 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
- Joining non-low C.E. sets with diagonally non-computable functions2013 | 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
- Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 20072007 | Faculty of Mathematics and Physics
- Turing incomparability in Scott sets2007 | Faculty of Mathematics and Physics
Loading network view...