Über den Autor
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.
* 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
* 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
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.