A tame theory is a decidable first-order theory with only countably many countable models, and all complete types recursive. It is shown here that the recursive complexity of countable homogeneous ...