Vasco Brattka

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Loops, Inverse Limits and Non-Determinism	2025	Vasco Brattka
+ PDF Chat	Computability of Initial Value Problems	2024	Vasco Brattka Hendrik Smischliaew
+	On the Complexity of Computing Gödel Numbers	2023	Vasco Brattka
+	Computability Theory	2022	Vasco Brattka Noam Greenberg I. Sh. Kalimullin Mariya I. Soskova
+ PDF Chat	THE DISCONTINUITY PROBLEM	2022	Vasco Brattka
+	Weihrauch Complexity and the Hagen School of Computable Analysis	2022	Vasco Brattka
+ PDF Chat	Stashing And Parallelization Pentagons	2021	Vasco Brattka
+	Stashing And Parallelization Pentagons	2021	Vasco Brattka
+ PDF Chat	Weihrauch Complexity in Computable Analysis	2021	Vasco Brattka Guido Gherardi Arno Pauly
+	The Discontinuity Problem.	2020	Vasco Brattka
+ PDF Chat	WEIHRAUCH GOES BROUWERIAN	2020	Vasco Brattka Guido Gherardi
+ PDF Chat	Completion of choice	2020	Vasco Brattka Guido Gherardi
+	The Discontinuity Problem	2020	Vasco Brattka
+ PDF Chat	Connected choice and the Brouwer fixed point theorem	2018	Vasco Brattka Stéphane Le Roux Joseph S. Miller Arno Pauly
+	A Galois connection between Turing jumps and limits	2018	Vasco Brattka
+ PDF Chat	On the Uniform Computational Content of the Baire Category Theorem	2018	Vasco Brattka Matthew Hendtlass Alexander Kreuzer
+ PDF Chat	ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM	2017	Vasco Brattka Tahina Rakotoniaina
+ PDF Chat	On the Uniform Computational Content of Computability Theory	2017	Vasco Brattka Matthew Hendtlass Alexander Kreuzer
+	Addendum to: “The Bolzano–Weierstrass theorem is the jump of weak Kőnig's lemma” [Ann. Pure Appl. Logic 163 (6) (2012) 623–655]	2017	Vasco Brattka Andrea Cettolo Guido Gherardi Alberto Marcone Matthias Schröder
+	Computable versions of the uniform boundedness theorem	2017	Vasco Brattka
+	Monte Carlo Computability	2017	Vasco Brattka Rupert Hölzl Rutger Kuyper
+	Weihrauch Complexity in Computable Analysis	2017	Vasco Brattka Guido Gherardi Arno Pauly
+ PDF Chat	The Vitali Covering Theorem in the Weihrauch Lattice	2016	Vasco Brattka Guido Gherardi Rupert Hölzl Arno Pauly
+	On the algebraic structure of Weihrauch degrees	2016	Vasco Brattka Arno Pauly
+ PDF Chat	Computability and Analysis, a Historical Approach	2016	Vasco Brattka
+	On the algebraic structure of Weihrauch degrees	2016	Vasco Brattka Arno Pauly
+	Randomness and differentiability	2015	Vasco Brattka Joseph S. Miller André Nies
+ PDF Chat	Probabilistic computability and choice	2015	Vasco Brattka Guido Gherardi Rupert Hölzl
+	Las Vegas Computability and Algorithmic Randomness	2015	Vasco Brattka Guido Gherardi Rupert Hölzl
+ PDF Chat	Computability and analysis: the legacy of Alan Turing	2014	Jeremy Avigad Vasco Brattka
+ PDF Chat	Closed choice and a Uniform Low Basis Theorem	2012	Vasco Brattka Matthew de Brecht Arno Pauly
+ PDF Chat	On the Computational Content of the Brouwer Fixed Point Theorem	2012	Vasco Brattka Stéphane Le Roux Arno Pauly
+ PDF Chat	The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma	2011	Vasco Brattka Guido Gherardi Alberto Marcone
+ PDF Chat	Effective Choice and Boundedness Principles in Computable Analysis	2011	Vasco Brattka Guido Gherardi
+ PDF Chat	Weihrauch degrees, omniscience principles and weak computability	2011	Vasco Brattka Guido Gherardi
+	Computability of finite-dimensional linear subspaces and best approximation	2010	Vasco Brattka Ruth Dillhage
+ PDF Chat	Computation with Advice	2010	Vasco Brattka Arno Pauly
+	Infinity in Logic and Computation	2009	Margaret Archibald Vasco Brattka Valentin Goranko Benedikt Löwe
+	Weihrauch Degrees, Omniscience Principles and Weak Computability	2009	Vasco Brattka Guido Gherardi
+	Effective Choice and Boundedness Principles in Computable Analysis	2009	Vasco Brattka Guido Gherardi
+	Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces	2008	Ruth Dillhage Vasco Brattka
+	Randomness with Respect to the Signed-Digit Representation	2008	Margaret Archibald Vasco Brattka Clemens Heuberger
+	Borel Complexity of Topological Operations on Computable Metric Spaces	2008	Vasco Brattka Guido Gherardi
+	Borel complexity and computability of the Hahn–Banach Theorem	2007	Vasco Brattka
+	Borel Complexity of Topological Operations on Computable Metric Spaces	2007	Vasco Brattka Guido Gherardi
+	On Computable Compact Operators on Banach Spaces	2007	Vasco Brattka Ruth Dillhage
+	Towards computability of elliptic boundary value problems in variational formulation	2006	Vasco Brattka Atsushi Yoshikawa
+ PDF Chat	Computability of the Spectrum of Self-Adjoint Operators	2005	Vasco Brattka Ruth Dillhage
+	COMPUTABILITY ON NON-SEPARABLE BANACH SPACES AND LANDAU'S THEOREM	2005	Vasco Brattka
+	On the Borel Complexity of Hahn-Banach Extensions	2005	Vasco Brattka
+	Computing with Sequences, Weak Topologies and the Axiom of Choice	2005	Vasco Brattka Matthias Schröder
+	Computability of the Spectrum of Self-Adjoint Operators.	2005	Vasco Brattka Ruth Dillhage
+ PDF Chat	Effective Borel measurability and reducibility of functions	2004	Vasco Brattka
+	Computability on subsets of metric spaces	2003	Vasco Brattka Gero Presser
+	THE EMPEROR’S NEW RECURSIVENESS: THE EPIGRAPH OF THE EXPONENTIAL FUNCTION IN TWO MODELS OF COMPUTABILITY	2003	Vasco Brattka
+	Recursive quasi-metric spaces	2003	Vasco Brattka
+	Computability over Topological Structures	2003	Vasco Brattka
+	Generated quasi-metric hyper and function spaces	2002	Vasco Brattka
+	Limit computation of some discontinuous functions (数学解析の計算機上での理論的展開とその遂行可能性研究集会報告集)	2002	満利子八杉 Vasco Brattka 雅子鷲原
+	Limit computation of some discontinuous functions (Theoretical development and feasibility of mathematical analysis on the computer)	2002	Mariko Yasugi Vasco Brattka Masako Washihara
+	Computing Uniform Bounds	2002	Vasco Brattka
+	Random Numbers and an Incomplete Immune Recursive Set	2002	Vasco Brattka
+	Some Notes on Fine Computability	2002	Vasco Brattka
+	Computability & Complexity in Analysis	2001	Vasco Brattka Peter Hertling Ker‐I Ko Hideki Tsuiki
+	Recursion and Computability over Topological Structures	2001	Vasco Brattka
+	Computable Versions of Baire’s Category Theorem	2001	Vasco Brattka
+	Computability of Banach space principles	2001	Vasco Brattka
+	Computable invariance	1999	Vasco Brattka
+	Approaches to Effective Semi-continuity of Real Functions	1998	Vasco Brattka Klaus Weihrauch Xizhong Zheng
+	Order‐free Recursion on the Real Numbers	1997	Vasco Brattka
+	Recursive characterization of computable real-valued functions and relations	1996	Vasco Brattka

