Abstract
We now give a unified description of a class of computational models. Let us start with the example of multitape Turing machines with input and output tapes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). Convenient computational models. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_21
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive