Rupert Hölzl

According to our database, Rupert Hölzl authored at least 25 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Randomness Versus Superspeedability.

Rupert Hölzl, Philip Janicki, Wolfgang Merkle, Frank Stephan

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2022

Degrees of Randomized Computability.

Rupert Hölzl, Christopher P. Porter

Bull. Symb. Log., 2022

2020

Chaitin's ω as a continuous function.

Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu

J. Symb. Log., 2020

2019

Rank and Randomness.

Rupert Hölzl, Christopher P. Porter

J. Symb. Log., 2019

2018

Learning pattern languages over groups.

Rupert Hölzl, Sanjay Jain, Frank Stephan

Theor. Comput. Sci., 2018

2017

Randomness and Semimeasures.

Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer

Notre Dame J. Formal Log., 2017

Randomness for computable measures and initial segment complexity.

Rupert Hölzl, Christopher P. Porter

Ann. Pure Appl. Log., 2017

Monte Carlo Computability.

Vasco Brattka, Rupert Hölzl, Rutger Kuyper

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Weakly Represented Families in Reverse Mathematics.

Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang

Proceedings of the Computability and Complexity, 2017

The Vitali Covering Theorem in the Weihrauch Lattice.

Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly

Proceedings of the Computability and Complexity, 2017

Automatic Learning from Repetitive Texts.

Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

On Martin's pointed tree theorem.

Rupert Hölzl, Frank Stephan, Liang Yu

Comput., 2016

Inductive inference and reverse mathematics.

Rupert Hölzl, Sanjay Jain, Frank Stephan

Ann. Pure Appl. Log., 2016

2015

Probabilistic computability and choice.

Vasco Brattka, Guido Gherardi, Rupert Hölzl

Inf. Comput., 2015

Universality, optimality, and randomness deficiency.

Rupert Hölzl, Paul Shafer

Ann. Pure Appl. Log., 2015

Las Vegas Computability and Algorithmic Randomness.

Vasco Brattka, Guido Gherardi, Rupert Hölzl

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Denjoy, Demuth and density.

Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies

J. Math. Log., 2014

Initial segment complexities of randomness notions.

Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu

Inf. Comput., 2014

2013

Time-Bounded Kolmogorov Complexity and Solovay Functions.

Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle

Theory Comput. Syst., 2013

From bi-immunity to absolute undecidability.

Laurent Bienvenu, Adam R. Day, Rupert Hölzl

J. Symb. Log., 2013

Analogues of Chaitin's Omega in the computably enumerable sets.

George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle

Inf. Process. Lett., 2013

2012

Separations of non-monotonic randomness notions.

Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle

J. Log. Comput., 2012

The Denjoy alternative for computable functions.

Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2010

Traceable Sets.

Rupert Hölzl, Wolfgang Merkle

Proceedings of the Theoretical Computer Science, 2010

2008

Generation Complexity Versus Distinction Complexity.

Rupert Hölzl, Wolfgang Merkle

Proceedings of the Theory and Applications of Models of Computation, 2008