Jumps and Iterated Jumps of Perfect Subtrees of Positive Trees

An infinite (binary) tree is \emph{positive} iff its set of paths is non-null. As an elementary observation, positives trees always have positive perfect subtrees. Given a positive tree of certain complexity, here we present several theorems concerning the distribution of the Turing jumps or iterated Turing jumps of (positive) perfect subtrees of the given tree in the universe of Turing degrees.