Recursive Real Numbers

DOI10.2307/2031867zbMath0058.00602OpenAlexW4298175790MaRDI QIDQ5831321

Henry Gordon Rice

Publication date: 1954

Full work available at URL: https://doi.org/10.2307/2031867

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (47)

Randomness and reducibility ⋮ On the continued fraction representation of computable real numbers ⋮ PCF extended with real numbers ⋮ Computability and Analysis, a Historical Approach ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Spectrum of the field of computable real numbers ⋮ Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms ⋮ Unnamed Item ⋮ On the complexity of computable real sequences ⋮ An abstract data type for real numbers ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Computational complexity of real functions ⋮ When series of computable functions with varying domains are computable ⋮ On the definitions of some complexity classes of real numbers ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ Notes on computable analysis ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ Weakly computable real numbers ⋮ Primitive Recursiveness of Real Numbers under Different Representations ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ Recursive function theory and numerical analysis ⋮ Probabilistic Recursive Functions ⋮ On the hierarchies of Δ₂⁰-real numbers ⋮ Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) ⋮ Classification of computably approximable real numbers ⋮ Real numbers, continued fractions and complexity classes ⋮ Complexity of the calculus of continued fraction representation of real numbers ⋮ Degrees of Computability ⋮ \(\delta\)-uniform BSS machines ⋮ A domain-theoretic approach to computability on the real line ⋮ Relatively recursive reals and real functions ⋮ The concept of effective method applied to computational problems of linear algebra ⋮ An alternate approach to axiomatizations of the von Neumann/Morgenstern characteristic function ⋮ Rekursive reelle Zahlen ⋮ Non recursive functions have transcendental generating series ⋮ Computation by `While' programs on topological partial algebras ⋮ Algebraic varieties are homeomorphic to varieties defined over number fields ⋮ 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. ⋮ Recursively Generated Evolutionary Turing Machines and Evolutionary Automata ⋮ Classes of matrices for the traveling salesman problem ⋮ 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) ⋮ Computability of Self-Similar Sets ⋮ Computability of Real Numbers ⋮ Presentations of computably enumerable reals. ⋮ On effectively computable realizations of choice functions

This page was built for publication: Recursive Real Numbers