485 citations
- Technical University of MunichDE35 papers
- Ludwig-Maximilians-Universität MünchenDE29 papers
- RWTH Aachen UniversityDE19 papers
- Trinity College DublinIE16 papers
- Centre National de la Recherche ScientifiqueFR13 papers
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE11 papers
- University of Cape TownZA10 papers
- Advanced Materials and BioEngineering ResearchIE8 papers
- AMO (Germany)DE7 papers
- University of TwenteNL7 papers
- KTH Royal Institute of TechnologySE6 papers
- LMU KlinikumDE6 papers
Showing 2015 · math.LOShow all
2 papers · 2 filters
math.LO2015★ 4 cited
Randomness for computable measures and initial segment complexity
Rupert Hölzl, Christopher P. Porter
We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on , the so-called pro…
math.LO2015★ 13 cited
On the Uniform Computational Content of Computability Theory
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of th…