| Publication | Date of Publication | Type |
|---|
Effective bases and notions of effective second countability in computable analysis
Journal of Logic and Analysis | 2026-06-02 | Paper |
| Computability of initial value problems | 2025-11-19 | Paper |
| Effective second countability in computable analysis | 2025-11-19 | Paper |
| Feasible real random access machines | 2024-06-21 | Paper |
On the complexity of learning programs
Lecture Notes in Computer Science | 2024-01-12 | Paper |
THE DISCONTINUITY PROBLEM
Journal of Symbolic Logic | 2023-09-11 | Paper |
| Weihrauch Complexity and the Hagen School of Computable Analysis | 2022-03-11 | Paper |
scientific article; zbMATH DE number 7471680 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471680 (Why is no real title available?) | 2022-02-09 | Paper |
Weihrauch Complexity in Computable Analysis
Theory and Applications of Computability | 2022-01-26 | Paper |
Weihrauch goes Brouwerian
Journal of Symbolic Logic | 2021-04-15 | Paper |
Stashing And Parallelization Pentagons
(available as arXiv preprint) | 2021-02-23 | Paper |
| scientific article; zbMATH DE number 7311152 (Why is no real title available?) | 2021-02-16 | Paper |
Completion of choice
Annals of Pure and Applied Logic | 2021-01-25 | Paper |
Connected choice and the Brouwer fixed point theorem
Journal of Mathematical Logic | 2019-07-08 | Paper |
On the uniform computational content of the Baire category theorem
Notre Dame Journal of Formal Logic | 2018-12-21 | Paper |
On the uniform computational content of the Baire category theorem
Notre Dame Journal of Formal Logic | 2018-12-21 | Paper |
On the algebraic structure of Weihrauch degrees
(available as arXiv preprint) | 2018-11-02 | Paper |
A Galois connection between Turing jumps and limits
(available as arXiv preprint) | 2018-09-06 | Paper |
| Monte Carlo computability | 2018-04-19 | Paper |
A Galois connection between Turing jumps and limits
(available as arXiv preprint) | 2018-02-05 | Paper |
On the uniform computational content of computability theory
Theory of Computing Systems | 2018-02-01 | Paper |
On the uniform computational content of Ramsey's theorem
Journal of Symbolic Logic | 2018-01-11 | Paper |
Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma''
Annals of Pure and Applied Logic | 2017-05-18 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
| Las Vegas computability and algorithmic randomness | 2017-01-24 | Paper |
The Brouwer fixed point theorem revisited
Pursuit of the Universal | 2016-08-17 | Paper |
Computability and analysis, a historical approach
Pursuit of the Universal | 2016-08-17 | Paper |
Randomness and differentiability
Transactions of the American Mathematical Society | 2015-11-03 | Paper |
Probabilistic computability and choice
Information and Computation | 2015-06-01 | Paper |
On computable compact operators on Banach spaces
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Computability of the metric projection onto finite-dimensional linear subspaces
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Computing uniform bounds
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
| Weihrauch degrees, omniscience principles and weak computability | 2012-09-28 | Paper |
| Effective choice and boundedness principles in computable analysis | 2012-09-28 | Paper |
On the computational content of the Brouwer fixed point theorem
Lecture Notes in Computer Science | 2012-08-14 | Paper |
| Computability and analysis: the legacy of Alan Turing | 2012-06-15 | Paper |
Closed choice and a uniform low basis theorem
Annals of Pure and Applied Logic | 2012-06-01 | Paper |
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Computability of finite-dimensional linear subspaces and best approximation
Annals of Pure and Applied Logic | 2011-09-12 | Paper |
Effective Choice and Boundedness Principles in Computable Analysis
The Bulletin of Symbolic Logic | 2011-03-21 | Paper |
Effective Choice and Boundedness Principles in Computable Analysis
The Bulletin of Symbolic Logic | 2011-03-21 | Paper |
Weihrauch degrees, omniscience principles and weak computability
Journal of Symbolic Logic | 2011-03-18 | Paper |
Weihrauch degrees, omniscience principles and weak computability
Journal of Symbolic Logic | 2011-03-18 | Paper |
A computable version of Banach's inverse mapping theorem
Annals of Pure and Applied Logic | 2009-03-25 | Paper |
Plottable Real Number Functions and the Computable Graph Theorem
SIAM Journal on Computing | 2009-03-16 | Paper |
Borel Complexity of Topological Operations on Computable Metric Spaces
Journal Of Logic And Computation | 2009-03-02 | Paper |
| From Hilbert's 13th problem to the theory of neural networks: constructive aspects of Kolmogorov's superposition theorem | 2008-06-27 | Paper |
| scientific article; zbMATH DE number 5287418 (Why is no real title available?) | 2008-06-11 | Paper |
Borel complexity and computability of the Hahn-Banach theorem
Archive for Mathematical Logic | 2008-05-26 | Paper |
| A tutorial on computable analysis | 2008-04-29 | Paper |
Borel Complexity of Topological Operations on Computable Metric Spaces
Lecture Notes in Computer Science | 2007-11-13 | Paper |
| Some notes on Fine computability | 2007-10-17 | Paper |
| Computability of the spectrum of self-adjoint operators | 2007-10-15 | Paper |
Computability of compact operators on computable Banach spaces with bases
Mathematical Logic Quarterly | 2007-09-17 | Paper |
Towards computability of elliptic boundary value problems in variational formulation
Journal of Complexity | 2007-02-08 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
| scientific article; zbMATH DE number 5064948 (Why is no real title available?) | 2006-10-17 | Paper |
| scientific article; zbMATH DE number 2247268 (Why is no real title available?) | 2006-01-16 | Paper |
Effective Borel measurability and reducibility of functions
MLQ | 2005-02-16 | Paper |
Computability in linear algebra
Theoretical Computer Science | 2005-01-11 | Paper |
Effective representations of the space of linear bounded operators
Applied General Topology | 2004-09-06 | Paper |
| scientific article; zbMATH DE number 2086685 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079882 (Why is no real title available?) | 2004-08-03 | Paper |
Computability on subsets of metric spaces.
Theoretical Computer Science | 2004-03-14 | Paper |
Recursive quasi-metric spaces.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1962830 (Why is no real title available?) | 2003-08-11 | Paper |
Generated quasi-metric hyper and function spaces.
Topology and its Applications | 2003-04-28 | Paper |
| scientific article; zbMATH DE number 1834650 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1782996 (Why is no real title available?) | 2002-08-18 | Paper |
Topological properties of real number representations.
Theoretical Computer Science | 2002-07-31 | Paper |
| scientific article; zbMATH DE number 1746051 (Why is no real title available?) | 2002-05-27 | Paper |
Realistic models of computability on the real numbers
RIMS Kokyuroku | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1507232 (Why is no real title available?) | 2000-09-14 | Paper |
Approaches to Effective Semi‐Continuity of Real Functions
Mathematical Logic Quarterly | 2000-08-23 | Paper |
Computability on subsets of Euclidean space. I: Closed and compact subsets
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1302881 (Why is no real title available?) | 1999-06-17 | Paper |
Feasible real random access machines
Journal of Complexity | 1999-06-13 | Paper |
| scientific article; zbMATH DE number 1222832 (Why is no real title available?) | 1999-03-30 | Paper |
Computable invariance
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1088268 (Why is no real title available?) | 1997-11-17 | Paper |
Order-free Recursion on the Real Numbers
Mathematical Logic Quarterly | 1997-05-14 | Paper |
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science | 1997-02-27 | Paper |
