Bennett established several fundamental facts about strongly deep sequences, namely that the halting set K is strongly deep, that no computable sequence and no Martin-L¨of random sequence is strongly deep, and that strong depth is closed upwards under truth-table reducibility (a result he referred to as the slow growth law).
Collection
[
|
...
]