Abstract
In this chapter, we consider sequential models of computation where only one instruction is executed per time unit. Parallel models where several instructions are executed per time unit, will be presented later. We distinguish between general models which work on finite structures and the classical models such as the Turing machine which work on words.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Lassaigne, R., de Rougemont, M. (2004). Models of computation. In: Logic and Complexity. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-392-3_6
Download citation
DOI: https://doi.org/10.1007/978-0-85729-392-3_6
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1052-1
Online ISBN: 978-0-85729-392-3
eBook Packages: Springer Book Archive