An abstract model for parallel computations: Gandy’s thesis
Abstract
In his classic paper On Computable Numbers Turing analyzed what can be done by a human computor in a routine, “mechanical” way. He argued that mechanical op-erations obey locality conditions and are carried out on configurations satisfying boundedness conditions. Processes meeting these restrictive conditions can be shown to be computable by a Turing machine. Turing viewed memory limitations of computors as the ultimate reason for the restrictive conditions. In contrast, Gandy analyzed in his paper Church’s Thesis and Principles for Mechanisms what can be done by “discrete deterministic mechanical devices” and appealed to physical considerations to motivate restrictive principles. These devices include, crucially, ones that carry out parallel processes, e.g., cellular automata. Following Turing’s methodological ways and guided by Conway’s “Game of Life” as a paradigm, Gandy formulated four restrictive principles and proved that devices satisfying them are computationally equivalent to Turing machines.