 Church’s Thesis underlies contemporary computability theory in the sense that it justifies the assumption that by studying computability relative to a single formalism (such as \(\mathbf{GR}\)  or \(\mathbf{L}\)) we are thereby providing a general account of which functions can and cannot be effectively computed in principle by an algorithm. In light of this, it will be useful to catalog some additional evidence for Church’s Thesis in the form of the equivalence of \(\mathbf{GR}\)  with several other computational formalisms presented in the Stanford Encyclopedia: