Gödel and Computability 1
نویسندگان
چکیده
We discuss the influence of Gödel and his results on the surfacing of the rigorous notion of computability afforded by Turing. We also address the debate about the limits of Artificial Intelligence spurned by Roger Penrose, on the basis of Gödel's theorems, and the views of Gödel himself. We conclude by touching upon the use of logic as a tool with which to approach the description of mind.
منابع مشابه
Kurt Gödel and Computability Theory
Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda ...
متن کاملGödel on computability * Wilfried
The identification of an informal concept of “effective calculability”with a rigorous mathematical notion like “recursiveness” or “Turingcomputability” is still viewed as problematic, and I think rightly so. I analyzethree different and conflicting perspectives Gödel articulated in the three decadesfrom 1934 to 1964. The significant shifts in Gödel's position underline thedi...
متن کاملTuring oracle machines, online computing, and three displacements in computability theory
We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines (a-machines). To
متن کاملFirst Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair amount of Gödel encodings which sometime obscure ingenious arguments. Consequently, there have been a number of presentations of computability theory that aimed to present the subject in an abstract and conceptually ple...
متن کاملPartial Numberings and Precompleteness
Precompleteness is a powerful property of numberings. Most numberings commonly used in computability theory such as the Gödel numberings of the partial computable functions are precomplete. As is well known, exactly the precomplete numberings have the effective fixed point property. In this paper extensions of precompleteness to partial numberings are discussed. As is shown, most of the importa...
متن کامل