Super-recursive algorithms /

Saved in:
Bibliographic Details
Author / Creator:Burgin, M. S. (Mark Semenovich)
Imprint:New York, NY : Springer, c2005.
Description:1 online resource (xii, 304 p.) : ill.
Language:English
Series:Monographs in computer science
Monographs in computer science.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/8874792
Hidden Bibliographic Details
ISBN:0387955690 (acid-free paper)
9780387955698 (acid-free paper)
9780387268064 (electronic bk.)
0387268065 (electronic bk.)
6611114343
9786611114343
Notes:Includes bibliographical references (p. [263]-294) and index.
Description based on print version record.
Summary:Provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. This book demonstrates how these algorithms are more appropriate as mathematical models for modern computers.
Other form:Print version: Burgin, M.S. (Mark Semenovich). Super-recursive algorithms. New York, NY : Springer, c2005 0387955690 9780387955698