• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Gödel on computability

Cached

  • Download as a PDF

Download Links

  • [www.hss.cmu.edu]
  • [www.hss.cmu.edu]
  • [hss.cmu.edu]
  • [people.cs.uchicago.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Wilfried Sieg
Citations:1 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Sieg_gödelon,
    author = {Wilfried Sieg},
    title = {Gödel on computability },
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Around 1950, both Gödel and Turing wrote papers for broader audiences. 1 Gödel drew in his 1951 dramatic philosophical conclusions from the general formulation of his second incompleteness theorem. These conclusions concerned the nature of mathematics and the human mind. The general formulation of the second theorem was explicitly based on Turing’s 1936 reduction of finite procedures to machine computations. Turing gave in his 1954 an understated analysis of finite procedures in terms of Post production systems. This analysis, prima facie quite different from that given in 1936, served as the basis for an exposition of various unsolvable problems. Turing had addressed issues of mentality and intelligence in contemporaneous essays, the best known of which is of course Computing machinery and intelligence. Gödel’s and Turing’s considerations from this period intersect through their attempt, on the one hand, to analyze finite, mechanical procedures and, on the other hand, to approach mental phenomena in a scientific way. Neuroscience or brain science was an important component of the latter for both: Gödel’s remarks in the Gibbs Lecture as well as in his later conversations with Wang and Turing’s Intelligent Machinery can serve as clear evidence for that. 2 Both men were convinced that some mental processes are not mechanical, in the sense that Turing machines cannot mimic them. For Gödel, such processes were to be found in mathematical experience and he was led to the conclusion that mind is separate from matter. Turing simply noted that for a machine or a brain it is not enough to be converted into a universal (Turing) machine in order to become intelligent: “discipline”, the characteristic

Citations

914 On computable numbers, with an application to the Entscheidungsproblem - Turing - 1936
308 Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I. Monatshefte fr Mathematik und Physik - Gödel - 1931
214 An unsolvable problem of elementary number theory - Church - 1936
79 A set of postulates for the foundation of logic - Church - 1933
74 A note on the Entscheidungsproblem - Church - 1936
43 Church’s Thesis and Principles for Mechanisms - Gandy - 1980
22 Formal definitions in the theory of ordinal numbers - Church, Kleene - 1937
19 From Mathematics to Philosophy - Wang - 1974
18 Begründung des ’ tertium non datur‘ mittels der Hilbertschen Theorie der Widerspruchsfreiheit - Ackermann - 1925
13 Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem - Behmann - 1922
13 The Essential Turing - Copeland - 2004
10 Mathematische Probleme, Archiv der Math. und Physik 1 - Hilbert - 1901
8 Bernays 1939 Grundlagen der Mathematik; vol - Hilbert, Paul
6 K-graph machines: generalizing Turing’s machines and arguments - Sieg, Byrnes - 1996
5 The history and concept of computability - Soare - 1999
5 Abhandlungen zur Philosophie der Mathematik. Wissenschaftliche Buchgesellschaft - Bernays - 1976
4 Turing in the land of O(z - Feferman - 1988
4 On the consistency of arithmetic - Herbrand - 1931
4 2000) Address at the Princeton University Bicentennial Conference on problems of mathematics (December 17-19, 19460, by Alfred Tarski - Sinaceur
4 Über Hilberts Gedanken zur Grundlegung der Arithmetik. Jahresbericht der Deutschen - Bernays - 1922
4 Axiomatische Untersuchung des Aussagen-Kalkuls der “Principia mathematica - Bernays - 1926
4 A set of postulates for the foundation of logic II - Church - 1933
3 Mechanical procedures and mathematical experience; in Mathematics and Mind, edited by A - Sieg - 1994
3 Beiträge zur axiomatischen Behandlung des Logik-Kalküls - Bernays - 1918
3 The Collected Works of - Büchi - 1990
2 The Richard Paradox - Church - 1934
2 Review of [Turing - Church - 1936
2 Clockwork or Turing universe? — remarks on causal determinism and computability - Cooper - 1999
1 An unsolvable problem of elementary number theory - Math - 1936
1 The Undecidable; New York 1982 Why Gödel did not have Church’s Thesis - Davis - 1965
1 About logics and logicians – A palimpsest of essays by - Odifreddi - 1990
1 Emil 1947 Recursive unsolvability of a problem of Thue - Post
1 Introductory Note to Remark 3 - Webb - 1990
1 Zum Hilbertschen Aufbau der rellen Zahlen - Ackermann - 1928
1 Review of [Wolfram, 2002 - Baldwin - 2004
1 Sur le concept de nombre en mathématique - Cours inédit de Leopold Kronecker à Berlin (1891). Revue d’histoire des mathématiques, 7: 207–275 - Boniface, Schappacher - 2001
1 A graphical presentation of Gandy’s parallel machines (Abstract - Byrnes, Sieg - 1996
1 Die logizistische Grundlegung der Mathematik - Carnap - 1931
1 Review of [Post - Church - 1936
1 Intelligent Machinery: Turing’s Ideas and Their Relation to the Work of Newell and - Colvin - 1997
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University