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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
92 (#180,101)

6 months
10 (#219,185)

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. North-Holland. pp. 821 -- 865.

View all 10 references / Add more references