 The class \(\mathbf{U}\) of functions computable by Unlimited Register Machines introduced by Shepherdson &amp; Sturgis (1963) is such that \(\mathbf{U} = \mathbf{GR}\). (See Cutland (1980, ch. 1–3) and Cooper (2004, ch. 2).)