Abstract
Recursion theory has a resource-bounded version in computational com plexity theory. Similarly Kolmogorov complexity has resource-bounded Kolmogorov complexity.
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
Corresponding author
Rights and permissions
Copyright information
© 2008 Springer Science + Business Media, LLC
About this chapter
Cite this chapter
Li, M., Vitányi, P. (2008). Resource-Bounded Complexity. In: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-49820-1_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-49820-1_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-33998-6
Online ISBN: 978-0-387-49820-1
eBook Packages: Computer ScienceComputer Science (R0)