Publication:5720193
From MaRDI portal
zbMath0113.24306MaRDI QIDQ5720193
Publication date: 1963
03-XX: Mathematical logic and foundations
Related Items
Computational unsolvability of domains of attraction of nonlinear systems, Non-computable Julia sets, Computability of Brolin-Lyubich measure, A sequentially computable function that is not effectively continuous at any point, Non-recursiveness of the operations on real numbers, Generalized Banach-Mazur functionals in the topos of recursive sets, A domain-theoretic approach to computability on the real line, Markov's constructive analysis; a participant's view, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II, Computability on subsets of metric spaces., Hypercomputation by definition, A Banach-Mazur computable but not Markov computable function on the computable real numbers, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, Computability, noncomputability and undecidability of maximal intervals of IVPs