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
đ
Keith Gunderson
Deelnemer
1
#2782
Arguments advanced by Keith Gunderson.
PAGE NAVIGATOR
(Help)
-
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
▲
Protagonists »
Protagonists
ProtagonistsâThe contributions of over 300 protagonists can be explored via a surname search, or using the growing list developing here.âD3B8AB
■
Keith Gunderson
Keith GundersonâArguments advanced by Keith Gunderson.âD3B8AB
►
We can't know whether future machines will shed light on mentality »
We can't know whether future machines will shed light on mentality
We can't know whether future machines will shed light on mentalityâKnowing whether future machines will illuminate human mentality requires knowledge of issues that we have no way of predicting (see detailed text).âFFFACD
►
Claim requires seeing into the future »
Claim requires seeing into the future
Claim requires seeing into the futureâClaiming that the statement machines can be conscious is analytically false (i.e. false given meanings of the words) requires that one foretell every possible change of use of the words that comprise the statementâan impossibility. âFFFACD
►
Any conscious machine must satisfy the transparency condition »
Any conscious machine must satisfy the transparency condition
Any conscious machine must satisfy the transparency conditionâA conscious machine would not face the same mind-body problem that we do, because anyone who could build a conscious machine must have understood the workings of the human mind well enough to solve the mind-body problem.âFFFACD
►
The perplexity condition »
The perplexity condition
The perplexity conditionâIf a machine is to be considered conscious, it must be perplexed by its own consciousness. It must be able to wonder how is it that I am conscious?âFFFACD
►
Issue can't be settled a priori »
Issue can't be settled a priori
Issue can't be settled a prioriâWe should not assume that physicalism applies categorically to everything in the universe. Physicalism may be true for machines, or for humans, or for both. But there is no intrinsic a priori right way to settle the matter.âFFFACD
►
Rule following doesn't deny consciousness »
Rule following doesn't deny consciousness
Rule following doesn't deny consciousnessâThorough descriptions of consciously initiated human behaviour reveals plans, plans are a form of rule following, and humans are consciousâthe fact that machines are programmed to follow certain rules is no reason to deny them consciousness.âFFFACD
►
One example can't explain thinking »
One example can't explain thinking
One example can't explain thinkingâThe imitation game attempts to explain thinking in terms of one example, a mans ability to imitate a woman. But mental activity is more diverseâeg wondering, deliberating, writing sonnets etc. Thinkings all purpose: the game uses just one ability.âFFFACD
►
The Vacuum Cleaner Salesman example »
The Vacuum Cleaner Salesman example
The Vacuum Cleaner Salesman exampleâIf a vacuum salesman demonstrated an all-purpose Swish 600 by sucking up dust from a carpet, a customer would be unsatisfied. He would want to see it suck up mud, straw, paper and cat hair from couches before believing the all-purpose claim.â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
+Commentaar (
0
)
- Commentaar
Voeg commentaar toe
Newest first
Oldest first
Show threads
+Citaten (
0
)
- Citaten
Voeg citaat toe
List by:
Citerank
Map
+About
- About
Gemaakt door:
David Price
NodeID:
#2782
Node type:
Protagonist
Gemaakt op (GMT):
7/20/2007 6:15:00 PM
Laatste bewerking (GMT):
7/20/2007 6:15:00 PM
Show other editors
Inkomende kruisrelatie
0
Uitgaande kruisrelatie
8
Gemiddelde waardering:
0
by
0
gebruikers
x
Select file to upload