Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Higher recursion theory
Complexity theory of real functions
Complexity theory of real functions
Computing over the reals with addition and order
Selected papers of the workshop on Continuous algorithms and complexity
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Complexity and real computation
Complexity and real computation
Relatively recursive reals and real functions
Theoretical Computer Science - Special issue on real numbers and computers
Feasible real random access machines
Journal of Complexity
Theoretical Computer Science - Special issue on computability and complexity in analysis
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
Minds and Machines
Topological properties of real number representations
Theoretical Computer Science
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
On the Power of Random Access Machines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Recursiveness over the Complex Numbers is Time-Bounded
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Modern Computer Algebra
Analog computers and recursive functions over the reals
Journal of Complexity
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
RealLib: An efficient implementation of exact real arithmetic
Mathematical Structures in Computer Science
Type-2 Computability and Moore's Recursive Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Complexity Theory
Uncomputability below the real halting problem
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
An explicit solution to post's problem over the reals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Abstract Geometrical Computation and Computable Analysis
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
| Hi-index | 0.00 |
We survey and compare models of computation on real numbers exceeding the Church---Turing Hypothesis.