Computability and Analysis, a Historical Approach
From MaRDI portal
Publication:3188239
DOI10.1007/978-3-319-40189-8_5zbMath1476.03063arXiv1602.07509OpenAlexW3102609132MaRDI QIDQ3188239
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07509
History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) History of mathematical logic and foundations (03-03) Foundations: limits and generalizations, elementary topology of the line (26A03) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Towards computability of elliptic boundary value problems in variational formulation
- Borel complexity and computability of the Hahn-Banach theorem
- How incomputable is the separable Hahn-Banach theorem?
- A computable version of Banach's inverse mapping theorem
- An effective Riemann Mapping Theorem
- Computability on subsets of metric spaces.
- Probabilistic computability and choice
- On the Computational Content of the Brouwer Fixed Point Theorem
- On the (semi)lattices induced by continuous reducibilities
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Computability of the Radon-Nikodym Derivative
- Effective Borel measurability and reducibility of functions
- Computable functionals
- Singular coverings and non‐uniform notions of closed set computability
- Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
- A computable ordinary differential equation which possesses no computable solution
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Nicht konstruktiv beweisbare Sätze der Analysis
- On the interpretation of non-finitist proofs–Part II
- Recursive Real Numbers
