The following pages link to Recursive Real Numbers (Q5831321):
Displaying 47 items.
- Notes on computable analysis (Q519888) (← links)
- Real numbers, continued fractions and complexity classes (Q751655) (← links)
- Rekursive reelle Zahlen (Q767909) (← links)
- Algebraic varieties are homeomorphic to varieties defined over number fields (Q784197) (← links)
- Reducibilities on real numbers (Q795039) (← links)
- Classes of matrices for the traveling salesman problem (Q804474) (← 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)
- Classification of computably approximable real numbers (Q1015380) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Recursive function theory and numerical analysis (Q1216028) (← links)
- \(\delta\)-uniform BSS machines (Q1271171) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Relatively recursive reals and real functions (Q1274809) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- On the hierarchy and extension of monotonically computable real numbers. (Q1426053) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Complexity of the calculus of continued fraction representation of real numbers (Q1814099) (← links)
- An alternate approach to axiomatizations of the von Neumann/Morgenstern characteristic function (Q1823882) (← links)
- Using PVS to validate the algorithms of an exact arithmetic. (Q1853641) (← links)
- Randomness and reducibility (Q1878680) (← links)
- An abstract data type for real numbers (Q1960529) (← links)
- Spectrum of the field of computable real numbers (Q2401539) (← links)
- The concept of effective method applied to computational problems of linear algebra (Q2546145) (← links)
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata (Q2866110) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- Degrees of Computability (Q3232282) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
- On the complexity of computable real sequences (Q3773335) (← links)
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) (Q4049052) (← links)
- Computability of Self-Similar Sets (Q4238423) (← links)
- Non recursive functions have transcendental generating series (Q4732456) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
- Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
- Classification of the Computable Approximations by Divergence Boundings (Q4921449) (← links)
- Computability of Real Numbers (Q5024567) (← links)
- When series of computable functions with varying domains are computable (Q5396227) (← links)
- On the hierarchies of Δ<sub>2</sub><sup>0</sup>-real numbers (Q5444099) (← links)
- (Q5518362) (← links)
- Probabilistic Recursive Functions (Q5685067) (← links)
- Weakly computable real numbers (Q5925970) (← links)
- Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms (Q6103515) (← links)
