 The class \(\mathbf{T}\) of functions computable by a  Turing machine  (under several variants of its definition) is such that \(\mathbf{T} = \mathbf{GR}\). (See  alternative historical models of computability in the entry on Turing machines  and Odifreddi (1989, ch. I.4).)