Super-recursive algorithms / Mark Burgin.
"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 appropr...
Saved in:
| Main Author: | |
|---|---|
| Format: | Ebook |
| Language: | English |
| Published: |
New York, NY :
Springer,
[2005]
|
| Series: | Monographs in computer science.
|
| Subjects: | |
| Online Access: | Springer eBooks Connect to full text. |
| Summary: | "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."--Publisher's website. |
|---|---|
| Physical Description: | 1 online resource (xii, 304 pages) : illustrations. |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 0387955690 9780387955698 0387268065 9780387268064 1281114340 9781281114341 |