Rupert Hölzl

Available identifiers

zbMath Open holzl.rupertMaRDI QIDQ324249

List of research outcomes

Publication	Date of Publication	Type
DEGREES OF RANDOMIZED COMPUTABILITY	2022-04-04	Paper
Computable classifications of continuous, transducer, and regular functions	2020-10-19	Paper
CHAITIN’S Ω AS A CONTINUOUS FUNCTION	2020-04-17	Paper
RANK AND RANDOMNESS	2020-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4645642	2019-01-10	Paper
Learning pattern languages over groups	2018-08-22	Paper
Monte Carlo Computability	2018-04-19	Paper
Randomness and semimeasures	2017-08-17	Paper
Weakly Represented Families in Reverse Mathematics	2017-04-04	Paper
The Vitali Covering Theorem in the Weihrauch Lattice	2017-04-04	Paper
Randomness for computable measures and initial segment complexity	2017-02-08	Paper
Las Vegas Computability and Algorithmic Randomness	2017-01-24	Paper
Inductive Inference and Reverse Mathematics	2017-01-24	Paper
Learning Pattern Languages over Groups	2016-11-09	Paper
Inductive inference and reverse mathematics	2016-10-10	Paper
On Martin’s pointed tree theorem	2016-07-25	Paper
Universality, optimality, and randomness deficiency	2015-06-30	Paper
Probabilistic computability and choice	2015-06-01	Paper
Denjoy, Demuth and density	2014-09-05	Paper
From Bi-Immunity to Absolute Undecidability	2014-04-04	Paper
Initial segment complexities of randomness notions	2014-02-11	Paper
Time-bounded Kolmogorov complexity and Solovay functions	2013-04-15	Paper
Analogues of Chaitin's Omega in the computably enumerable sets	2013-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q2917340	2012-09-28	Paper
Separations of non-monotonic randomness notions	2012-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q2904792	2012-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q3076855	2011-02-25	Paper
Initial Segment Complexities of Randomness Notions	2010-10-27	Paper
Traceable Sets	2010-10-27	Paper
Time-Bounded Kolmogorov Complexity and Solovay Functions	2009-10-16	Paper
Generation Complexity Versus Distinction Complexity	2008-05-27	Paper
Regainingly approximable numbers and sets	0001-01-03	Paper
Benign approximations and non-speedability	0001-01-03	Paper
Randomness versus superspeedability	0001-01-03	Paper
The computational content of multidimensional discontinuity	0001-01-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Rupert Hölzl