Super-Recursive Algorithms (Monographs in Computer Science)
This book introduces the new realm of superrecursive algorithms and the development
of mathematical models for them. Although many still believe that only recursive
algorithms exist and that only some of them are realizable, there are many
situations in which people actually work with superrecursive algorithms....
Computability: Turing, Gödel, Church, and Beyond
In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations into the foundations of mathematics. In the...
Semantic Techniques in Quantum Computation
The idea of quantum computation, in the algorithmic sense, originated from the suggestion by Feynman (1982) that a computer based on the principles of quantum mechanics might be capable of efficiently simulating quantum systems of interest to physicists; such simulation seems to be very difficult with classical computers. Feynman’s...
|Result Page: 6 5 4 3 2 1 |