Super-Recursive Algorithms (2005)

Title: Super-Recursive Algorithms (2005)
Author: Mark Burgin
ISBN: 9780387955698
Publisher: Springer
Published: 2004
Binding: Hardcover
Language: English
Edition: 2005
Number of Pages: 316
Condition Note: Clean, unmarked copy with some edge wear. Good binding. Dust jacket included if issued with one. We ship in recyclable American-made mailers. 100% money-back guarantee on all orders.
Publisher 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.