Failure Modes for Structural Highness Notions

In a previous paper, entitled "Structural Highness Notions," we defined several classes of degrees that are high in senses related to computable structure theory. Each class of degrees is characterized by a structural feature (e.g., an isomorphism) that it can compute if such a feature exists. In this paper, we examine each of these classes and characterize them based on what they do if no such object exists. We describe, in particular, reticent, loquacious, and collegiate senses of being high. These, respectively, reflect the case where a computation from the degree can give output only if the desired feature exists, the case where it will give output of some kind whether or not the feature exists, and the case where the degree will either compute the feature or the best available approximation to it.