On Formalisms for Turing Machines
Patrick C. Fischer · Journal of the ACM · 1965
Turing's original quintuple formalism for an abstract computing machine is compared with the quadruple approach of Post and with some new alterr~atives.In each case the possibility or nmipossibility of two--symbol or two-state ~miversal machines is demon.strated.