![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Rupert Hölzl 0001
Person information
- affiliation: Bundeswehr University Munich, Institute for Theoretical Computer Science, Germany
Other persons with the same name
- Rupert Hölzl 0002 — University of Mannheim, Department of Psychology, Germany
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j16]Rupert Hölzl, Christopher P. Porter:
Degrees of Randomized Computability. Bull. Symb. Log. 28(1): 27-70 (2022) - 2020
- [j15]Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller
, Frank Stephan
, Liang Yu:
Chaitin's ω as a continuous function. J. Symb. Log. 85(1): 486-510 (2020)
2010 – 2019
- 2019
- [j14]Rupert Hölzl, Christopher P. Porter:
Rank and Randomness. J. Symb. Log. 84(4): 1527-1543 (2019) - [i4]Rupert Hölzl, Christopher P. Porter:
Degrees of Randomized Computability. CoRR abs/1907.07815 (2019) - 2018
- [j13]Rupert Hölzl, Sanjay Jain
, Frank Stephan
:
Learning pattern languages over groups. Theor. Comput. Sci. 742: 66-81 (2018) - 2017
- [j12]Rupert Hölzl, Christopher P. Porter:
Randomness for computable measures and initial segment complexity. Ann. Pure Appl. Log. 168(4): 860-886 (2017) - [j11]Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer:
Randomness and Semimeasures. Notre Dame J. Formal Log. 58(3): 301-328 (2017) - [c13]Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan:
Automatic Learning from Repetitive Texts. ALT 2017: 129-150 - [c12]Rupert Hölzl, Dilip Raghavan, Frank Stephan
, Jing Zhang:
Weakly Represented Families in Reverse Mathematics. Computability and Complexity 2017: 160-187 - [c11]Vasco Brattka
, Guido Gherardi, Rupert Hölzl, Arno Pauly
:
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity 2017: 188-200 - [c10]Vasco Brattka
, Rupert Hölzl, Rutger Kuyper:
Monte Carlo Computability. STACS 2017: 17:1-17:14 - 2016
- [j10]Rupert Hölzl, Sanjay Jain, Frank Stephan
:
Inductive inference and reverse mathematics. Ann. Pure Appl. Log. 167(12): 1242-1266 (2016) - [j9]Rupert Hölzl, Frank Stephan
, Liang Yu:
On Martin's pointed tree theorem. Comput. 5(2): 147-157 (2016) - [c9]Rupert Hölzl, Sanjay Jain, Frank Stephan
:
Learning Pattern Languages over Groups. ALT 2016: 189-203 - [i3]Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR abs/1605.03354 (2016) - 2015
- [j8]Rupert Hölzl, Paul Shafer:
Universality, optimality, and randomness deficiency. Ann. Pure Appl. Log. 166(10): 1049-1069 (2015) - [j7]Vasco Brattka
, Guido Gherardi, Rupert Hölzl:
Probabilistic computability and choice. Inf. Comput. 242: 249-286 (2015) - [c8]Vasco Brattka
, Guido Gherardi, Rupert Hölzl:
Las Vegas Computability and Algorithmic Randomness. STACS 2015: 130-142 - [c7]Rupert Hölzl, Sanjay Jain, Frank Stephan
:
Inductive Inference and Reverse Mathematics. STACS 2015: 420-433 - 2014
- [j6]Rupert Hölzl, Thorsten Kräling, Frank Stephan
, Guohua Wu:
Initial segment complexities of randomness notions. Inf. Comput. 234: 57-67 (2014) - [j5]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
, André Nies
:
Denjoy, Demuth and density. J. Math. Log. 14(1): 1450004 (2014) - 2013
- [j4]George Barmpalias
, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle:
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113(5-6): 171-178 (2013) - [j3]Laurent Bienvenu, Adam R. Day, Rupert Hölzl:
From bi-immunity to absolute undecidability. J. Symb. Log. 78(4): 1218-1228 (2013) - [j2]Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52(1): 80-94 (2013) - [i2]Vasco Brattka, Rupert Hölzl, Guido Gherardi:
Probabilistic Computability and Choice. CoRR abs/1312.7305 (2013) - 2012
- [j1]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012) - [c6]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
, André Nies
:
The Denjoy alternative for computable functions. STACS 2012: 543-554 - 2010
- [c5]Rupert Hölzl, Thorsten Kräling, Frank Stephan
, Guohua Wu:
Initial Segment Complexities of Randomness Notions. IFIP TCS 2010: 259-270 - [c4]Rupert Hölzl, Wolfgang Merkle:
Traceable Sets. IFIP TCS 2010: 301-315
2000 – 2009
- 2009
- [c3]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of Non-monotonic Randomness Notions. CCA 2009 - [c2]Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS 2009: 392-402 - [i1]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009) - 2008
- [c1]Rupert Hölzl, Wolfgang Merkle:
Generation Complexity Versus Distinction Complexity. TAMC 2008: 457-466
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint