null Skip to main content

✨ Buy more, save 5% Ends

Super-Recursive Algorithms

Super-Recursive Algorithms - Paperback

$117.22
(No reviews yet) Write a Review
Physical book delivery

Shipping calculated at checkout.

Estimated delivery
Adding to cart… The item has been added
Product Details
Author:
Mark Burgin
Publisher:
Springer
Publication Date:
Dec 06, 2010
Number of pages:
304 pages
Binding:
Paperback or Softback
ISBN-10:
1441930604
ISBN-13:
9781441930606

Overview

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 06, 2010
  • | Number of Pages: 304 pages
  • | Binding: Paperback or Softback
  • | ISBN-10: 1441930604
  • | ISBN-13: 9781441930606

Reviews

0 Reviews

Write a Review

No reviews yet.

Share your experience and help another reader choose their next book.

Discover your next great book

Get new releases, reader favourites, and special offers delivered to your inbox.