Rupert Hölzl
Rupert Hölzl
Universität der Bundeswehr München
Verified email at hoelzl.fr - Homepage
Title
Cited by
Cited by
Year
Probabilistic computability and choice
V Brattka, G Gherardi, R Hölzl
Information and Computation 242, 249-286, 2015
582015
Denjoy, Demuth and density
L Bienvenu, R Hölzl, JS Miller, A Nies
Journal of Mathematical Logic 14 (01), 1450004, 2014
262014
Time-bounded Kolmogorov complexity and Solovay functions
R Hölzl, T Kräling, W Merkle
Mathematical Foundations of Computer Science 2009, 392-402, 2009
242009
The Denjoy alternative for computable functions
L Bienvenu, R Hölzl, J Miller, A Nies
172011
The Vitali covering theorem in the Weihrauch lattice
V Brattka, G Gherardi, R Hölzl, A Pauly
Computability and Complexity, 188-200, 2017
122017
Las Vegas computability and algorithmic randomness
V Brattka, G Gherardi, R Hölzl
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
122015
From bi-immunity to absolute undecidability
L Bienvenu, AR Day, R Hölzl
The Journal of Symbolic Logic 78 (4), 1218-1228, 2009
122009
Monte Carlo Computability
V Brattka, R Hölzl, R Kuyper
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017
112017
Randomness and semimeasures
L Bienvenu, R Hölzl, CP Porter, P Shafer
Notre Dame Journal of Formal Logic 58 (3), 301-328, 2017
112017
Separations of non-monotonic randomness notions
L Bienvenu, R Hölzl, T Kräling, W Merkle
Journal of Logic and Computation 22 (4), 701-715, 2010
102010
Separations of non-monotonic randomness notions
L Bienvenu, R Hölzl, T Kraling, W Merkle
Arxiv preprint arXiv:0907.2324, 2009
102009
Analogues of Chaitinʼs Omega in the computably enumerable sets
G Barmpalias, R Hölzl, AEM Lewis, W Merkle
Information Processing Letters 113 (5-6), 171-178, 2013
92013
Analogues of Chaitinʼs Omega in the computably enumerable sets
G Barmpalias, R Hölzl, AEM Lewis, W Merkle
Information Processing Letters 113 (5-6), 171-178, 2013
92013
Traceable sets
R Hölzl, W Merkle
Theoretical Computer Science, 301-315, 2010
82010
Probabilistic Computability and Choice. arXiv 1312.7305
V Brattka, G Gherardi, R Hölzl
62013
Time-Bounded Kolmogorov Complexity and Solovay Functions
R Hölzl, T Kräling, W Merkle
Theory of Computing Systems 52 (1), 80-94, 2013
62013
Learning pattern languages over groups
R Hölzl, S Jain, F Stephan
Theoretical Computer Science 742, 66-81, 2018
52018
Universality, optimality, and randomness deficiency
R Hölzl, P Shafer
arXiv preprint arXiv:1409.8589, 2014
52014
Randomness for computable measures and initial segment complexity
R Hölzl, CP Porter
Annals of Pure and Applied Logic 168 (4), 860-886, 2017
42017
Initial segment complexities of randomness notions
R Hölzl, T Kräling, F Stephan, G Wu
Theoretical Computer Science, 259-270, 2010
42010
The system can't perform the operation now. Try again later.
Articles 1–20