Views
Graph
Explorer
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 levels
Load all levels
All
Dagre
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 level
Load all levels
All
Tree
SpaceTree
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Radial
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Box
Focus
Expanding
Down
Up
All
Down
Page ✓
Article
Outline
Document
Down
All
Canvas
Time
Timeline
Calendar
Request email digest
Past 24 hours
Past 2 days
Past 3 days
Past week
Add
Add page
Add comment
Add citation
Edit
Edit page
Delete page
Share
Link
Bookmark
Embed
Social media
Login
Member login
Register now for a free account
🔎
We don't need the entire Lucas arithmetic
OpposingArgument
1
#1124
A mentalist doesn't have to produce all of the Lucas arithmetic. It's sufficient that he produce enough of the Lucas arithmetic to answer the mechanist at a given step of the game.
The success of the Lucas argument must be evaluated in the context of a particular machine being challenged by particular mentalist.
John Lucas (1970).
Immediately related elements
How this works
-
Artificial Intelligence »
Artificial Intelligence
Artificial Intelligence☜A collaboratively editable version of Robert Horns brilliant and pioneering debate map Can Computers Think?—exploring 50 years of philosophical argument about the possibility of computer thought.☜F1CEB7
▲
Are thinking computers mathematically possible? [7] »
Are thinking computers mathematically possible? [7]
Are thinking computers mathematically possible? [7]☜Is it mathematically possible for a computer to think as well as a human can? Does the mathematics of computation contain anything to prohibit machines from thinking?☜FFB597
▲
No: computers are limited by Gödel's theorems »
No: computers are limited by Gödel's theorems
No: computers are limited by Gödel's theorems☜Gödels theorem proves that a computer cant in principle operate with human understanding (see detailed text). Gödels incompleteness theorems are the Achilles heel of mechanism. John Lucas (1961).☜59C6EF
▲
Argument from Gödel's theorem is dialectical »
Argument from Gödel's theorem is dialectical
Argument from Gödel's theorem is dialectical☜A mechanist presents Lucas with a machine model of Lucass mind. Lucas shows that he can recognise the truth of the machines Gödel sentence—whereas the machine cant. In this way, Lucas can defeat any mechanist attempts to reduce him to a machine.☜98CE71
▲
Lucas needs to produce entire Lucas arithmetic »
Lucas needs to produce entire Lucas arithmetic
Lucas needs to produce entire Lucas arithmetic☜Lucass argument requires a person be able to produce the whole of Lucass arithmetic, which includes all of the Gödel sentences of all formal systems powerful enough to produce arithmetic. But Lucas hasnt shown this ability is possible for humans.☜EF597B
■
We don't need the entire Lucas arithmetic
We don't need the entire Lucas arithmetic☜A mentalist doesnt have to produce all of the Lucas arithmetic. Its sufficient that he produce enough of the Lucas arithmetic to answer the mechanist at a given step of the game.☜EF597B
◄
John Lucas »
John Lucas
John Lucas☜Arguments advanced by John Lucas.☜FFFACD
Heading
Summary
Click the button to enter task scheduling information
Open
Details
Enter task details
Message text
Select assignee(s)
Due date (click calendar)
RadDatePicker
RadDatePicker
Open the calendar popup.
Calendar
Title and navigation
Title and navigation
<<
<
November 2024
>
<<
November 2024
S
M
T
W
T
F
S
44
27
28
29
30
31
1
2
45
3
4
5
6
7
8
9
46
10
11
12
13
14
15
16
47
17
18
19
20
21
22
23
48
24
25
26
27
28
29
30
49
1
2
3
4
5
6
7
Reminder
No reminder
1 day before due
2 days before due
3 days before due
1 week before due
Ready to post
Copy to text
Enter
Cancel
Task assignment(s) have been emailed and cannot now be altered
Lock
Cancel
Save
Comment graphing options
Choose comments:
Comment only
Whole thread
All comments
Choose location:
To a new map
To this map
New map options
Select map ontology
Options
Standard (default) ontology
College debate ontology
Hypothesis ontology
Influence diagram ontology
Story ontology
Graph to private map
Cancel
Proceed
+Komentarai (
0
)
- Komentarai
Komentuoti
Newest first
Oldest first
Show threads
+Citavimą (
0
)
- Citavimą
Pridėti citatą
List by:
Citerank
Map
+About
- About
Redagavo:
David Price
NodeID:
#1124
Node type:
OpposingArgument
Įvedimo data (GMT):
8/30/2006 1:47:00 PM
Paskutinės redakcijos data (GMT laikas):
8/30/2006 1:47:00 PM
Show other editors
Įeinančios sąsajos:
1
Išeinančios sąsajos:
0
Vidutinis vertinimas:
0
by
0
vartotojai
x
Select file to upload