Abstract
This chapter presents three languages allowing to express algorithms: rewriting, the lambda-calculus, and Turing machines. It emphases the fact that, behind this apparent diversity, there is a deep unifying notion: that a computation is a sequence of small steps.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Computation as a Sequence of Small Steps. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_4
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)