Minsky, 1967, p. 107: "In his 1936 paper, A. M. Turing defined the class of abstract machines that now bear his name. A Turing machine is a finite-state machine associated with a special kind of environment -- its tape -- in which it can store (and later recover) sequences of symbols". (EN) Marvin Minsky, capitolo 8, sez. 8.2 Unsolvability of the Halting Problem, in Computation: Finite and Infinite Machines, Prentice–Hall, Inc., 1967.
Macchina di Turing, in Enciclopedia della scienza e della tecnica, Roma, Istituto dell'Enciclopedia Italiana, 2007-2008. URL consultato il 19 luglio 2022.