0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Super-Recursive Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005) Loot Price: R2,933
Discovery Miles 29 330
Super-Recursive Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005): Mark Burgin

Super-Recursive Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005)

Mark Burgin

Series: Monographs in Computer Science

 (sign in to rate)
Loot Price R2,933 Discovery Miles 29 330 | Repayment Terms: R275 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications

* Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods

* Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Monographs in Computer Science
Release date: December 2010
First published: 2005
Authors: Mark Burgin
Dimensions: 235 x 155 x 16mm (L x W x T)
Format: Paperback
Pages: 304
Edition: Softcover reprint of hardcover 1st ed. 2005
ISBN-13: 978-1-4419-3060-6
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
Promotions
LSN: 1-4419-3060-4
Barcode: 9781441930606

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners