sentences:  The Feferfest paper distills the prior paper to its major points and dwells primarily on Robin Gandy's paper of 1980.Sieg extends Turing's "computability by string machine" (human "computor") as reduced to mechanism "computability by letter machine" to the "parallel" machines of Gandy.Sieg cites more recent work including "Kolmogorov and Uspensky's work on algorithms" and (De Pisapia 2000), in particular, the KU-pointer machine-model), and artificial neural networks and asserts