History and Philosophy of Logic 4 (1-2):203-220 (1983)
The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ?argument by Church's thesis?
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Theory of Recursive Functions and Effective Computability.H. Rogers - 1987 - MIT Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Citations of this work BETA
No citations found.
Similar books and articles
Step by Recursive Step: Church's Analysis of Effective Calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2011 - Academic Press.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2007 - Cambridge University Press.
On the Notion of Effectiveness.Stewart Shapiro - 1980 - History and Philosophy of Logic 1 (1-2):209-230.
Local Realizability Toposes and a Modal Logic for Computability.Steve Awodey, Lars Birkedal & Dana Scott - unknown
Added to index2010-08-10
Total downloads31 ( #163,846 of 2,158,808 )
Recent downloads (6 months)1 ( #354,589 of 2,158,808 )
How can I increase my downloads?