Recursive Real Numbers - MaRDI portal

Cited in

(49)

Computability of Real Numbers
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)
Recursive function theory and numerical analysis
On the continued fraction representation of computable real numbers
On the hierarchy and extension of monotonically computable real numbers.
Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms
Presentations of computably enumerable reals.
When series of computable functions with varying domains are computable
Computational complexity of real functions
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Weakly computable real numbers
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
\(\delta\)-uniform BSS machines
Classification of the computable approximations by divergence boundings
Degrees of Computability
Relatively recursive reals and real functions
PCF extended with real numbers
Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
Randomness and reducibility
Classification of computably approximable real numbers
An abstract data type for real numbers
On effectively computable realizations of choice functions
Using PVS to validate the algorithms of an exact arithmetic.
Computably and punctually universal spaces
Computability of Self-Similar Sets
Real numbers, continued fractions and complexity classes
Computability and analysis, a historical approach
Probabilistic Recursive Functions
Rekursive reelle Zahlen
Spectrum of the field of computable real numbers
Lower bounds on degrees of game-theoretic structures
Algebraic varieties are homeomorphic to varieties defined over number fields
On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
Computation by `While' programs on topological partial algebras
An alternate approach to axiomatizations of the von Neumann/Morgenstern characteristic function
A domain-theoretic approach to computability on the real line
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
Reducibilities on real numbers
Undecidability in physics: a review
Non recursive functions have transcendental generating series
On the definitions of some complexity classes of real numbers
Classes of matrices for the traveling salesman problem
The concept of effective method applied to computational problems of linear algebra
scientific article; zbMATH DE number 3230252 (Why is no real title available?)
Complexity of the calculus of continued fraction representation of real numbers
Primitive recursiveness of real numbers under different representations
Notes on computable analysis
On the hierarchies of Δ₂⁰-real numbers
On the complexity of computable real sequences

This page was built for publication: Recursive Real Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5831321)