On computable sequences

From MaRDI portal
Revision as of 21:59, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3244108

DOI10.4064/FM-44-1-37-51zbMath0079.24702OpenAlexW4245102239MaRDI QIDQ3244108

Andrzej Mostowski

Publication date: 1957

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213420




Related Items (23)

Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computationsApproximation to measurable functions and its relation to probabilistic computationSemi-effective numberings and definitions of the computable numbersOn the continued fraction representation of computable real numbersRepresentations of the real numbers and of the open subsets of the set of real numbersOn the complexity of computable real sequencesThe wave equation with computable initial data such that its unique solution is not computableThe binary expansion and the intermediate value theorem in constructive reverse mathematicsComputable irrational numbers with representations of surprising complexityComputational complexity of real functionsOn the definitions of some complexity classes of real numbersPrimitive Recursiveness of Real Numbers under Different RepresentationsIn memory of Andrzej MostowskiA comparison of identification criteria for inductive inference of recursive real-valued functionsRelatively recursive reals and real functionsPoint-free topological spaces, functions and recursive points; filter foundation for recursive analysis. IReducibilities on real numbersUsing 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 basesOn the complexity of conversion between classic real number representationsÜber die Bestimmbarkeit des Verhaltens von AlgorithmenDedekind cuts and long strings of zeros in base expansions







This page was built for publication: On computable sequences