* 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
Table of Content
* 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 IndexAbout the author
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.
Language English ● Format PDF ● Pages 304 ● ISBN 9780387268064 ● File size 2.5 MB ● Publisher Springer New York ● City NY ● Country US ● Published 2006 ● Downloadable 24 months ● Currency EUR ● ID 2144287 ● Copy protection Adobe DRM
Requires a DRM capable ebook reader