Part of the Texts in Computer Science book series (TCS)
Recursion theory has a resource-bounded version in computational com plexity theory. Similarly Kolmogorov complexity has resource-bounded Kolmogorov complexity.
KeywordsTuring Machine Recursive Function Probability Mass Function Kolmogorov Complexity Short Program
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer Science + Business Media, LLC 2008