Computability in Analysis and Physics

DOI10.1017/9781316717325zbMath1365.03010OpenAlexW4300665568MaRDI QIDQ5274810

Ian Richards, Marian Boykan Pour-El

Publication date: 6 July 2017

Full work available at URL: https://doi.org/10.1017/9781316717325

zbMATH Keywords

recursive analysiscomputable operatorscomputable Banach spacecomputable \(C^ 1\) function

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to functional analysis (46-02) Applications of computability and recursion theory (03D80) Constructive functional analysis (46S30)

Related Items (14)

Randomness and differentiability ⋮ Semantics of computable physical models ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Effectiveness in RPL, with applications to continuous logic ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Computability and the morphological complexity of some dynamics on continuous domains ⋮ The prime number theorem is PRA-provable ⋮ Finite time blowup for an averaged three-dimensional Navier-Stokes equation ⋮ A refined model of computation for continuous problems ⋮ On the inductive inference of recursive real-valued functions ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Index sets in computable analysis ⋮ Concrete models of computation for topological algebras ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

This page was built for publication: Computability in Analysis and Physics