My own perspective on computability theory is that it is a kind of infinitary information theory. The Turing degrees represent the possible countable amounts of information that one might have. Two oracles that can compute each other have the same information, and when B ≤TA, then A has at least as much information as B. Studying the Turing degrees is to investigate the possible amounts of information that one can have in principle.
