Super-Recursive Algorithms
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
149.79 €
Produktdetails
Produktinformationen zu „Super-Recursive Algorithms “
Klappentext zu „Super-Recursive Algorithms “
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
Inhaltsverzeichnis zu „Super-Recursive Algorithms “
- Introduction- Recursive Algorithms
- Subrecursive Algorithms
- Super-Recursive Algorithms: Problems of Computability
- Super-Recursive Algorithms: Problems of Efficiency
- Conclusion
Autoren-Porträt von Mark Burgin
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.
Bibliographische Angaben
- Autor: Mark Burgin
- 2004, 2005, 304 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Herausgegeben: David Gries, Fred B. Schneider
- Verlag: Springer, New York
- ISBN-10: 0387955690
- ISBN-13: 9780387955698
- Erscheinungsdatum: 01.12.2004
Sprache:
Englisch
Rezension zu „Super-Recursive Algorithms “
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)
Kommentar zu "Super-Recursive Algorithms"
0 Gebrauchte Artikel zu „Super-Recursive Algorithms“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Super-Recursive Algorithms".
Kommentar verfassen