## Computational depth and reducibility (1994)

### Cached

### Download Links

- [www.cs.iastate.edu]
- [www.cs.iastate.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 12 - 2 self |

### BibTeX

@ARTICLE{Juedes94computationaldepth,

author = {David W. Juedes and James I. Lathrop and Jack H. Lutz},

title = {Computational depth and reducibility},

journal = {Theoretical Computer Science},

year = {1994},

volume = {132},

pages = {37--70}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper reviews and investigates Bennett's notions of strong and weak computational depth (also called logical depth) for in nite binary sequences. Roughly, an in nite binary sequence x is de ned to be weakly useful if every element of a non-negligible set of decidable sequences is reducible to x in recursively bounded time. It is shown that every weakly useful sequence is strongly deep. This result (which generalizes Bennett's observation that the halting problem is strongly deep) implies that every high Turing degree contains strongly deep sequences. It is also shown that, in the sense of Baire category, almost