Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Effective Computation by Humans and Machines
Minds and Machines
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, I
ACM Transactions on Computational Logic (TOCL)
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On Floridi's Method of Levels of Abstraction
Minds and Machines
| Hi-index | 0.00 |
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.