On computable sequences
From MaRDI portal
Publication:3244108
DOI10.4064/fm-44-1-37-51zbMath0079.24702OpenAlexW4245102239MaRDI QIDQ3244108
Publication date: 1957
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213420
Related Items
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Approximation to measurable functions and its relation to probabilistic computation, Semi-effective numberings and definitions of the computable numbers, On the continued fraction representation of computable real numbers, Representations of the real numbers and of the open subsets of the set of real numbers, On the complexity of computable real sequences, The wave equation with computable initial data such that its unique solution is not computable, The binary expansion and the intermediate value theorem in constructive reverse mathematics, Computable irrational numbers with representations of surprising complexity, Computational complexity of real functions, On the definitions of some complexity classes of real numbers, Primitive Recursiveness of Real Numbers under Different Representations, In memory of Andrzej Mostowski, A comparison of identification criteria for inductive inference of recursive real-valued functions, Relatively recursive reals and real functions, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, Reducibilities on real numbers, Using PVS to validate the algorithms of an exact arithmetic., Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity), Liouville numbers and the computational complexity of changing bases, On the complexity of conversion between classic real number representations, Über die Bestimmbarkeit des Verhaltens von Algorithmen, Dedekind cuts and long strings of zeros in base expansions
