Gödel's incompleteness theorems and computer science

Foundations of Science 2 (1):123-135 (1997)
  Copy   BIBTEX

Abstract

In the paper some applications of Gödel's incompleteness theorems to discussions of problems of computer science are presented. In particular the problem of relations between the mind and machine (arguments by J.J.C. Smart and J.R. Lucas) is discussed. Next Gödel's opinion on this issue is studied. Finally some interpretations of Gödel's incompleteness theorems from the point of view of the information theory are presented.

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1009639629935

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Gödel’s Incompleteness Theorems and Artificial Life.John P. Sullins - 1997 - Society for Philosophy and Technology Quarterly Electronic Journal 2 (3):185-195.
On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - forthcoming - Philosophia Mathematica.
Gödel’s Incompleteness Theorems and Physics.Newton C. A. da Costa - 2011 - Principia: An International Journal of Epistemology 15 (3):453-459.
Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
On the philosophical relevance of Gödel's incompleteness theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
Gödel’s Incompleteness Theorems and Physics.Newton C. A. Da Costa - 2011 - Principia: An International Journal of Epistemology 15 (3):453-459.
Generalizations of gödel’s incompleteness theorems for ∑ N-definable theories of arithmetic.Makoto Kikuchi & Taishi Kurahashi - 2017 - Review of Symbolic Logic 10 (4):603-616.
A machine-assisted proof of gödel’s incompleteness theorems for the theory of hereditarily finite sets.Lawrence C. Paulson - 2014 - Review of Symbolic Logic 7 (3):484-498.

Analytics

Added to PP
2009-01-28

Downloads
103 (#204,314)

6 months
8 (#558,531)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
Minds, Machines and Gödel.J. R. Lucas - 1961 - Etica E Politica 5 (1):1.
From Mathematics to Philosophy.Hao Wang - 1974 - London and Boston: Routledge.
The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.

View all 10 references / Add more references