Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
(net)
price for USA
ISBN 978-0-387-26806-4
digitally watermarked, no DRM
Included Format: PDF
download immediately after purchase
Hardcover version
You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.
Standard shipping is free of charge for individual customers.
(net)
price for USA
ISBN 978-0-387-95569-8
free shipping for individuals worldwide
usually dispatched within 3 to 5 business days
Softcover (also known as softback) version.
You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.
Standard shipping is free of charge for individual customers.
(net)
price for USA
ISBN 978-1-4419-3060-6
free shipping for individuals worldwide
usually dispatched within 3 to 5 business days
New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithms of much greater computing power and efficiency.
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.
Topics and Features:
* Encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them
* 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.
Content Level » Research
Keywords » Automat - algorithms - artificial intelligence - automata - complexity - computer - computer architecture - computer science - intelligent systems - machine learning - modeling - numerical analysis
Related subjects » Mathematics - Theoretical Computer Science
Get alerted on new Springer publications in the subject area of Mathematical Modeling and Industrial Mathematics.