Resource-Bounded Complexity

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.


Turing 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.

Copyright information

© Springer Science + Business Media, LLC 2008

Authors and Affiliations

  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands

Personalised recommendations