Complexity and Real Computation
Complexity and Real Computation is a book on the computational complexity theory of real computation. It studies algorithms whose inputs and outputs are real numbers, using the Blum–Shub–Smale machine as its model of computation. For instance, this theory is capable of addressing a question posed in 1991 by Roger Penrose in "The Emperor's New Mind": "is the Mandelbrot set computable?"

The book was written by Lenore Blum, Felipe Cucker, Michael Shub and Stephen Smale, with a foreword by Richard M. Karp, and published by Springer-Verlag in 1998 (, ).
Q205084
computational complexity theory
Concept
Q7301125
real computation
UNK
Q8366
algorithm
Concept
Q12916
real number
Concept
Q3274386
Blum–Shub–Smale machine
MISC
Q2651576
model of computation
Concept
Q193803
Roger Penrose
PER
Q1448484
The Emperor's New Mind
ORG
Q257
Mandelbrot set
Concept
Q93004
Lenore Blum
PER
Q37029316
Felipe Cucker
PER
Q3308514
Michael Shub
PER
Q315394
Stephen Smale
PER
Q92612
Richard M. Karp
PER
Q176916
Springer-Verlag
ORG
Q85753701
Complexity and Real Computation
MEDIA
1991-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
1991
DATE
1998-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
1998
DATE
author
author
author
author
author