Publications, Talks, Teaching


   Journals   
P. Hertling, R. Hölzl, P. Janicki
Regainingly approximable numbers and sets
Journal of Symbolic Logic, January 2024
R. Hölzl, C. P. Porter
Degrees of randomized computability
Bulletin of Symbolic Logic, March 2022
R. Hölzl, W. Merkle, J. S. Miller, F. Stephan, Yu L.
Chaitin’s Ω as a Continuous Function
Journal of Symbolic Logic, March 2020
R. Hölzl, C. P. Porter
Rank and randomness
Journal of Symbolic Logic, December 2019
R. Hölzl, S. Jain, F. Stephan
Learning Pattern Languages Over Groups
Journal version: Theoretical Computer Science, September 2018
Conference version: Algorithmic Learning Theory, October 2016
L. Bienvenu, R. Hölzl, C. P. Porter, P. Shafer
Randomness and semi-measures
Notre Dame Journal of Formal Logic, June 2017
R. Hölzl, C. P. Porter
Randomness for computable measures and initial segment complexity
Annals of Pure and Applied Logic, April 2017
R. Hölzl, S. Jain, F. Stephan
Inductive Inference and Reverse Mathematics
Journal version: Annals of Pure and Applied Logic, December 2016
Conference version: Symposium on Theoretical Aspects of Computer Science, March 2015
R. Hölzl, F. Stephan, Yu L.
On Martin's Pointed Tree Theorem
Computability, May 2016
R. Hölzl, P. Shafer
Universality, optimality, and randomness deficiency
Annals of Pure and Applied Logic, October 2015
V. Brattka, G. Gherardi, R. Hölzl
Probabilistic Computability and Choice
Information and Computation, June 2015
L. Bienvenu, R. Hölzl, J. S. Miller, A. Nies
Denjoy, Demuth and Density
Journal version: Journal of Mathematical Logic, June 2014
Conference version: Symposium on Theoretical Aspects of Computer Science, March 2012
R. Hölzl, T. Kräling, F. Stephan, Wu G.
Initial Segment Complexities of Randomness Notions
Journal version: Information and Computation, February 2014
Conference version: Theoretical Computer Science, September 2010
L. Bienvenu, A. D. Day, R. Hölzl
From Bi-immunity to Absolute Undecidability
Journal of Symbolic Logic, December 2013
G. Barmpalias, R. Hölzl, A. E. M. Lewis, W. Merkle
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters, January 2013
R. Hölzl, T. Kräling, W. Merkle
Time-bounded Kolmogorov complexity and Solovay functions
Journal version: Theory of Computing Systems, January 2013
Conference version: Mathematical Foundations of Computer Science, August 2009
L. Bienvenu, R. Hölzl, T. Kräling, W. Merkle
Separations of non-monotonic randomness notions
Journal version: Journal of Logic and Computation, September 2010
Conference version: Computability and Complexity in Analysis, August 2009

   Book chapters   
R. Hölzl, D. Raghavan, F. Stephan, Zhang J.
Weakly Represented Families in Reverse Mathematics
Computability and Complexity, Lecture Notes in Computer Science, January 2017
V. Brattka, G. Gherardi, R. Hölzl, A. Pauly
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity, Lecture Notes in Computer Science, January 2017

   Peer‑reviewed conferences   
R. Hölzl, S. Jain, P. Schlicht, K. Seidel, F. Stephan
Automatic Learning from Repetitive Texts
Algorithmic Learning Theory, October 2017
V. Brattka, R. Hölzl, R. Kuyper
Monte Carlo Computability
Symposium on Theoretical Aspects of Computer Science, March 2017
V. Brattka, G. Gherardi, R. Hölzl
Las Vegas Computability and Algorithmic Randomness
Symposium on Theoretical Aspects of Computer Science, March 2015
R. Hölzl, W. Merkle
Traceable sets
Theoretical Computer Science, September 2010
R. Hölzl, W. Merkle
Generation complexity versus distinction complexity
Theory and Applications of Models of Computation, April 2008

   Submitted   
R. Hölzl, P. Janicki
Benign approximations and non-speedability
August 2023
J. Franklin, R. Hölzl, A. Melnikov, Ng K., D. Turetsky
Computable classifications of continuous, transducer, and regular functions
October 2022

   Selected talks   
