Abstract
The classical theory of computation had its origins in the work of logicians—of Gödel, Turing, Church, Kleene, Post, among others— in the 1930s. The model of computation that developed in the following decades, the Turing machine, has been extraordinarily successful in giving the foundations and framework for theoretical computer science.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blum, L., Cucker, F., Shub, M., Smale, S. (1998). Introduction. In: Complexity and Real Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0701-6_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0701-6_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6873-4
Online ISBN: 978-1-4612-0701-6
eBook Packages: Springer Book Archive