default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasco Brattka
Person information
- affiliation: Universität der Bundeswehr München
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j53]Vasco Brattka
:
The discontinuity Problem. J. Symb. Log. 88(3): 1191-1212 (2023)- [c35]Vasco Brattka:
On the Complexity of Learning Programs. CiE 2023: 166-177 - [i21]Vasco Brattka:
On the Complexity of Computing Gödel Numbers. CoRR abs/2302.04213 (2023) - 2022
- [j52]Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. 11(3-4): 163 (2022) - 2021
- [j51]Vasco Brattka, Guido Gherardi:
Completion of choice. Ann. Pure Appl. Log. 172(3): 102914 (2021) - [j50]Vasco Brattka:
Stashing And Parallelization Pentagons. Log. Methods Comput. Sci. 17(4) (2021) - 2020
- [j49]Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9(3-4): 167-168 (2020) - [j48]Vasco Brattka, Guido Gherardi:
Weihrauch Goes Brouwerian. J. Symb. Log. 85(4): 1614-1653 (2020) - [i20]Vasco Brattka:
The Discontinuity Problem. CoRR abs/2012.02143 (2020)
2010 – 2019
- 2019
- [j47]Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp:
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. 8(3-4): 191 (2019) - [j46]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19(1): 1950004:1-1950004:46 (2019) - [i19]Vasco Brattka, Guido Gherardi:
Completion of Choice. CoRR abs/1910.13186 (2019) - 2018
- [j45]Vasco Brattka:
A Galois connection between Turing jumps and limits. Log. Methods Comput. Sci. 14(3) (2018) - [j44]Vasco Brattka, Arno Pauly:
On the algebraic structure of Weihrauch degrees. Log. Methods Comput. Sci. 14(4) (2018) - [j43]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of the Baire Category Theorem. Notre Dame J. Formal Log. 59(4): 605-636 (2018) - [i18]Vasco Brattka:
A Galois connection between Turing jumps and limits. CoRR abs/1802.01355 (2018) - [i17]Vasco Brattka, Guido Gherardi:
Weihrauch goes Brouwerian. CoRR abs/1809.00380 (2018) - [i16]Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). Dagstuhl Reports 8(9): 1-28 (2018) - 2017
- [j42]Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder:
Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. Ann. Pure Appl. Log. 168(8): 1605-1608 (2017) - [j41]Vasco Brattka, Tahina Rakotoniaina:
On the Uniform Computational Content of Ramsey's Theorem. J. Symb. Log. 82(4): 1278-1316 (2017) - [j40]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of Computability Theory. Theory Comput. Syst. 61(4): 1376-1426 (2017) - [c34]Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity 2017: 188-200 - [c33]Vasco Brattka, Rupert Hölzl, Rutger Kuyper:
Monte Carlo Computability. STACS 2017: 17:1-17:14 - [i15]Vasco Brattka, Guido Gherardi, Arno Pauly:
Weihrauch Complexity in Computable Analysis. CoRR abs/1707.03202 (2017) - [i14]Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp:
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7(2): 89-101 (2017) - 2016
- [j39]Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo:
Editorial. Comput. 5(1): 1 (2016) - [c32]Vasco Brattka:
Computability and Analysis, a Historical Approach. CiE 2016: 45-57 - [c31]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
The Brouwer Fixed Point Theorem Revisited. CiE 2016: 58-67 - [i13]Vasco Brattka:
Computability and Analysis, a Historical Approach. CoRR abs/1602.07509 (2016) - [i12]Vasco Brattka, Arno Pauly:
On the algebraic structure of Weihrauch degrees. CoRR abs/1604.08348 (2016) - [i11]Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR abs/1605.03354 (2016) - 2015
- [j38]Vasco Brattka, Guido Gherardi, Rupert Hölzl:
Probabilistic computability and choice. Inf. Comput. 242: 249-286 (2015) - [j37]Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki:
Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. 25(7): 1463-1465 (2015) - [c30]Vasco Brattka, Guido Gherardi, Rupert Hölzl:
Las Vegas Computability and Algorithmic Randomness. STACS 2015: 130-142 - [i10]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of Computability Theory. CoRR abs/1501.00433 (2015) - [i9]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of the Baire Category Theorem. CoRR abs/1510.01913 (2015) - [i8]Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5(9): 77-104 (2015) - 2014
- [p2]Jeremy Avigad, Vasco Brattka:
Computability and analysis: the legacy of Alan Turing. Turing's Legacy 2014: 1-47 - [e7]Vasco Brattka, Hannes Diener, Dieter Spreen:
Logic, Computation, Hierarchies. Ontos Mathematical Logic 4, De Gruyter 2014, ISBN 978-1-61451-804-4 [contents] - 2013
- [e6]Paola Bonizzoni, Vasco Brattka, Benedikt Löwe:
The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. Lecture Notes in Computer Science 7921, Springer 2013, ISBN 978-3-642-39052-4 [contents] - [i7]Vasco Brattka, Rupert Hölzl, Guido Gherardi:
Probabilistic Computability and Choice. CoRR abs/1312.7305 (2013) - 2012
- [j36]Vasco Brattka, Guido Gherardi, Alberto Marcone:
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. Ann. Pure Appl. Log. 163(6): 623-655 (2012) - [j35]Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen:
Foreword. Ann. Pure Appl. Log. 163(8): 973-974 (2012) - [j34]Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed choice and a Uniform Low Basis Theorem. Ann. Pure Appl. Log. 163(8): 986-1008 (2012) - [j33]Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo:
Editorial. Comput. 1(1): 1-2 (2012) - [c29]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
On the Computational Content of the Brouwer Fixed Point Theorem. CiE 2012: 56-67 - [i6]Jeremy Avigad, Vasco Brattka:
Computability and analysis: the legacy of Alan Turing. CoRR abs/1206.3431 (2012) - [i5]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
Connected Choice and the Brouwer Fixed Point Theorem. CoRR abs/1206.4809 (2012) - 2011
- [j32]Vasco Brattka, Guido Gherardi:
Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17(1): 73-117 (2011) - [j31]Vasco Brattka, Guido Gherardi:
Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76(1): 143-176 (2011) - [i4]Vasco Brattka, Guido Gherardi, Alberto Marcone:
The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma. CoRR abs/1101.0792 (2011) - [i3]Vasco Brattka, Joseph S. Miller, André Nies:
Randomness and Differentiability. CoRR abs/1104.4465 (2011) - [i2]Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki:
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports 1(10): 14-36 (2011) - 2010
- [j30]Vasco Brattka, Ruth Dillhage:
Computability of finite-dimensional linear subspaces and best approximation. Ann. Pure Appl. Log. 162(3): 182-193 (2010) - [c28]Vasco Brattka, Arno Pauly:
Computation with Advice. CCA 2010: 41-55 - [i1]Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed Choice and a Uniform Low Basis Theorem. CoRR abs/1002.2800 (2010)
2000 – 2009
- 2009
- [j29]Vasco Brattka:
A computable version of Banach's Inverse Mapping Theorem. Ann. Pure Appl. Log. 157(2-3): 85-96 (2009) - [j28]Vasco Brattka, Pieter Collins, Robert Rettinger:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 15(6): 1143-1144 (2009) - [j27]Vasco Brattka, Guido Gherardi:
Borel Complexity of Topological Operations on Computable Metric Spaces. J. Log. Comput. 19(1): 45-76 (2009) - [c27]Vasco Brattka, Guido Gherardi:
Weihrauch Degrees, Omniscience Principles and Weak Computability. CCA 2009 - [c26]Vasco Brattka, Guido Gherardi:
Effective Choice and Boundedness Principles in Computable Analysis. CCA 2009 - [c25]Vasco Brattka, Guido Gherardi:
A method to evaluate the computational complexity of the theorems from functional analysis. ICTCS 2009: 59-61 - [e5]Margaret Archibald, Vasco Brattka, Valentin Goranko, Benedikt Löwe:
Infinity in Logic and Computation, International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers. Lecture Notes in Computer Science 5489, Springer 2009, ISBN 978-3-642-03091-8 [contents] - 2008
- [j26]Vasco Brattka:
Borel complexity and computability of the Hahn-Banach Theorem. Arch. Math. Log. 46(7-8): 547-564 (2008) - [j25]Margaret Archibald, Vasco Brattka, Clemens Heuberger:
Randomness with Respect to the Signed-Digit Representation. Fundam. Informaticae 83(1-2): 1-19 (2008) - [j24]Vasco Brattka, Gerhard Jäger, Hans-Peter A. Künzi:
Preface. J. Log. Algebraic Methods Program. 76(2) (2008) - [j23]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 14(6): 800 (2008) - [j22]Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Editorial: Math. Log. Quart. 5/2008. Math. Log. Q. 54(5): 453 (2008) - [j21]Vasco Brattka:
Plottable Real Number Functions and the Computable Graph Theorem. SIAM J. Comput. 38(1): 303-328 (2008) - [c24]Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Preface. CCA 2008: 1 - [c23]Ruth Dillhage, Vasco Brattka:
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces. CCA 2008: 45-60 - [e4]Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, CCA 2008, Hagen, Germany, August 21-24, 2008. Electronic Notes in Theoretical Computer Science 221, Elsevier 2008 [contents] - 2007
- [j20]Vasco Brattka, Christiane Frougny, Norbert Th. Müller:
Foreword. RAIRO Theor. Informatics Appl. 41(1): 1-2 (2007) - [j19]Vasco Brattka, Ruth Dillhage:
Computability of compact operators on computable Banach spaces with bases. Math. Log. Q. 53(4-5): 345-364 (2007) - [c22]Vasco Brattka, Guido Gherardi:
Borel Complexity of Topological Operations on Computable Metric Spaces. CiE 2007: 83-97 - 2006
- [j18]Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki:
Computability and complexity in analysis. J. Complex. 22(6): 728 (2006) - [j17]Vasco Brattka, Atsushi Yoshikawa:
Towards computability of elliptic boundary value problems in variational formulation. J. Complex. 22(6): 858-880 (2006) - [c21]Vasco Brattka, Ruth Dillhage:
On Computable Compact Operators on Banach Spaces. CCA 2006: 365-386 - 2005
- [j16]Vasco Brattka, Ruth Dillhage:
Computability of the Spectrum of Self-Adjoint Operators. J. Univers. Comput. Sci. 11(12): 1884-1900 (2005) - [j15]Vasco Brattka:
Effective Borel measurability and reducibility of functions. Math. Log. Q. 51(1): 19-44 (2005) - [c20]Vasco Brattka:
Some Aspects of Computable Functional Analysis. CCA 2005 - [c19]Vasco Brattka, Matthias Schröder:
Computing with Sequences, Weak Topologies and the Axiom of Choice. CSL 2005: 462-476 - [p1]Vasco Brattka:
Computability on Non-Separable Banach Spaces and Landau's Theorem. From sets and types to topology and analysis 2005 - [e3]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004. Electronic Notes in Theoretical Computer Science 120, Elsevier 2005 [contents] - 2004
- [j14]Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong:
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50(4-5): 327-328 (2004) - [j13]Vasco Brattka, Vladik Kreinovich:
Computability and Complexity in Analysis (CCA). A View from Interval Computations - Cincinnati, Ohio, USA, August 28-30, 2003. Reliab. Comput. 10(1): 75-80 (2004) - [j12]Martin Ziegler, Vasco Brattka:
Computability in linear algebra. Theor. Comput. Sci. 326(1-3): 187-211 (2004) - [c18]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Preface. CCA 2004: 1- - [c17]Vasco Brattka:
On the Borel Complexity of Hahn-Banach Extensions. CCA 2004: 3-16 - 2003
- [j11]Vasco Brattka:
Recursive quasi-metric spaces. Theor. Comput. Sci. 305(1-3): 17-42 (2003) - [j10]Vasco Brattka, Gero Presser:
Computability on subsets of metric spaces. Theor. Comput. Sci. 305(1-3): 43-76 (2003) - [c16]Vasco Brattka:
The Inversion Problem for Computable Linear Operators. STACS 2003: 391-402 - 2002
- [j9]Vasco Brattka:
Some Notes on Fine Computability. J. Univers. Comput. Sci. 8(3): 382-395 (2002) - [j8]Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong:
Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48(S1) (2002) - [j7]Vasco Brattka, Peter Hertling:
Topological properties of real number representations. Theor. Comput. Sci. 284(2): 241-257 (2002) - [c15]Vasco Brattka:
Random Numbers and an Incomplete Immune Recursive Set. ICALP 2002: 950-961 - [c14]Vasco Brattka, Martin Ziegler:
Computability of Linear Equations. IFIP TCS 2002: 95-106 - [c13]Vasco Brattka:
Computing Uniform Bounds. CCA 2002: 13-24 - [c12]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Preface. CCA 2002: 225-226 - [e2]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Computability and Complexity in Analysis, CCA 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002. Electronic Notes in Theoretical Computer Science 66(1), Elsevier 2002 [contents] - 2001
- [c11]Martin Ziegler, Vasco Brattka:
Turing computability of (non-)linear optimization. CCCG 2001: 181-184 - [c10]Vasco Brattka:
Computable Versions of Baire's Category Theorem. MFCS 2001: 224-235 - [e1]Jens Blanck, Vasco Brattka, Peter Hertling:
Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers. Lecture Notes in Computer Science 2064, Springer 2001, ISBN 3-540-42197-1 [contents] - 2000
- [c9]Martin Ziegler, Vasco Brattka:
A Computable Spectral Theorem. CCA 2000: 378-388 - [c8]Vasco Brattka:
The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability. Words, Languages & Combinatorics 2000: 63-72 - [c7]Martin Ziegler, Vasco Brattka:
Computing the Dimension of Linear Subspaces. SOFSEM 2000: 450-458 - [c6]Vasco Brattka:
Recursion and Computability over Topological Structures. MFCSIT 2000: 5
1990 – 1999
- 1999
- [b1]Vasco Brattka:
Recursive and computable operations over topological structures. University of Hagen, Germany, Fernuniv., Fachbereich Informatik 1999, pp. 1-162 - [j6]Vasco Brattka, Xizhong Zheng, Klaus Weihrauch:
Approaches to Effective Semi-Continuity of Real Functions. Math. Log. Q. 45: 481-496 (1999) - [j5]Vasco Brattka:
Computable Invariance. Theor. Comput. Sci. 210(1): 3-20 (1999) - [j4]Vasco Brattka, Klaus Weihrauch:
Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theor. Comput. Sci. 219(1-2): 65-93 (1999) - 1998
- [j3]Vasco Brattka, Peter Hertling:
Feasible Real Random Access Machines. J. Complex. 14(4): 490-526 (1998) - [c5]Vasco Brattka, Klaus Weihrauch, Xizhong Zheng:
Approaches to Effective Semi-continuity of Real Functions. COCOON 1998: 184-193 - [c4]Vasco Brattka, Klaus Weihrauch:
Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. MCU (2) 1998: 215-234 - 1997
- [j2]Vasco Brattka:
Order-free Recursion on the Real Numbers. Math. Log. Q. 43: 216-234 (1997) - [c3]Vasco Brattka:
Computable Invariance. COCOON 1997: 146-155 - 1996
- [j1]Vasco Brattka:
Recursive Characterization of Computable Real-Valued Functions and Relations. Theor. Comput. Sci. 162(1): 45-77 (1996) - [c2]Vasco Brattka:
Computable Invariance. CCA 1996 - [c1]Vasco Brattka, Peter Hertling:
Feasible Real Random Access Machines. SOFSEM 1996: 335-342
Coauthor Index