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. (shrink)

Wilfried Sieg and John Byrnes. AnModel for Parallel Computation: Gandy's Thesis.

Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.

Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: How do we bridge the gap between claims and assumptions in heuristically motivated ways? This informal (...) question motivates the formulation of intercalation calculi. Ic-calculi are the technical underpinnings for (1) and (2), and our paper focuses on their detailed presentation and meta-mathematical investigation in the case of classical predicate logic. As a central theme emerges the connection between restricted forms of nd-proofs and (strategies for) proof search: normal forms are not obtained by removing local "detours", but rather by constructing proofs that directly reflect proof-strategic considerations. That theme warrants further investigation. (shrink)

Wilfried Sieg and John Byrnes. Gödel, Turing, and K-Graph Machines.

Wilfred Sieg and John Byrnes. Generalizing Turing's Machine and Arguments.