Super-Recursive Algorithms

by Mark Burgin

* 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

316 pages, Hardcover

First published December 1, 2004

Reviews

[Mark Moon · Rating 4 out of 5]

Five-star content with a three-star presentation. What happened to copy-editing?