Complexity and Real Computation
id:
complexity-and-real-computation-198-6619160
title:
Complexity and Real Computation
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
1998 non-fiction book
original url:
https://en.wikipedia.org/wiki/Complexity_and_Real_Computation
date created:
date modified:
2022-08-09T09:21:19Z
main entity:
{"identifier":"Q85753701","url":"https://www.wikidata.org/entity/Q85753701"}
image:
fields total:
13
integrity:
14