|
![]() |
|||
|
||||
OverviewSuper-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. Full Product DetailsAuthor: Mark BurginPublisher: Springer Imprint: Springer ISBN: 9786611114343ISBN 10: 6611114343 Pages: 314 Publication Date: 01 January 2005 Audience: General/trade , General Format: Electronic book text Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |