A practical turing machine representation
Robert M. Nirenberg · ACM SIGACT News · 1986
A tool is presented for research work on Turing machines and other abstract programming models. This tool is based on the use of the Recursive Function Algorithmic Language (Refal). A short background of this language is presented. Examples are given as to how this language may be useful for running simulations of Turing machines, and how it may be useful for the researcher into abstract machines.