Timothy H. McNicholl
- N. Immerman, Descriptive Complexity. Springer-Verlag, 1998.Google Scholar
- P.G. Odifreddi, Classical Recursion Theory, Volume 1. Elsevier, 1992.Google Scholar
- R. Penrose, The Emperor's New Mind. Penguin, 1991.Google Scholar
- H.G. Rice, Recursive real numbers. Proc. Am. Math. Soc. 5 (1954) 784--790.Google ScholarCross Ref
- R. Soare, Computably Enumerable Sets and Degrees. Springer-Verlag, 1987. Google ScholarDigital Library
Index Terms
- Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag.
Recommendations
A Weak Version of the Blum, Shub, and Smale Model
Special issue: dedicated to the memory of Paris KanellakisWe propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a “moderate” usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown ...
A weak version of the Blum, Shub and Smale model
SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer ScienceWe propose a weak version of the Blum-Shub-Smale model (1989) of computation over the real numbers. In this weak model only a "moderate" usage of multiplications and divisions is allowed. The class of languages recognizable in polynomial time as shown ...
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real WorldAbstract geometrical computation naturally arises as acontinuous counterpart of cellular automata. It relies on signals(dimensionless points) traveling at constant speed in a continuousspace in continuous time. When signals collide, they are replacedby ...
Comments