Complexity and Real Computation

Complexity and Real Computation is a book on the <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a> of <a href="/facts/Real_computation/WGSGTvDx">real computation</a>. It studies <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> whose inputs and outputs are <a href="/facts/Real_number/R02gw5Pb">real numbers</a>, using the <a href="/facts/Blum%E2%80%93Shub%E2%80%93Smale_machine/m6Ru21QJ">Blum–Shub–Smale machine</a> as its <a href="/facts/Model_of_computation/nJr8mHSI">model of computation</a>. For instance, this theory is capable of addressing a question posed in 1991 by <a href="/facts/Roger_Penrose/r4mlrFUH">Roger Penrose</a> in <a href="/facts/The_Emperor%27s_New_Mind/eYAE87Yl">The Emperor's New Mind</a>: "is the <a href="/facts/Mandelbrot_set/2NVUgrVG">Mandelbrot set</a> computable?"
The book was written by <a href="/facts/Lenore_Blum/zxIqunDX">Lenore Blum</a>, <a href="/facts/Felipe_Cucker/vVy53r0X">Felipe Cucker</a>, <a href="/facts/Michael_Shub/rEMUNnA4">Michael Shub</a> and <a href="/facts/Stephen_Smale/vtMg3cAF">Stephen Smale</a>, with a foreword by <a href="/facts/Richard_M._Karp/XtYCL0nA">Richard M. Karp</a>, and published by <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a> in 1998 (doi:10.1007/978-1-4612-0701-6, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-387-98281-7).

Complexity and Real Computation open-in-new

Complexity and Real Computation