Computability and analysis, a historical approach

DOI10.1007/978-3-319-40189-8_5zbMATH Open1476.03063arXiv1602.07509OpenAlexW3102609132MaRDI QIDQ3188239FDOQ3188239

Authors: Vasco Brattka 

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1602.07509

Recommendations

• Alan Turing and the foundations of computable analysis
• Publication:4934276
• Computability and Incomputability
• New Computational Paradigms
• Notes on computable analysis

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Computation over the reals, computable analysis (03D78) 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)

Cites Work

• Subsystems of second order arithmetic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tutorial on computable analysis
• On the interpretation of non-finitist proofs–Part II
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• How incomputable is finding Nash equilibria?
• An effective Riemann Mapping Theorem
• Weihrauch degrees, omniscience principles and weak computability
• Nicht konstruktiv beweisbare Sätze der Analysis
• Computable functionals
• Computability on subsets of metric spaces.
• On the (semi)lattices induced by continuous reducibilities
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective Borel measurability and reducibility of functions
• Singular coverings and non‐uniform notions of closed set computability
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Borel complexity and computability of the Hahn-Banach theorem
• How incomputable is the separable Hahn-Banach theorem?
• Towards computability of elliptic boundary value problems in variational formulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive Real Numbers
• On the computational content of the Brouwer fixed point theorem
• A computable ordinary differential equation which possesses no computable solution
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• Title not available (Why is that?)
• A computable version of Banach's inverse mapping theorem
• Title not available (Why is that?)
• Probabilistic computability and choice
• Computability of the Radon-Nikodym derivative
• Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes

Cited In (6)

• Title not available (Why is that?)
• Alan Turing and the foundations of computable analysis
• New Computational Paradigms
• Highness properties close to PA completeness
• Title not available (Why is that?)
• 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)