Formalism and intuition in computability

  title={Formalism and intuition in computability},
  author={Robert Irving Soare},
  journal={Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
  pages={3277 - 3304}
  • R. Soare
  • Published 28 July 2012
  • Philosophy
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
The model of recursive functions in 1934–1936 was a deductive formal system. In 1936, Turing and in 1944, Post introduced more intuitive models of Turing machines and generational systems. When they both died prematurely in 1954, their informal approach was replaced again by the very formal Kleene T-predicate for another decade. By 1965, researchers could no longer read the papers. A second wave of intuition arose with the book by Rogers and Lachlan's revealing papers. A third wave of intuition… 
6 Citations

Figures from this paper

Why Turing’s Thesis Is Not a Thesis
In 1936 Alan Turing showed that any effectively calculable function is computable by a Turing machine. Scholars at the time, such as Kurt Godel and Alonzo Church, regarded this as a convincing
The foundations of computation, physics and mentality: the Turing legacy
  • S. Cooper, S. Abramsky
  • Computer Science
    Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2012
This issue has a major reappraisal of Turing's classical 1930s work on machine computation, and the balance between program and information, and a novel formulation for quantum mechanics that is based much more directly on operational concepts than on the traditional Hilbert-space formalism.
The never-ending recursion
Philosophy and Computers
It is argued that the Web represents a fundamental turning point not just in computational systems but in philosophy as well, for the Web signals a return of representationalism of a distinctly different kind than that formerly theorized about by artificial intelligence.


Origins of recursive function theory
  • S. Kleene
  • Mathematics
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
The notion of "λ-definability" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of all number-theoretic functions for which algorithms exist, and the investigation in 1931-3 by which it was so recognized.
Recursively enumerable sets of positive integers and their decision problems
Introduction. Recent developments of symbolic logic have considerable importance for mathematics both with respect to its philosophy and practice. That mathematicians generally are oblivious to the
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
The concept 'degree of recursive unsolvability' was introduced briefly in Post [16]. In his abstract [17] the concept was formulated precisely via an extension of [15], and a resulting partial scale
The Universal Turing Machine: A Half-Century Survey
This book discusses Alan Turing's analysis of Computability, and major applications of It, and Turing Naturalized: Von Neumann's Unfinished Project.
Alan Turing, Enigma
Both a compelling narrative and a work of scholarship, Alan Turing: The Enigma is the definitive biography of one of the greatest minds of the modern world.
Computability and Recursion
  • R. Soare
  • Computer Science
    Bulletin of Symbolic Logic
  • 1996
Abstract We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to define it, “(Turing) computability” and “(general) recursiveness”.
Finite Combinatory Processes-Formulation 1
The present formulation should prove significant in the development of symbolic logic along the lines of Godel's theorem on the incompleteness of symbolic logics and Church's results concerning
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets
  • R. Soare
  • Computer Science
    Perspectives in mathematical logic
  • 1987
The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be.