It is well known that in the classical case of recursion theory over the natural numbers, these two notions of computability coincide (though this is not true for all structures). We ask if there are structures over which recursion and tail recursion coincide in terms of computability, but in...
The essential difference between forwardAD and forwardADDense is intensional. In moving from computing a value in v→(d⋉d) to one in d⋉(v→d), we no longer compute both the primal and tangent for each individual v, but instead only compute the primal once for the whole gradient. ...
Lynch, N.A., Blum, E.K.: A difference in expressive power between flowcharts and recursion schemes. Math. Syst Theory 12(1), 205–211 (1979) Article MathSciNet MATH Google Scholar McCarthy, J.: A basis for a mathematical theory of computation. In: proceedings of the Western Joint ...