ISSN 1519-9681

ARTICLES
EDITORIAL BOARD
RULES AND INSTRUCTIONS
SITES POINTING TO CLE e-PRINTS

Articles



Vol. 7(3), 2007


Vol. 7(2), 2007

Vol. 7(1), 2007


Vol. 7(3), 2007 - Section Logic

"Cogito ergo sum non machina!"
About Gödel's first incompleteness theorem and turing machines

Ricardo Pereira Tassinari
Philosophy Department
State University of São Paulo - UNESP
Marília, SP - Brazil

Itala M. Loffredo D'Ottaviano
Group for Applied and Theoretical Logic
Centre for Logic, Epistemology and the History of Science - CLE
Philosophy Department - IFCH
State University of Campinas - Unicamp - Brazil
itala@cle.unicamp.br

Date Posted: July, 30th 2007                                      Download Files:  [PDF]     [PS]

ABSTRACT: The aim of this paper is to argue about the impossibility of constructing a complete formal theory or a complete Turing machines' algorithm that represent the human capacity of recognizing mathematical truths. More specifically, based on a direct argument from Gödel's First Incompleteness Theorem, we discuss the impossibility of constructing a complete formal theory or a complete Turing machines' algorithm to the human capacity of recognition of first-order arithmetical truths and so of mathematical truths in general.

|   Home   |   2008   |   2007   |    2005   |   2004   |   2003   |   2002   |   2001   |
© 2006 - Centre for Logic, Epistemology and the History of Science – CLE