Memoization and theory of computation.

[30] investigates the meaning and practical use of the 2nd recursion theorems by Kleene and Rogers. My M.Sc. thesis [42] is about how to improve efficiency of program execution by means of a generalized form of memoization, resembling partial evaluation; as reported in [11], Cook's ingenious linear-time simulation of 2DPDAs can be thought of as an instance of this technique.