Abstract
Church’s thesis states that a function is computable iff it is recursive. A classical observation shows that some recursive functions require time of order O(22 2 n) on inputs of size n. Such functions are not computable by any procedure producing an output in a reasonable time if n ≥ 10. Restrictions are needed to model the notion of effective computability.
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
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Lassaigne, R., de Rougemont, M. (2004). Time complexity: the classes P and NP. In: Logic and Complexity. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-392-3_12
Download citation
DOI: https://doi.org/10.1007/978-0-85729-392-3_12
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1052-1
Online ISBN: 978-0-85729-392-3
eBook Packages: Springer Book Archive