scientific article; zbMATH DE number 1390023
From MaRDI portal
zbMATH Open0945.03091MaRDI QIDQ4934288FDOQ4934288
Authors: Marian Boykan Pour-El 
Publication date: 8 October 2000
Title of this publication is not available (Why is that?)
Recommendations
Banach spacecomputable analysiscomputable realscomputable real functionscomputable \(L^p\)-functionscomputable sequences of reals
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Constructive and recursive analysis (03F60) Constructive functional analysis (46S30) Constructive real analysis (26E40)
Cited In (15)
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
- Computability beyond Church-Turing via choice sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- First steps in synthetic computability theory
- On choosing the correct model for computability over the reals
- New Computational Paradigms
- Theses for computation and recursion on concrete and abstract structures
- Title not available (Why is that?)
- Computability in analysis and physics
- Effectiveness in RPL, with applications to continuous logic
- Computability in analysis
- Local computability and uncountable structures
- Pure mathematics and physical reality (continuity and computability)
- Church's thesis and the conceptual analysis of computability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934288)
