New York: Springer, 2004. - 313p.
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.