Super-Recursive Algorithms

1. Auflage. Softcover version of original hardcover Auflage 2005
ISBN: 978-1-4419-3060-6
Verlag: Springer

Buch, Englisch, 304 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 482 g

Reihe: Monographs in Computer Science

* 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

Zielgruppe

Research

Autoren/Hrsg.

Burgin, Mark

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik

Inhaltsverzeichnis

Recursive Algorithms.- Subrecursive Algorithms.- Superrecursive Algorithms: Problems of Computability.- Superrecursive Algorithms: Problems of Efficiency.- Conclusion: Problems of Information Technology and Computer Science Development.

Über Autor(innen)

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.