| http://dbpedia.org/ontology/abstract
|
Complexity and Real Computation is a book … 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 .and published by Springer-Verlag in 1998 .
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://archive.org/details/complexityrealco0000unse +
|
| http://dbpedia.org/ontology/wikiPageID
|
63053280
|
| http://dbpedia.org/ontology/wikiPageLength
|
6584
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1103353363
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Semialgebraic_set +
, http://dbpedia.org/resource/Real_computation +
, http://dbpedia.org/resource/Lenore_Blum +
, http://dbpedia.org/resource/Stephen_Smale +
, http://dbpedia.org/resource/Real_number +
, http://dbpedia.org/resource/Rational_number +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Michael_Shub +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Scientific_computing +
, http://dbpedia.org/resource/Computational_geometry +
, http://dbpedia.org/resource/Integer +
, http://dbpedia.org/resource/Algebraic_number_theory +
, http://dbpedia.org/resource/Algebraic_curves +
, http://dbpedia.org/resource/Mathematical_logic +
, http://dbpedia.org/resource/Category:1998_non-fiction_books +
, http://dbpedia.org/resource/Model_of_computation +
, http://dbpedia.org/resource/Polynomial +
, http://dbpedia.org/resource/Category:Models_of_computation +
, http://dbpedia.org/resource/Linear_programming +
, http://dbpedia.org/resource/Recursion_theory +
, http://dbpedia.org/resource/Floor_and_ceiling_functions +
, http://dbpedia.org/resource/Numerical_analysis +
, http://dbpedia.org/resource/Structural_complexity_theory +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Zero_of_a_function +
, http://dbpedia.org/resource/Doi:10.1007/978-1-4612-0701-6 +
, http://dbpedia.org/resource/Category:Mathematics_books +
, http://dbpedia.org/resource/Mandelbrot_set +
, http://dbpedia.org/resource/Complex_number +
, http://dbpedia.org/resource/Cook%E2%80%93Levin_theorem +
, http://dbpedia.org/resource/Turing_machine +
, http://dbpedia.org/resource/Condition_number +
, http://dbpedia.org/resource/The_Emperor%27s_New_Mind +
, http://dbpedia.org/resource/Blum%E2%80%93Shub%E2%80%93Smale_machine +
, http://dbpedia.org/resource/Richard_M._Karp +
, http://dbpedia.org/resource/Numerical_certification +
, http://dbpedia.org/resource/Category:Computational_complexity_theory +
, http://dbpedia.org/resource/Roger_Penrose +
, http://dbpedia.org/resource/Topology +
, http://dbpedia.org/resource/GF%282%29 +
, http://dbpedia.org/resource/Lefschetz_principle +
, http://dbpedia.org/resource/Newton%27s_method +
, http://dbpedia.org/resource/Algebraically_closed_field +
, http://dbpedia.org/resource/Dynamical_system +
, http://dbpedia.org/resource/Felipe_Cucker +
, http://dbpedia.org/resource/Springer-Verlag +
, http://dbpedia.org/resource/P_versus_NP_problem +
, http://dbpedia.org/resource/Eric_Bach +
, http://dbpedia.org/resource/Differential_geometry +
, http://dbpedia.org/resource/Algebraic_geometry +
, http://dbpedia.org/resource/Descriptive_complexity_theory +
, http://dbpedia.org/resource/Ring_%28mathematics%29 +
, http://dbpedia.org/resource/Characteristic_%28algebra%29 +
, http://dbpedia.org/resource/Internet_Archive +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:ISBN +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:R +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Italic_title +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:1998_non-fiction_books +
, http://dbpedia.org/resource/Category:Mathematics_books +
, http://dbpedia.org/resource/Category:Computational_complexity_theory +
, http://dbpedia.org/resource/Category:Models_of_computation +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Complexity_and_Real_Computation?oldid=1103353363&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Complexity_and_Real_Computation +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q85753701 +
, http://dbpedia.org/resource/Complexity_and_Real_Computation +
, https://global.dbpedia.org/id/Bz4Fr +
|
| rdfs:comment |
Complexity and Real Computation is a book … 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 .and published by Springer-Verlag in 1998 .
|
| rdfs:label |
Complexity and Real Computation
|
