* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications
* Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods
* Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
From the reviews:
"This book provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. ... The exposition of the book is motivated by numerous examples and illustrations. It serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms." (Vilmar Trevisan, Zentralblatt MATH, Vol. 1070, 2005)
"This important, exciting book synthesizes all ... isolated ‘heresies’ from the journal literature into a new, lively, coherent discipline. Beyond obvious interest to mathematicians and computer scientists, the book should attract physicists and philosophers. ... Chapters here on recursive and even subrecursive algorithms provide background and context sufficient to render this book reasonably self-contained. Summing Up: Highly recommended. General readers; lower-division undergraduates through professionals." (D. V. Feldman, CHOICE, Vol. 42 (11), July, 2005)
"This new book by Mark Burgin, Super-recursive algorithms, covers a wide variety of computational models. ... I can say that reading the book gives pleasure to the reader interested in understanding what is going on in the so-called hypercomputation community. ... the book might also be interesting from the point of view of the philosophy of computational science. ... The book provides valuable information ... ." (José Félix Costa, Mathematical Reviews, Issue 2008 f)
Burgin published extensively on this new theoretical topic. Based on UCLA lectures, articles, invited ACM Communications Survey article (11/01), and invited High Performance Computing Symposium presentation.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
GRATIS
In U.S.A.
Descrizione libro Hardcover. Condizione: new. Codice articolo 9780387955698
Descrizione libro Condizione: New. New. In shrink wrap. Looks like an interesting title! 0.79. Codice articolo Q-0387955690
Descrizione libro Condizione: New. Codice articolo ABLIING23Feb2215580174638
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9780387955698_lsuk
Descrizione libro Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -\* The first exposition on super-recursive algorithms, systematizing all main classes and providingan accessible, focused examination of the theory and its ramifications\*Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods\*Developsa new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole 320 pp. Englisch. Codice articolo 9780387955698
Descrizione libro Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. * The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications* Demonstrates how these algorithms are more appropriate as mathemat. Codice articolo 5912608
Descrizione libro Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Super-Recursive Algorithms provides an accessible, focused examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed. This clear exposition, motivated by numerous examples and illustrations, serves researchers and advanced students interested in theory of computation and algorithms. Codice articolo 9780387955698
Descrizione libro Condizione: New. pp. 320. Codice articolo 26290513
Descrizione libro Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780387955698
Descrizione libro Condizione: New. pp. 320 Illus. Codice articolo 7590158