Rupert Hölzl

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The computational content of multidimensional discontinuity Annals of Pure and Applied Logic	2026-02-12	Paper
Regainingly approximable numbers and sets The Journal of Symbolic Logic	2026-02-12	Paper
Improved lower bounds for strong n-conjectures Journal of the Australian Mathematical Society	2025-07-08	Paper
Computable classifications of continuous, transducer, and regular functions Theoretical Computer Science	2025-02-26	Paper
Degrees of randomized computability The Bulletin of Symbolic Logic	2022-04-04	Paper
Computable classifications of continuous, transducer, and regular functions	2020-10-19	Paper
Chaitin's \(\Omega\) as a continuous function Journal of Symbolic Logic	2020-04-17	Paper
Rank and randomness Journal of Symbolic Logic	2020-01-10	Paper
Automatic learning from repetitive texts	2019-01-10	Paper
Learning pattern languages over groups Theoretical Computer Science	2018-08-22	Paper
Monte Carlo computability	2018-04-19	Paper
Randomness and semimeasures Notre Dame Journal of Formal Logic	2017-08-17	Paper
Randomness and semimeasures Notre Dame Journal of Formal Logic	2017-08-17	Paper
Randomness and semimeasures Notre Dame Journal of Formal Logic	2017-08-17	Paper
The Vitali Covering Theorem in the Weihrauch Lattice Computability and Complexity	2017-04-04	Paper
The Vitali Covering Theorem in the Weihrauch Lattice Computability and Complexity	2017-04-04	Paper
Weakly represented families in reverse mathematics Computability and Complexity	2017-04-04	Paper
Randomness for computable measures and initial segment complexity Annals of Pure and Applied Logic	2017-02-08	Paper
Inductive Inference and Reverse Mathematics	2017-01-24	Paper
Las Vegas computability and algorithmic randomness	2017-01-24	Paper
Learning pattern languages over groups Lecture Notes in Computer Science	2016-11-09	Paper
Inductive inference and reverse mathematics Annals of Pure and Applied Logic	2016-10-10	Paper
On Martin’s pointed tree theorem Computability	2016-07-25	Paper
Universality, optimality, and randomness deficiency Annals of Pure and Applied Logic	2015-06-30	Paper
Probabilistic computability and choice Information and Computation	2015-06-01	Paper
Denjoy, Demuth and density Journal of Mathematical Logic	2014-09-05	Paper
From bi-immunity to absolute undecidability Journal of Symbolic Logic	2014-04-04	Paper
From bi-immunity to absolute undecidability Journal of Symbolic Logic	2014-04-04	Paper
Initial segment complexities of randomness notions Information and Computation	2014-02-11	Paper
Time-bounded Kolmogorov complexity and Solovay functions Theory of Computing Systems	2013-04-15	Paper
Analogues of Chaitin's Omega in the computably enumerable sets Information Processing Letters	2013-03-21	Paper
Separations of non-monotonic randomness notions	2012-09-28	Paper
Separations of non-monotonic randomness notions Journal of Logic and Computation	2012-09-05	Paper
The Denjoy alternative for computable functions	2012-08-23	Paper
Kolmogorov complexity	2011-02-25	Paper
Traceable Sets IFIP Advances in Information and Communication Technology	2010-10-27	Paper
Initial segment complexities of randomness notions IFIP Advances in Information and Communication Technology	2010-10-27	Paper
Time-Bounded Kolmogorov Complexity and Solovay Functions Mathematical Foundations of Computer Science 2009	2009-10-16	Paper
Generation Complexity Versus Distinction Complexity Lecture Notes in Computer Science	2008-05-27	Paper
Regainingly approximable numbers and sets (available as arXiv preprint)	N/A	Paper
Benign approximations and non-speedability (available as arXiv preprint)	N/A	Paper
Randomness versus superspeedability (available as arXiv preprint)	N/A	Paper
The computational content of multidimensional discontinuity (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Rupert Hölzl