Super-Recursive Algorithms
* 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 whole277. 278. 279. 280. 281. 282. 283. 284. 285. 286. 287. 288. 289. 290. Farhi, E., Goldstone, J. Gutmann, S. and Sipser, M. (2000). Quantum computation by adiabatic evolution, E-print http://arxiv.org/pdf/quant-ph/0001106. Feferman, S. ( 1992).
| Title | : | Super-Recursive Algorithms |
| Author | : | Mark Burgin |
| Publisher | : | Springer Science & Business Media - 2006-12-22 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
