The following pages link to On computable sequences (Q3244108):
Displaying 26 items.
- Reducibilities on real numbers (Q795039) (← links)
- 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) (Q804571) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- Representations of the real numbers and of the open subsets of the set of real numbers (Q1101448) (← links)
- The wave equation with computable initial data such that its unique solution is not computable (Q1154609) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- In memory of Andrzej Mostowski (Q1237769) (← links)
- Relatively recursive reals and real functions (Q1274809) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- The binary expansion and the intermediate value theorem in constructive reverse mathematics (Q1712938) (← links)
- Using PVS to validate the algorithms of an exact arithmetic. (Q1853641) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Liouville numbers and the computational complexity of changing bases (Q2106591) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- Dedekind cuts and long strings of zeros in base expansions (Q2117788) (← links)
- Computable irrational numbers with representations of surprising complexity (Q2216036) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
- On the complexity of computable real sequences (Q3773335) (← links)
- Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
- Über die Bestimmbarkeit des Verhaltens von Algorithmen (Q5528644) (← links)
- Semi-effective numberings and definitions of the computable numbers (Q5569449) (← links)
- A comparison of identification criteria for inductive inference of recursive real-valued functions (Q5958650) (← links)
- Computer Science for Continuous Data (Q6487409) (← links)
- Interplay between insertion of zeros and the complexity of Dedekind cuts (Q6594830) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
