Hugendubel.de - Das Lesen ist schön

Warenkorb

€ 0,00 0 Buch dabei,
portofrei
50% und mehr sparen mit den eBook Schnäppchen der Woche >>
Klick ins Buch Super-Recursive Algorithms als Buch
PORTO-
FREI

Super-Recursive Algorithms

'Monographs in Computer Science'. Auflage 2005. Book. Sprache: Englisch.
Buch (gebunden)
* 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 mathemati... weiterlesen
Dieses Buch ist auch verfügbar als:
Buch

165,49*

inkl. MwSt.
Portofrei
Lieferbar innerhalb von zwei bis drei Werktagen
Super-Recursive Algorithms als Buch
Produktdetails
Titel: Super-Recursive Algorithms
Autor/en: Mark Burgin

ISBN: 0387955690
EAN: 9780387955698
'Monographs in Computer Science'.
Auflage 2005.
Book.
Sprache: Englisch.
Springer New York

1. Dezember 2004 - gebunden - 320 Seiten

Beschreibung

* 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

* Introduction * Recursive Algorithms * Subrecursive Algorithms * Superrecursive Algorithms: Problems of computability * Superrecursive Algorithms: Problems of Efficiency * Conclusion: Problems of Information Technology and Computer Science Development References and Sources for Additional Reading Index

Portrait

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.

Pressestimmen

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)
Servicehotline
089 - 70 80 99 47

Mo. - Fr. 8.00 - 20.00 Uhr
Sa. 10.00 - 20.00 Uhr
Filialhotline
089 - 30 75 75 75

Mo. - Sa. 9.00 - 20.00 Uhr
Bleiben Sie in Kontakt:
Sicher & bequem bezahlen:
akzeptierte Zahlungsarten: Überweisung, offene Rechnung,
Visa, Master Card, American Express, Paypal
Zustellung durch:
* Alle Preise verstehen sich inkl. der gesetzlichen MwSt. Informationen über den Versand und anfallende Versandkosten finden Sie hier.
** im Vergleich zum dargestellten Vergleichspreis.