scientific article; zbMATH DE number 1390023

MaRDI QIDQ4934288zbMATH OpenFDO

Authors Marian Boykan Pour-El

Publication date 8 October 2000

zbMATH Keywords

Banach spacecomputable \(L^p\)-functionscomputable analysiscomputable real functionscomputable realscomputable sequences of reals

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Constructive functional analysis (46S30)

Recommendations

• New Computational Paradigms
• scientific article; zbMATH DE number 1344955
• scientific article; zbMATH DE number 1460545
• A tutorial on computable analysis
• Computability in analysis and physics

Cited in

(17)

• On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
• Developing a mathematical theory of computability which speaks the language of levels
• Church's thesis and the conceptual analysis of computability
• On choosing the correct model for computability over the reals
• First steps in synthetic computability theory
• Computability in analysis
• Local computability and uncountable structures
• scientific article; zbMATH DE number 3950525 (Why is no real title available?)
• scientific article; zbMATH DE number 2006635 (Why is no real title available?)
• Theses for computation and recursion on concrete and abstract structures
• scientific article; zbMATH DE number 1909822 (Why is no real title available?)
• Computability beyond Church-Turing via choice sequences
• Computability in analysis and physics
• New Computational Paradigms
• Effectiveness in RPL, with applications to continuous logic
• Is the concept of computation a conceptual fixed point?
• Pure mathematics and physical reality (continuity and 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)