All Stories

  1. Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021

    Article • Computability, December 2022, IOS Press

    Professor Vasco Brattka

  2. Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018

    Article • Computability, August 2020, IOS Press

    Professor Vasco Brattka

  3. Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018

    Article • Computability, September 2019, IOS Press

    Professor Vasco Brattka, Julia Knight

  4. ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM

    Article • Journal of Symbolic Logic, December 2017, Cambridge University Press

    Professor Vasco Brattka, Tahina Rakotoniaina

  5. Preface to the special issue: Computing with infinite data: topological and logical foundations

    Article • Mathematical Structures in Computer Science, November 2014, Cambridge University Press

    Professor Vasco Brattka, Professor Dieter Spreen, Victor Selivanov

  6. Logic, Computation, Hierarchies

    Article • January 2014, De Gruyter

    Professor Vasco Brattka, Professor Dieter Spreen, Dr Vasco Azevedo

  7. The Nature of Computation. Logic, Algorithms, Applications

    Article • January 2013

    Professor Vasco Brattka

  8. Foreword

    Article • Annals of Pure and Applied Logic, August 2012, Elsevier

    Professor Vasco Brattka, Professor Dieter Spreen

  9. Closed choice and a Uniform Low Basis Theorem

    Article • Annals of Pure and Applied Logic, August 2012, Elsevier

    Professor Vasco Brattka

  10. The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma

    Article • Annals of Pure and Applied Logic, June 2012, Elsevier

    Professor Vasco Brattka

  11. On the Computational Content of the Brouwer Fixed Point Theorem

    Article • January 2012, Springer Science + Business Media

    Professor Vasco Brattka

  12. Effective Choice and Boundedness Principles in Computable Analysis

    Article • Bulletin of Symbolic Logic, March 2011, Cambridge University Press

    Professor Vasco Brattka

  13. Weihrauch degrees, omniscience principles and weak computability

    Article • Journal of Symbolic Logic, March 2011, Cambridge University Press

    Professor Vasco Brattka

  14. Computability of finite-dimensional linear subspaces and best approximation

    Article • Annals of Pure and Applied Logic, December 2010, Elsevier

    Professor Vasco Brattka

  15. Computation with Advice

    Article • Electronic Proceedings in Theoretical Computer Science, June 2010, Open Publishing Association

    Professor Vasco Brattka

  16. A computable version of Banach’s Inverse Mapping Theorem

    Article • Annals of Pure and Applied Logic, February 2009, Elsevier

    Professor Vasco Brattka

  17. Borel Complexity of Topological Operations on Computable Metric Spaces

    Article • Journal of Logic and Computation, February 2009, Oxford University Press (OUP)

    Professor Vasco Brattka

  18. Infinity in Logic and Computation

    Article • January 2009

    Professor Vasco Brattka

  19. Preface

    Article • Electronic Notes in Theoretical Computer Science, December 2008, Elsevier

    Professor Vasco Brattka

  20. Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces

    Article • Electronic Notes in Theoretical Computer Science, December 2008, Elsevier

    Professor Vasco Brattka

  21. Editorial: Math. Log. Quart. 5/2008

    Article • Mathematical Logic Quarterly, August 2008, Wiley

    Professor Vasco Brattka

  22. Preface

    Article • The Journal of Logic and Algebraic Programming, July 2008, Elsevier

    Professor Vasco Brattka

  23. A Tutorial on Computable Analysis

    Article • January 2008, Springer Science + Business Media

    Professor Vasco Brattka

  24. Plottable Real Number Functions and the Computable Graph Theorem

    Article • SIAM Journal on Computing, January 2008, Society for Industrial & Applied Mathematics (SIAM)

    Professor Vasco Brattka

  25. Borel complexity and computability of the Hahn–Banach Theorem

    Article • Archive for Mathematical Logic, November 2007, Springer Science + Business Media

    Professor Vasco Brattka

  26. Computability of compact operators on computable Banach spaces with bases

    Article • Mathematical Logic Quarterly, July 2007, Wiley

    Professor Vasco Brattka

  27. Foreword

    Article • RAIRO - Theoretical Informatics and Applications, January 2007, EDP Sciences

    Professor Vasco Brattka

  28. Borel Complexity of Topological Operations on Computable Metric Spaces

    Article • January 2007, Springer Science + Business Media

    Professor Vasco Brattka

  29. On Computable Compact Operators on Banach Spaces

    Article • Electronic Notes in Theoretical Computer Science, January 2007, Elsevier

    Professor Vasco Brattka

  30. Computability and complexity in analysis

    Article • Journal of Complexity, December 2006, Elsevier

    Professor Vasco Brattka

  31. Towards computability of elliptic boundary value problems in variational formulation

    Article • Journal of Complexity, December 2006, Elsevier

    Professor Vasco Brattka

  32. COMPUTABILITY ON NON-SEPARABLE BANACH SPACES AND LANDAU'S THEOREM

    Article • October 2005, Oxford University Press (OUP)

    Professor Vasco Brattka

  33. Preface

    Article • Electronic Notes in Theoretical Computer Science, February 2005, Elsevier

    Professor Vasco Brattka

  34. On the Borel Complexity of Hahn-Banach Extensions

    Article • Electronic Notes in Theoretical Computer Science, February 2005, Elsevier

    Professor Vasco Brattka

  35. Computing with Sequences, Weak Topologies and the Axiom of Choice

    Article • January 2005, Springer Science + Business Media

    Professor Vasco Brattka

  36. Effective Borel measurability and reducibility of functions

    Article • Mathematical Logic Quarterly, November 2004, Wiley

    Professor Vasco Brattka

  37. Computability in linear algebra

    Article • Theoretical Computer Science, October 2004, Elsevier

    Professor Vasco Brattka

  38. Preface: MLQ ‐ Math. Log. Quart. 4–5/2004

    Article • Mathematical Logic Quarterly, August 2004, Wiley

    Professor Vasco Brattka

  39. Computability and Complexity in Analysis (CCA). A View from Interval Computations -Cincinnati, Ohio, USA, August 28–30, 2003

    Article • Reliable Computing, January 2004, Springer Science + Business Media

    Professor Vasco Brattka

  40. Recursive quasi-metric spaces

    Article • Theoretical Computer Science, August 2003, Elsevier

    Professor Vasco Brattka

  41. Computability on subsets of metric spaces

    Article • Theoretical Computer Science, August 2003, Elsevier

    Professor Vasco Brattka

  42. THE EMPEROR’S NEW RECURSIVENESS: THE EPIGRAPH OF THE EXPONENTIAL FUNCTION IN TWO MODELS OF COMPUTABILITY

    Article • July 2003, World Scientific Pub Co Pte Lt

    Professor Vasco Brattka

  43. Computability over Topological Structures

    Article • January 2003, Springer Science + Business Media

    Professor Vasco Brattka

  44. The Inversion Problem for Computable Linear Operators

    Article • January 2003, Springer Science + Business Media

    Professor Vasco Brattka

  45. Generated quasi-metric hyper and function spaces

    Article • Topology and its Applications, January 2003, Elsevier

    Professor Vasco Brattka

  46. Topological properties of real number representations

    Article • Theoretical Computer Science, July 2002, Elsevier

    Professor Vasco Brattka

  47. Computing Uniform Bounds

    Article • Electronic Notes in Theoretical Computer Science, July 2002, Elsevier

    Professor Vasco Brattka

  48. Preface

    Article • Electronic Notes in Theoretical Computer Science, July 2002, Elsevier

    Professor Vasco Brattka

  49. Random Numbers and an Incomplete Immune Recursive Set

    Article • January 2002, Springer Science + Business Media

    Professor Vasco Brattka

  50. Computability of Linear Equations

    Article • January 2002, Springer Science + Business Media

    Professor Vasco Brattka

  51. Recursion and Computability over Topological Structures

    Article • Electronic Notes in Theoretical Computer Science, March 2001, Elsevier

    Professor Vasco Brattka

  52. Computability and Complexity in Analysis

    Article • January 2001

    Professor Vasco Brattka

  53. A Computable Spectral Theorem

    Article • January 2001, Springer Science + Business Media

    Professor Vasco Brattka

  54. Computable Versions of Baire’s Category Theorem

    Article • January 2001, Springer Science + Business Media

    Professor Vasco Brattka

  55. Computing the Dimension of Linear Subspaces

    Article • January 2000, Springer Science + Business Media

    Professor Vasco Brattka

  56. Computability on subsets of Euclidean space I: closed and compact subsets

    Article • Theoretical Computer Science, May 1999, Elsevier

    Professor Vasco Brattka

  57. Computable invariance

    Article • Theoretical Computer Science, January 1999, Elsevier

    Professor Vasco Brattka

  58. Approaches to Effective Semi‐Continuity of Real Functions

    Article • Mathematical Logic Quarterly, January 1999, Wiley

    Professor Vasco Brattka

  59. Feasible Real Random Access Machines

    Article • Journal of Complexity, December 1998, Elsevier

    Professor Vasco Brattka

  60. Approaches to Effective Semi-continuity of Real Functions

    Article • January 1998, Springer Science + Business Media

    Professor Vasco Brattka

  61. Chapter 12 A bibliography of recursive analysis and recursive topology

    Article • January 1998, Elsevier

    Professor Vasco Brattka

  62. Computable invariance

    Article • January 1997, Springer Science + Business Media

    Professor Vasco Brattka

  63. Order‐free Recursion on the Real Numbers

    Article • Mathematical Logic Quarterly, January 1997, Wiley

    Professor Vasco Brattka

  64. Recursive characterization of computable real-valued functions and relations

    Article • Theoretical Computer Science, August 1996, Elsevier

    Professor Vasco Brattka

  65. Feasible real random access machines

    Article • January 1996, Springer Science + Business Media

    Professor Vasco Brattka

  66. Computability and analysis: the legacy of Alan Turing

    Article • Cambridge University Press

    Professor Vasco Brattka

  67. From Hilbert’s 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov’s Superposition Theorem

    Article • Springer Science + Business Media

    Professor Vasco Brattka