Home Book reviews Contact

DISCLOSURE: When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.

Please share to

13 titles, showing 1-13 sort by PRICE ASC.
Please follow us on AddALL Facebook page twitter page
TITLE

SORT

change title size:
AUTHOR

SORT

change author size:
PRICE

DEALER / SITE

SORT

DESCRIPTION

 

change description size:
Burgin Mark
author size:
USD
33.25
price size:
Better World Books /Biblio
dealer size:
Springer New York. Used - Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Springer New York ISBN 0387955690 9780387955698 [US]
description size:
Burgin Mark
author size:
USD
33.25
price size:
Better World Books /Biblio
dealer size:
Springer New York. Used - Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Springer New York ISBN 0387955690 9780387955698 [US]
description size:
Mark Burgin
author size:
USD
39.10
price size:
ThriftBooks /Biblio
dealer size:
Springer, Date: 2004. Hardcover. Good. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed. 2004. Springer ISBN 0387955690 9780387955698 [US]
description size:
MARK BURGIN
author size:
USD
80.00
price size:
DELHI BOOK STORE /Biblio
dealer size:
Springer, Date: 2004. 1st. Hardcover. New/New. 2004. Springer ISBN 0387955690 9780387955698 [IN]
description size:
Mark Burgin
author size:
USD
111.07
price size:
AHA-BUCH GmbH /ZVAB
dealer size:
ISBN10: 0387955690, ISBN13: 9780387955698, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - 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.
[Einbeck, Germany] [Publication Year: ...
Show/Hide image
description size:
Burgin Mark
author size:
USD
113.96
price size:
GridFreed LLC /Biblio
dealer size:
Springer. hardcover. New. New. In shrink wrap. Looks like an interesting title! Springer ISBN 0387955690 9780387955698 [US]
description size:
Mark Burgin
author size:
USD
122.58
price size:
AHA-BUCH GmbH /AbebooksDE
dealer size:
ISBN10: 0387955690, ISBN13: 9780387955698, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - 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.
[Einbeck, Germany] [Publication Year: ...
Show/Hide image
description size:
Mark Burgin
author size:
USD
129.18
price size:
Ria Christie Collections /Biblio
dealer size:
Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Super-Recursive Algorithms. ISBN 0387955690 9780387955698 [GB]
description size:
Mark Burgin
author size:
USD
144.70
price size:
Cold Books /Biblio
dealer size:
Springer , pp. 320 . Hardback. New. Springer ISBN 0387955690 9780387955698 [US]
description size:
Mark Burgin
author size:
USD
148.31
price size:
Books Puddle /Abebooks
dealer size:
ISBN10: 0387955690, ISBN13: 9780387955698, [publisher: Springer] Hardcover pp. 320
[New York, NY, U.S.A.] [Publication Year: 2004]
description size:
Burgin M.
author size:
USD
202.72
price size:
indianaabooks /Biblio
dealer size:
Very Good. ISBN 0387955690 9780387955698 [US]
description size:
Burgin M.
author size:
USD
328.85
price size:
Sanctum Books /Biblio
dealer size:
Springer, Date: 2005. New. 2005. Springer ISBN 0387955690 9780387955698 [IN]
description size:
Burgin M.
author size:
USD
328.85
price size:
BookVistas /Biblio
dealer size:
Springer, Date: 2005. New. 2005. Springer ISBN 0387955690 9780387955698 [IN]
description size:

DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you.
As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.


TOO Many Search Results? Refine it!
Exclude: (what you don't want)
Include: (what you want)
Search Results Sort By:
240430194731074955