Super-Recursive Algorithms

* 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

 

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.