Skip to main content
Free carbon-neutral shipping over $39.99  ·  Thousands of books on sale — sale ends soon

Super-Recursive Algorithms (Hardback)

by Mark Burgin

Springer

Hardback or Cased Book 304 pages Dec 01, 2004

(No reviews yet) Write a Review
Millions of titlesEvery book you're looking for
Carbon-neutral shippingFree on orders over $39.99
Fast shipping worldwideDelivered to your door
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.
Author:
Mark Burgin
Publisher:
Springer
Publication Date:
Dec 01, 2004
Number of pages:
304 pages
Binding:
Hardback or Cased Book
ISBN-10:
0387955690
ISBN-13:
9780387955698