Abstract
How can one possibly analyze computation in general? The task seems daunting if not impossible. There are too many different kinds of computation, and the notion of general computation seems too amorphous. As in quicksand, one needs a rescue point, a fulcrum. In computation analysis, a fulcrum is a particular viewpoint on computation that clarifies and simplifies things to the point that analysis becomes possible. We review from that point of view the few foundational analyses of general computation in the literature: Turing's analysis of human computations, Gandy's analysis of mechanical computations, Kolmogorov's analysis of bit-level computation, and our own analysis of computation on the arbitrary abstraction level. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Gurevich, Y. (2012). Foundational analyses of computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 264–275). https://doi.org/10.1007/978-3-642-30870-3_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
