* Describes the strengthening link between the theory of super-recursive algorithms and actual algorithms close to practical realization
* Examines the theory's basis as a foundation for advancements in computing, information science, and related technologies
* Encompasses and systematizes all main types of mathematical models of algorithms
* Highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers
* Examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models
* Possesses a comprehensive bibliography and index
This clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms.
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
* Describes the strengthening link between the theory of super-recursive algorithms and actual algorithms close to practical realization
* Examines the theory's basis as a foundation for advancements in computing, information science, and related technologies
* Encompasses and systematizes all main types of mathematical models of algorithms
* Highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers
* Examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models
* Possesses a comprehensive bibliography and index
This clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms.
Imprint | Springer-Verlag New York |
Country of origin | United States |
Series | Monographs in Computer Science |
Release date | December 2004 |
Availability | Expected to ship within 10 - 15 working days |
First published | 2005 |
Authors | Mark Burgin |
Dimensions | 235 x 155 x 19mm (L x W x T) |
Format | Hardcover |
Pages | 304 |
Edition | 2005 ed. |
ISBN-13 | 978-0-387-95569-8 |
Barcode | 9780387955698 |
Categories | |
LSN | 0-387-95569-0 |