Common Coauthors

Coauthor	Papers Together
Guido Gherardi	15
Arno Pauly	9
Ruth Dillhage	5
Rupert Hölzl	4
Matthew Hendtlass	2
Alexander Kreuzer	2
Alberto Marcone	2
Matthias Schröder	2
Margaret Archibald	2
Joseph S. Miller	2
André Nies	1
Masako Washihara	1
Klaus Weihrauch	1
I. Sh. Kalimullin	1
Tahina Rakotoniaina	1
Rutger Kuyper	1
Benedikt Löwe	1
満利子八杉	1
Valentin Goranko	1
Clemens Heuberger	1
Xizhong Zheng	1
Stéphane Le Roux	1
Stéphane Le Roux	1
Mariko Yasugi	1
Ker‐I Ko	1
Jeremy Avigad	1
Hendrik Smischliaew	1
Andrea Cettolo	1
Atsushi Yoshikawa	1
Matthew de Brecht	1
Hideki Tsuiki	1
Noam Greenberg	1
Mariya I. Soskova	1
雅子鷲原	1
Peter Hertling	1
Gero Presser	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Computability on subsets of metric spaces	2003	Vasco Brattka Gero Presser	27
+ PDF Chat	Weihrauch degrees, omniscience principles and weak computability	2011	Vasco Brattka Guido Gherardi	21
+ PDF Chat	Effective Choice and Boundedness Principles in Computable Analysis	2011	Vasco Brattka Guido Gherardi	21
+ PDF Chat	Effective Borel measurability and reducibility of functions	2004	Vasco Brattka	18
+	Computable invariance	1999	Vasco Brattka	18
+	Subsystems of Second Order Arithmetic	1999	Stephen G. Simpson	17
+ PDF Chat	How Incomputable Is the Separable Hahn-Banach Theorem?	2009	Guido Gherardi Alberto Marcone	17
+ PDF Chat	Closed choice and a Uniform Low Basis Theorem	2012	Vasco Brattka Matthew de Brecht Arno Pauly	17
+ PDF Chat	The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma	2011	Vasco Brattka Guido Gherardi Alberto Marcone	16
+ PDF Chat	On the (semi)lattices induced by continuous reducibilities	2010	Arno Pauly	15
+	The Degrees of Discontinuity of some Translators Between Representations of the Real Numbers	1992	Klaus Weihrauch	13
+	Computability over Topological Structures	2003	Vasco Brattka	12
+	Computational complexity on computable metric spaces	2003	Klaus Weirauch	11
+ PDF Chat	Probabilistic computability and choice	2015	Vasco Brattka Guido Gherardi Rupert Hölzl	10
+	Effective properties of sets and functions in metric spaces with computability structure	1999	Mariko Yasugi Takakazu Mori Yoshiki Tsujii	10
+ PDF Chat	On the Uniform Computational Content of Computability Theory	2017	Vasco Brattka Matthew Hendtlass Alexander Kreuzer	10
+	Computability on computable metric spaces	1993	Klaus Weihrauch	9
+ PDF Chat	On the Uniform Computational Content of the Baire Category Theorem	2018	Vasco Brattka Matthew Hendtlass Alexander Kreuzer	8
+	Computable Versions of Baire’s Category Theorem	2001	Vasco Brattka	8
+	Borel Complexity of Topological Operations on Computable Metric Spaces	2008	Vasco Brattka Guido Gherardi	8
+	Borel Complexity of Topological Operations on Computable Metric Spaces	2007	Vasco Brattka Guido Gherardi	8
+	On uniform relationships between combinatorial problems	2015	François G. Dorais Damir D. Dzhafarov Jeffry L. Hirst Joseph Mileti Paul Shafer	7
+	Computability of Banach space principles	2001	Vasco Brattka	7
+	Borel complexity and computability of the Hahn–Banach Theorem	2007	Vasco Brattka	6
+	Revising Type-2 Computation and Degrees of Discontinuity	2007	Martin Ziegler	6
+ PDF Chat	Weihrauch Complexity in Computable Analysis	2021	Vasco Brattka Guido Gherardi Arno Pauly	6
+ PDF Chat	Real Hypercomputation and Continuity	2007	Martin Ziegler	6
+	Pi-0-1 classes in computable analysis and topology	2002	Anil Nerode Joseph S. Miller	6
+	First Course in Functional Analysis.	1966	G. W. Hedstrom Casper Goffman George Pedrick	6
+	On the algebraic structure of Weihrauch degrees	2016	Vasco Brattka Arno Pauly	6
+ PDF Chat	Computation with Advice	2010	Vasco Brattka Arno Pauly	5
+ PDF Chat	Joins in the strong Weihrauch degrees	2019	Damir D. Dzhafarov	5
+	Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions	2014	Kosuke Higuchi Takayuki Kihara	5
+ PDF Chat	The degree structure of Weihrauch-reducibility	2013	Kojiro Higuchi Arno Pauly	5
+	Constructivity in Mathematics	2004	Douglas Bridges	5
+ PDF Chat	Singular coverings and non‐uniform notions of closed set computability	2008	Stéphane Le Roux Martin Ziegler	5
+	Recursive Limits on the Hahn-Banach Theorem	1985	G. Metakides Anil Nerode Ra Shore	5
+ PDF Chat	Connected choice and the Brouwer fixed point theorem	2018	Vasco Brattka Stéphane Le Roux Joseph S. Miller Arno Pauly	5
+ PDF Chat	WEIHRAUCH GOES BROUWERIAN	2020	Vasco Brattka Guido Gherardi	5
+	A topological view on algebraic computation models	2017	Eike Neumann Arno Pauly	5
+	COMPUTABILITY ON NON-SEPARABLE BANACH SPACES AND LANDAU'S THEOREM	2005	Vasco Brattka	5
+	The Arithmetical Hierarchy of Real Numbers	2001	Xizhong Zheng Klaus Weihrauch	5
+ PDF Chat	Recursive metric spaces	1964	Yiannis N. Moschovakis	5
+	Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space	1996	Qing Zhou	5
+	Computability of the Radon-Nikodym Derivative	2012	Mathieu Hoyrup Cristóbal Rojas Klaus Weihrauch	5
+	Game characterizations and lower cones in the Weihrauch degrees	2019	Hugo Nobrega Arno Pauly	5
+	Topologies on Closed and Closed Convex Sets	1993	Gerald Beer	4
+ PDF Chat	Completion of choice	2020	Vasco Brattka Guido Gherardi	4
+ PDF Chat	Turing machines on represented sets, a model of computation for Analysis	2011	N. R. Tavana Klaus Weihrauch	4
+	Undecidability in Weihrauch Degrees	2010	Oleg V. Kudinov Victor Selivanov Anton V. Zhukov	4