scientific article; zbMATH DE number 1390023
From MaRDI portal
Recommendations
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
- scientific article; zbMATH DE number 2006635 (Why is no real title available?)
- scientific article; zbMATH DE number 1909822 (Why is no real title available?)
- First steps in synthetic computability theory
- On choosing the correct model for computability over the reals
- Theses for computation and recursion on concrete and abstract structures
- New Computational Paradigms
- scientific article; zbMATH DE number 3950525 (Why is no real title available?)
- 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)