Computability and analysis, a historical approach
From MaRDI portal
Publication:3188239
Abstract: The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, 'Emil Borel discussed his ideas on computable real number functions in his introduction to measure theory. On the other hand, Alan Turing had computable real numbers in mind when he introduced his now famous machine model. Here we want to focus on a particular aspect of computability and analysis, namely on computability properties of theorems from analysis. This is a topic that emerged already in early work of Turing, Specker and other pioneers of computable analysis and eventually leads us to the very recent project of classifying the computational content of theorems in the Weihrauch lattice.
Recommendations
Cites work
- scientific article; zbMATH DE number 3113501 (Why is no real title available?)
- scientific article; zbMATH DE number 3127537 (Why is no real title available?)
- scientific article; zbMATH DE number 3143695 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 3805536 (Why is no real title available?)
- scientific article; zbMATH DE number 5064948 (Why is no real title available?)
- A computable ordinary differential equation which possesses no computable solution
- A computable version of Banach's inverse mapping theorem
- A tutorial on computable analysis
- An effective Riemann Mapping Theorem
- Borel complexity and computability of the Hahn-Banach theorem
- Closed choice and a uniform low basis theorem
- Computability on subsets of metric spaces.
- Computable functionals
- Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
- Effective Borel measurability and reducibility of functions
- Effective Choice and Boundedness Principles in Computable Analysis
- How incomputable is finding Nash equilibria?
- How incomputable is the separable Hahn-Banach theorem?
- Nicht konstruktiv beweisbare Sätze der Analysis
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On the (semi)lattices induced by continuous reducibilities
- On the computational content of the Brouwer fixed point theorem
- On the interpretation of non-finitist proofs–Part II
- Probabilistic computability and choice
- Recursive Real Numbers
- Singular coverings and non‐uniform notions of closed set computability
- Subsystems of second order arithmetic
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- Towards computability of elliptic boundary value problems in variational formulation
- Weihrauch degrees, omniscience principles and weak computability
Cited in
(6)- scientific article; zbMATH DE number 733515 (Why is no real title available?)
- Highness properties close to PA completeness
- New Computational Paradigms
- scientific article; zbMATH DE number 2006635 (Why is no real title available?)
- Alan Turing and the foundations of computable analysis
- Weihrauch Complexity in Computable Analysis
This page was built for publication: Computability and analysis, a historical approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188239)
