## Loveland : \ A variant of the Kolmogorov concept of complexity "

- W. D.
- Texts and Monographs in Computer Science
- 1993

- Published 1994

It is known that innnite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov complexity that are not polynomial-time computable. This… (More)

### Presentations referencing similar topics