Super-Recursive Algorithms (Monographs in Computer Science) by Mark Burgin
English | Dec. 1, 2004 | ISBN: 0387955690 | 313 Pages | PDF | 2 MB
English | Dec. 1, 2004 | ISBN: 0387955690 | 313 Pages | PDF | 2 MB
* 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