Super-Recursive Algorithms

Mark Burgin

ISBN 10: 1441930604 / ISBN 13: 9781441930606

Published by Springer New York Dez 2010, 2010

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -\* The first exposition on super-recursive algorithms, systematizing all main classes and providingan 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\*Developsa new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole 316 pp. Englisch.

Seller Inventory # 9781441930606

Bibliographic Details

• Title: Super-Recursive Algorithms
• Publisher: Springer New York Dez 2010
• Publication Date: 2010
• Language: English
• ISBN 10: 1441930604
• ISBN 13: 9781441930606
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 18D millimeters 235 millimeters width by 155 millimeters height by 18 millimeters depth
• Weight: 482 grams

About this title

Synopsis

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.

About the Author

 

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.