Benign approximations and non-speedability
Invited talk at the Centre International de Rencontres Mathématiques, Luminy, February 2023
Randomness for computable measures, and complexity
Invited seminar talk at the National University of Singapore, December 2019
Special session talk at the Logic Colloquium, Leeds, August 2016
Contributed talk at Computability, Complexity & Randomness, Honolulu, January 2016
Rank and randomness
Habilitation defense at the Bundeswehr University Munich, January 2019
Invited talk at Aspects of Computation, Singapore, August 2017
Invited talk at Computability and Reducibility, Hiddensee, August 2017
Degrees of randomized computability
Invited seminar talk at the National University of Singapore, September 2018
Invited talk at Computability and Complexity in Analysis, Kochel, August 2018
Monte Carlo Computability
Invited talk at the Dagstuhl Workshop on Computability Theory, February 2017
Vitali Covering in the Weihrauch degrees
Invited seminar talk at the University of Florida, October 2015
Invited talk at Computability, Complexity & Randomness, Heidelberg, June 2015
Universality, optimality, and randomness deficiency
Invited seminar talk at the Bundeswehr University Munich, March 2015
Invited seminar talk at the University of Heidelberg, December 2014
The reverse mathematics of inductive inference
Invited seminar talk at the Universiteit Gent, August 2014
Invited seminar talk at the Bundeswehr University Munich, August 2014
Randomness in the Weihrauch degrees
Special session talk at the Logic Colloquium, Vienna, July 2014
Randomness for semi-measures
Invited talk at Analysis, Randomness and Applications, Nancy, June 2013
Absolutely undecidable sets
Invited seminar talk at the University of Greifswald, November 2016
Invited seminar talk at the University of Darmstadt, October 2013
Invited seminar talk at the Loria, Nancy, December 2012
Denjoy, Demuth and Density
Seminar talk at the Bundeswehr University Munich, March 2013
Special session talk at the 12th Asian Logic Conference, Wellington, December 2011

   Selected teaching material   
Ausgewählte Kapitel der Komplexitätstheorie
Lecture on selected topics from advanced complexity theory in German, January 2024
Quantencomputer
Short lecture on quantum computing in German, January 2024

   Other   
Article reviews
MathSciNet Mathematical Reviews
Zentralblatt MATH
Kolmogorov complexity
Doctoral dissertation, December 2010
Maß in Polynomialzeit
Diploma thesis in German, October 2006

CV

2015 + Wissenschaftlicher Mitarbeiter (E14) at the Institute for Theoretical Computer Science, Mathematics and Operations Research of the Bundeswehr University Munich.
2019 Habilitation in theoretical computer science and mathematical logic at the Bundeswehr University Munich.
2017 - 8 Visiting full professor (Vertretungsprofessur W3) at the University of Passau during the winter semester.
2014 - 5 Research Fellow at the Department of Mathematics of the National University of Singapore.
2013 Postdoctoral researcher at the Institute for Theoretical Computer Science, Mathematics and Operations Research of the Bundeswehr University Munich, funded by a Feodor Lynen Return Fellowship by the Alexander von Humboldt Foundation.
2011 - 2 Postdoctoral researcher at the Laboratoire d'Informatique Algorithmique: Fondements et Applications, funded by a Feodor Lynen Research Fellowship by the Alexander von Humboldt Foundation.
2010 Dissertation in mathematics at the University of Heidelberg.
2007 - 10 Doctoral student with Priv.-Doz. Dr. Wolfgang Merkle at the University of Heidelberg, funded by the German Research Foundation.
2007 Diplom in mathematics at the University of Heidelberg.
2001 - 7 Scholarship by the Studienstiftung des deutschen Volkes.
2004 - 5 Study abroad at the École Normale Supérieure in Paris.
2003 Vordiplom in physics at the University of Heidelberg.
1983 Born in Munich.

Member of the programme committees of Computability and Complexity in Analysis 2018 and 2024, as well as of Computability, Complexity and Randomness 2015 and 2017.

Fluent in German, English, French.

Hobbies include photography, mountaineering, and scuba diving.

Photography

Cycle mouse wheel to scroll, or use the left and right cursor keys.  On touch-enabled devices, swipe the photos horizontally.