scientific article; zbMATH DE number 1390023
This is a brief introduction to the computability in analysis and physical theory. Basic notions of computability in analysis like ``computable reals, ``computable sequences of reals, ``computable real functions and ``computable \(L^p\)-functions are introduced and briefly discussed in Part 1. Part 2 discusses the computability on Banach space applying an axiomatical approach. A more complete and systematical discussion about these topics can be found in the book by the author and \textit{J. I. Richards} [Computability in analysis and physics (Springer, Berlin) (1989; Zbl 0678.03027)]. For the entire collection see [Zbl 0923.03001].
- 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)
