Abstract
We begin our study by developing several models of computation, each of which reflects all of the features inherent in computation. In an effort to simplify the arguments, all artifacts of computation will be absent from our models. We will start with existing computational paradigms and remove the “bells and whistles” of convenience, arriving at simplified versions of each paradigm that contain all the fundamentally important features of the original. The simplified versions will be shown to be equivalent in a strong sense. This will suggest a model-independent view of computation in terms of “programs” computing functions.
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.
References
A. Church, An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics, Vol. 58, 1936, pp. 345–363.
M. Davis, The Undecidable, Raven Press, New York, 1965.
E. Engeler, Introduction to the Theory of Computation, Academic Press, Inc., New York, 1973.
K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwanter Systeme, I, Monatsheft für Mathematik und Physik, Vol. 38. pp. 173–198, 1931.
S. Kleene, General Recursive Functions of Natural Numbers, Mathematische Annalen, Vol. 112, 1936, pp. 727–742.
M. Machtey and P. Young, An Introduction to the General Theory of Algorithms, Elsevier North-Holland, New York, 1978.
J. Shepherdson and H. Sturgis, Computability of Recursive Functions, Journal of the ACM, Vol. 10, 1963, pp. 217–255.
A. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem, Proceeding of the London Mathematical Society, Vol. 42, 1936, pp. 230–265.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Smith, C.H. (1994). Models of Computation. In: A Recursive Introduction to the Theory of Computation. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8501-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8501-9_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6420-0
Online ISBN: 978-1-4419-8501-9
eBook Packages: Springer Book Archive