Mark Burgin

(Author)

Super-Recursive Algorithms (2005)Hardcover - 2005, 1 December 2004

Super-Recursive Algorithms (2005)
Qty
1
Turbo
Ships in 2 - 3 days
In Stock
Free Delivery
Cash on Delivery
15 Days
Free Returns
Secure Checkout
Buy More, Save More
Part of Series
Monographs in Computer Science
Print Length
304 pages
Language
English
Publisher
Springer
Date Published
1 Dec 2004
ISBN-10
0387955690
ISBN-13
9780387955698

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.

Product Details

Author:
Mark Burgin
Book Edition:
2005
Book Format:
Hardcover
Country of Origin:
US
Date Published:
1 December 2004
Dimensions:
23.32 x 16.05 x 2.03 cm
ISBN-10:
0387955690
ISBN-13:
9780387955698
Language:
English
Location:
New York, NY
Pages:
304
Publisher:
Weight:
598.74 gm

Related Categories


Need Help?
+971 6 731 0280
support@gzb.ae

About UsContact UsPayment MethodsFAQsShipping PolicyRefund and ReturnTerms of UsePrivacy PolicyCookie Notice

VisaMastercardCash on Delivery

© 2024 White Lion General Trading LLC. All rights reserved.