Abstract
The complexity measures and the classes introduced so far are intrinsically algorithmic. Our interest is in the amount of resources used by the algorithms solving the problems. But any finite set can be recognized in constant time and zero work space by a deterministic finite automaton; therefore, measuring the amount of resources is meaningless when considering only finite sets. The “intrinsically algorithmic” approach makes sense only when dealing with infinite sets.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Balcázar, J.L., Díaz, J., Gabarró, J. (1988). Nonuniform Complexity. In: Structural Complexity I. EATCS Monographs on Theoretical Computer Science Series, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97062-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-97062-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97064-1
Online ISBN: 978-3-642-97062-7
eBook Packages: Springer Book Archive