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
🔎
Human judges may be fooled too easily
Palaikantis argumentas
1
#241
Human judges can be fooled by unintelligent machines.
Ned Block, 1981.
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
▲
Can the Turing Test determine this? [2] »
Can the Turing Test determine this? [2]
Can the Turing Test determine this? [2] ☜Is the Turing Test—proposed by Alan Turing in 1950—an adequate test of thinking? Can it determine whether a machine can think? If a computer passess the test by persuading judges via a teletyped conversation that its human can it be said to think?☜FFB597
▲
No: passing the Test is not decisive »
No: passing the Test is not decisive
No: passing the Test is not decisive☜Even if a computer were to pass the Turing test, this would not justify the conclusion that it was thinking intelligently. ☜59C6EF
■
Human judges may be fooled too easily
Human judges may be fooled too easily☜Human judges can be fooled by unintelligent machines. ☜98CE71
●
A serious judge would not be easily fooled »
A serious judge would not be easily fooled
A serious judge would not be easily fooled☜A critical judge would not lazily interact with a competitor in the Turing test, but would be focused on distinguishing the human from the computer. Such a judge could not be easily fooled.☜EF597B
●
The ELIZA effect »
The ELIZA effect
The ELIZA effect☜The ELIZA effect is a tendency to read more into computer performance than is warranted by their underlying code—e.g. the psychotherapy program ELIZA gives apparently sympathetic responses, but in fact is only utilizing a set of canned responses.☜EF597B
►
Human judges are unreliable »
Human judges are unreliable
Human judges are unreliable☜The behavioral disposition argument avoids the problems associated with the operational interpretation, but relies on human judges, who may chauvanistically reject intelligent machines or foolishly pass cleverly designed but unintelligent machines.☜FFFACD
◄
Ned Block »
Ned Block
Ned Block☜Arguments advanced by Ned Block.☜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:
#241
Node type:
SupportiveArgument
Įvedimo data (GMT):
6/13/2006 8:53:00 PM
Paskutinės redakcijos data (GMT laikas):
12/9/2007 9:58:00 PM
Show other editors
Įeinančios sąsajos:
1
Išeinančios sąsajos:
1
Vidutinis vertinimas:
0
by
0
vartotojai
x
Select file to upload