Vasco Brattka

ORCID

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 37

Top Venues

University of Hagen, Germany (PHD)

Education History

University of Hagen, Germany

PHD

Publications

Vasco Brattka
On the Complexity of Learning Programs. CiE (2023)
Vasco Brattka
The discontinuity Problem. J. Symb. Log. 88 (3) (2023)
Vasco Brattka
On the Complexity of Computing Gödel Numbers. CoRR (2023)
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) (2022)
Vasco Brattka
Stashing And Parallelization Pentagons. Log. Methods Comput. Sci. 17 (4) (2021)
Vasco Brattka, Guido Gherardi
Completion of choice. Ann. Pure Appl. Log. 172 (3) (2021)
Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly
Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9 (3-4) (2020)
Vasco Brattka, Guido Gherardi
Weihrauch Goes Brouwerian. J. Symb. Log. 85 (4) (2020)
Vasco Brattka
The Discontinuity Problem. CoRR (2020)
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) (2019)
Vasco Brattka, Guido Gherardi
Completion of Choice. CoRR (2019)
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19 (1) (2019)
Vasco Brattka
A Galois connection between Turing jumps and limits. CoRR (2018)
Vasco Brattka, Arno Pauly
On the algebraic structure of Weihrauch degrees. Log. Methods Comput. Sci. 14 (4) (2018)
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
On the Uniform Computational Content of the Baire Category Theorem. Notre Dame J. Formal Log. 59 (4) (2018)
Vasco Brattka, Guido Gherardi
Weihrauch goes Brouwerian. CoRR (2018)
Vasco Brattka
A Galois connection between Turing jumps and limits. Log. Methods Comput. Sci. 14 (3) (2018)
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) (2018)
Vasco Brattka, Rupert Hölzl, Rutger Kuyper
Monte Carlo Computability. STACS (2017)
Vasco Brattka, Guido Gherardi, Arno Pauly
Weihrauch Complexity in Computable Analysis. CoRR (2017)
Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7 (2) (2017)
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
On the Uniform Computational Content of Computability Theory. Theory Comput. Syst. 61 (4) (2017)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity (2017)
Vasco Brattka, Tahina Rakotoniaina
On the Uniform Computational Content of Ramsey's Theorem. J. Symb. Log. 82 (4) (2017)
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) (2017)
Vasco Brattka, Arno Pauly
On the algebraic structure of Weihrauch degrees. CoRR (2016)
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
The Brouwer Fixed Point Theorem Revisited. CiE (2016)
Vasco Brattka
Computability and Analysis, a Historical Approach. CiE (2016)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR (2016)
Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo
Editorial. Comput. 5 (1) (2016)
Vasco Brattka
Computability and Analysis, a Historical Approach. CoRR (2016)
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
On the Uniform Computational Content of Computability Theory. CoRR (2015)
Vasco Brattka, Guido Gherardi, Rupert Hölzl
Las Vegas Computability and Algorithmic Randomness. STACS (2015)
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) (2015)
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
On the Uniform Computational Content of the Baire Category Theorem. CoRR (2015)
Vasco Brattka, Guido Gherardi, Rupert Hölzl
Probabilistic computability and choice. Inf. Comput. 242 (2015)
Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5 (9) (2015)
Vasco Brattka, Rupert Hölzl, Guido Gherardi
Probabilistic Computability and Choice. CoRR (2013)
Vasco Brattka, Matthew de Brecht, Arno Pauly
Closed choice and a Uniform Low Basis Theorem. Ann. Pure Appl. Log. 163 (8) (2012)
Vasco Brattka, Stéphane Le Roux, Arno Pauly
On the Computational Content of the Brouwer Fixed Point Theorem. CiE (2012)
Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen
Foreword. Ann. Pure Appl. Log. 163 (8) (2012)
Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo
Editorial. Comput. 1 (1) (2012)
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) (2012)
Jeremy Avigad, Vasco Brattka
Computability and analysis: the legacy of Alan Turing CoRR (2012)
Vasco Brattka, Stéphane Le Roux, Arno Pauly
Connected Choice and the Brouwer Fixed Point Theorem CoRR (2012)
Vasco Brattka, Guido Gherardi
Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76 (1) (2011)
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) (2011)
Vasco Brattka, Guido Gherardi, Alberto Marcone
The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma CoRR (2011)
Vasco Brattka, Guido Gherardi
Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17 (1) (2011)
Vasco Brattka, Joseph S. Miller, André Nies
Randomness and Differentiability. CoRR (2011)
Vasco Brattka, Ruth Dillhage
Computability of finite-dimensional linear subspaces and best approximation. Ann. Pure Appl. Log. 162 (3) (2010)
Vasco Brattka, Arno Pauly
Computation with Advice CCA (2010)
Vasco Brattka, Matthew de Brecht, Arno Pauly
Closed Choice and a Uniform Low Basis Theorem. CoRR (2010)
Vasco Brattka, Pieter Collins, Robert Rettinger
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 15 (6) (2009)
Vasco Brattka
A computable version of Banach's Inverse Mapping Theorem. Ann. Pure Appl. Log. 157 (2-3) (2009)
Vasco Brattka, Guido Gherardi
Effective Choice and Boundedness Principles in Computable Analysis. CCA (2009)
Vasco Brattka, Guido Gherardi
Weihrauch Degrees, Omniscience Principles and Weak Computability. CCA (2009)
Vasco Brattka, Guido Gherardi
A method to evaluate the computational complexity of the theorems from functional analysis. ICTCS (2009)
Vasco Brattka, Guido Gherardi
Borel Complexity of Topological Operations on Computable Metric Spaces. J. Log. Comput. 19 (1) (2009)
Vasco Brattka, Gerhard Jäger, Hans-Peter A. Künzi
Preface. J. Log. Algebraic Methods Program. 76 (2) (2008)
Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong
Editorial: Math. Log. Quart. 5/2008. Math. Log. Q. 54 (5) (2008)
Ruth Dillhage, Vasco Brattka
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces. Electron. Notes Theor. Comput. Sci. 221 (2008)
Vasco Brattka
Borel complexity and computability of the Hahn-Banach Theorem. Arch. Math. Log. 46 (7-8) (2008)
Vasco Brattka
Plottable Real Number Functions and the Computable Graph Theorem. SIAM J. Comput. 38 (1) (2008)
Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch
Preface. Electron. Notes Theor. Comput. Sci. 221 (2008)
Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 14 (6) (2008)
Margaret Archibald, Vasco Brattka, Clemens Heuberger
Randomness with Respect to the Signed-Digit Representation. Fundam. Informaticae 83 (1-2) (2008)
Vasco Brattka, Ruth Dillhage
On Computable Compact Operators on Banach Spaces. Electron. Notes Theor. Comput. Sci. 167 (2007)
Vasco Brattka, Guido Gherardi
Borel Complexity of Topological Operations on Computable Metric Spaces. CiE (2007)
Vasco Brattka, Ruth Dillhage
Computability of compact operators on computable Banach spaces with bases. Math. Log. Q. 53 (4-5) (2007)
Vasco Brattka, Christiane Frougny, Norbert Th. Müller
Foreword. RAIRO Theor. Informatics Appl. 41 (1) (2007)
Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki
Computability and complexity in analysis. J. Complex. 22 (6) (2006)
Vasco Brattka, Atsushi Yoshikawa
Towards computability of elliptic boundary value problems in variational formulation. J. Complex. 22 (6) (2006)
Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
Preface. Electron. Notes Theor. Comput. Sci. 120 (2005)
Vasco Brattka, Ruth Dillhage
Computability of the Spectrum of Self-Adjoint Operators. J. Univers. Comput. Sci. 11 (12) (2005)
Vasco Brattka
Some Aspects of Computable Functional Analysis. CCA (2005)
Vasco Brattka, Matthias Schröder
Computing with Sequences, Weak Topologies and the Axiom of Choice. CSL (2005)
Vasco Brattka
Effective Borel measurability and reducibility of functions. Math. Log. Q. 51 (1) (2005)
Vasco Brattka
On the Borel Complexity of Hahn-Banach Extensions. Electron. Notes Theor. Comput. Sci. 120 (2005)
Martin Ziegler, Vasco Brattka
Computability in linear algebra. Theor. Comput. Sci. 326 (1-3) (2004)
Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50 (4-5) (2004)
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) (2004)
Vasco Brattka
The Inversion Problem for Computable Linear Operators. STACS (2003)
Vasco Brattka
Recursive quasi-metric spaces. Theor. Comput. Sci. 305 (1-3) (2003)
Vasco Brattka, Gero Presser
Computability on subsets of metric spaces. Theor. Comput. Sci. 305 (1-3) (2003)
Vasco Brattka
Some Notes on Fine Computability. J. Univers. Comput. Sci. 8 (3) (2002)
Vasco Brattka
Computing Uniform Bounds. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
Vasco Brattka, Peter Hertling
Topological properties of real number representations. Theor. Comput. Sci. 284 (2) (2002)
Vasco Brattka, Matthias Schröder, Klaus Weihrauch
Preface. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
Vasco Brattka
Random Numbers and an Incomplete Immune Recursive Set. ICALP (2002)
Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong
Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48 (S1) (2002)
Vasco Brattka, Martin Ziegler
Computability of Linear Equations. IFIP TCS (2002)
Vasco Brattka
Computable Versions of Baire's Category Theorem. MFCS (2001)
Martin Ziegler, Vasco Brattka
Turing computability of (non-)linear optimization. CCCG (2001)
Vasco Brattka
Recursion and Computability over Topological Structures. Electron. Notes Theor. Comput. Sci. 40 (2000)
Vasco Brattka
The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability. Words, Languages & Combinatorics (2000)
Martin Ziegler, Vasco Brattka
A Computable Spectral Theorem. CCA (2000)
Martin Ziegler, Vasco Brattka
Computing the Dimension of Linear Subspaces. SOFSEM (2000)
Vasco Brattka, Klaus Weihrauch
Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theor. Comput. Sci. 219 (1-2) (1999)
Vasco Brattka, Xizhong Zheng, Klaus Weihrauch
Approaches to Effective Semi-Continuity of Real Functions. Math. Log. Q. 45 (1999)

Vasco Brattka.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vasco Brattka