Follow
Vasco Brattka
Vasco Brattka
Professor for Theoretical Computer Science and Mathematical Logic, Universität der Bundeswehr
Verified email at unibw.de - Homepage
Title
Cited by
Cited by
Year
A tutorial on computable analysis
V Brattka, P Hertling, K Weihrauch
New computational paradigms: changing conceptions of what is computable, 425-491, 2008
2132008
Computability on subsets of metric spaces
V Brattka, G Presser
Theoretical Computer Science 305 (1-3), 43-76, 2003
2072003
Computability on subsets of Euclidean space I: Closed and compact subsets
V Brattka, K Weihrauch
Theoretical Computer Science 219 (1-2), 65-93, 1999
1681999
Weihrauch degrees, omniscience principles and weak computability
V Brattka, G Gherardi
The Journal of Symbolic Logic 76 (1), 143-176, 2011
1552011
Effective choice and boundedness principles in computable analysis
V Brattka, G Gherardi
Bulletin of Symbolic Logic 17 (1), 73-117, 2011
1462011
Closed choice and a uniform low basis theorem
V Brattka, M De Brecht, A Pauly
Annals of Pure and Applied Logic 163 (8), 986-1008, 2012
1312012
Effective Borel measurability and reducibility of functions
V Brattka
Mathematical Logic Quarterly 51 (1), 19-44, 2005
1182005
The Bolzano–Weierstrass theorem is the jump of weak Kőnig’s lemma
V Brattka, G Gherardi, A Marcone
Annals of Pure and Applied Logic 163 (6), 623-655, 2012
1102012
Randomness and differentiability
V Brattka, JS Miller, A Nies
Transactions of the American Mathematical Society 368 (1), 581-605, 2016
1062016
Computability and analysis: the legacy of Alan Turing.
J Avigad, V Brattka, R Downey
Turing's Legacy, 1-47, 2014
902014
Feasible real random access machines
V Brattka, P Hertling
Journal of Complexity 14 (4), 490-526, 1998
891998
Recursive characterization of computable real-valued functions and relations
V Brattka
Theoretical Computer Science 162 (1), 45-77, 1996
771996
Weihrauch complexity in computable analysis
V Brattka, G Gherardi, A Pauly
Handbook of computability and complexity in analysis, 367-417, 2021
692021
Plottable real number functions and the computable graph theorem
V Brattka
SIAM Journal on Computing 38 (1), 303-328, 2008
642008
Computability over topological structures
SB Cooper, SS Goncharov, V Brattka
Computability and Models: Perspectives East and West, 93-136, 2003
642003
Probabilistic computability and choice
V Brattka, G Gherardi, R Hölzl
Information and Computation 242, 249-286, 2015
622015
Topological properties of real number representations
V Brattka, P Hertling
Theoretical Computer Science 284 (2), 241-257, 2002
602002
Computable invariance
V Brattka
Theoretical Computer Science 210 (1), 3-20, 1999
541999
Recursive and computable operations over topological structures
V Brattka
521999
Computability in linear algebra
M Ziegler, V Brattka
Theoretical Computer Science 326 (1-3), 187-211, 2004
512004
The system can't perform the operation now. Try again later.
Articles 1–20