Some theorems can be proved in "different'' ways. Some proofs are more "uniform" or more "parsimonious'' than others. One way to analyze the mathematical content of such statements is using computability theory. We'll examine the titular examples from this point of view.