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.
KeywordsPrefix Suffix Padding
Unable to display preview. Download preview PDF.