Abstract
The notion of complexity classes of problems is one of the great definition success stories in science. This chapter traces its lineage to the influence of Hartley Rogers’ famous text and papers systematizing computability theory in the 1950s and 1960s.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lipton, R.J., Regan, K.W. (2013). Hartley Rogers: Complexity Classes. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-41422-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41421-3
Online ISBN: 978-3-642-41422-0
eBook Packages: Computer ScienceComputer Science (R0)