Abstract
Perhaps the major—certainly the most dramatic—strength of computability theory is its robustness across widely varying models, as expressed in the Church-Turing thesis. Probably the major weaknesses of computability theory are
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag New York
About this chapter
Cite this chapter
Rosenberg, A.L. (2010). Complexity Theory. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-09639-1_13
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-56117-2
Online ISBN: 978-0-387-09639-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)