Skip to main content
×
Home

Lucas against Mechanism

  • David Lewis (a1)
Abstract

J. R. Lucas argues in “Minds, Machines, and Gödel”, that his potential output of truths of arithmetic cannot be duplicated by any Turing machine, and a fortiori cannot be duplicated by any machine. Given any Turing machine that generates a sequence of truths of arithmetic, Lucas can produce as true some sentence of arithmetic that the machine will never generate. Therefore Lucas is no machine.

Copyright
References
Hide All

1 Philosophy, 36 (1961): 112127.

2 Lucas arithmetic belongs to a class of extensions of Peano arithmetic studied by Turing A. M. in “Systems of Logic Based on Ordinals”, Proceedings of the London Mathematical Society, sec. 2, 45 (1939): 161228, and by Feferman S. in “Transfinite Recursive Progressions of Axiomatic Theories”, Journal of Symbolic Logic, 27 (1962): 259316.

3 I am indebted to George Boolos and Wilfrid Hodges for valuable criticisms of an earlier version of this paper.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Philosophy
  • ISSN: 0031-8191
  • EISSN: 1469-817X
  • URL: /core/journals/philosophy
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 7 *
Loading metrics...

Abstract views

Total abstract views: 149 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th November 2017. This data will be updated every 24 hours.