| HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
Super-Recursive Algorithms (Monographs in Computer Science) Book
The main achievement of the theory of computations is the elaboration of an exact mathematical model of an algorithm done less than seventy years ago by introducing recursive and partial recursive functions, Turing machines, and Post formal systems. The famous Church-Turing Thesis claims that these models (called recursive algorithms) are the most general. The reason of this is that all mathematical models of algorithms that appeared later were either equivalent or even weaker than Turing machines (or equivalently, partial recursive functions). Theory of super-recursive algorithms refutes this Thesis because computing power of super-recursive algorithms is much greater than that of the conventional, or recursive, algorithms. Consequently, the discovery of super-recursive algorithms … read more...
from£25.78 | RRP: * Excludes Voucher Code Discount Also available Used from £25.96
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.
