Super-Recursive Algorithms

By Mark Burgin

Super-Recursive Algorithms Cover Image

  • ISBN13: 978-0-3879-5569-8
  • 320 Pages
  • User Level: Science
  • Publication Date: December 22, 2006
  • Available eBook Formats: PDF
  • eBook Price: $79.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
Super-Recursive Algorithms provides an accessible, focused examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed. This clear exposition, motivated by numerous examples and illustrations, serves researchers and advanced students interested in theory of computation and algorithms.
Table of Contents

Table of Contents

  1. Introduction.
  2. Recursive Algorithms.
  3. Subrecursive Algorithms.
  4. Super
  5. Recursive Algorithms: Problems of Computability.
  6. Super
  7. Recursive Algorithms: Problems of Efficiency.
  8. Conclusion.
Errata

Please Login to submit errata.

No errata are currently published