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
đ
No: failing the Test is not decisive
Stelling
1
#224
It is possible to fail the Turing Test for intelligence and still be an intelligent being.
Ned Block 1981.
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
▲
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: failing the Test is not decisive
No: failing the Test is not decisiveâIt is possible to fail the Turing Test for intelligence and still be an intelligent being. â59C6EF
●
Intelligent machines could fail the test »
Intelligent machines could fail the test
Intelligent machines could fail the testâAn intelligent machine could fail the Turing Test by acting nonhuman, by being psychologically unsophisticatedâthough intelligentâor simply by being bored with the proceedings.â98CE71
●
Judges may discriminate too well »
Judges may discriminate too well
Judges may discriminate too wellâOverly discerning or chauvinistic judges might fail intelligent machines solely because of their machine like behaviour.â98CE71
●
Some intelligent beings would fail the test »
Some intelligent beings would fail the test
Some intelligent beings would fail the testâChimpanzees, dolphins and prelinguistic infants can think but would fail the Turing test. If a thinking animal could fail the test, then presumably a thinking machine could too.â98CE71
●
Turing Test is species biased »
Turing Test is species biased
Turing Test is species biasedâFailing the Turing Test proves nothing about general intelligence because only humans can pass it.â98CE71
●
Nondecisive tests can be useful »
Nondecisive tests can be useful
Nondecisive tests can be usefulâThe Turing Test isnt a definitive litmus test for intelligence, and failing isnt decisive, but this doesnt make it a bad test. Many good tests are nondecisive but useful.âEF597B
◄
Ned Block »
Ned Block
Ned BlockâArguments advanced by Ned Block.âFFFACD
◄
Vulnerable to counter-examples »
Vulnerable to counter-examples
Vulnerable to counter-examplesâWhether behaviorally or operationally interpreted, the Turing test is vulnerable to cases where unthinking machines pass the test or unthinking machines fail it.âFFFACD
◄
Operational interpretation is too rigid »
Operational interpretation is too rigid
Operational interpretation is too rigidâIf thinkings operationally defined, systems that pass the test are necessarily intelligent: systems that fail necessarily unintelligent. But this is too rigid. Intelligent machines could fail the test and unintelligent machines could pass the test.â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:
#224
Node type:
Position
Gemaakt op (GMT):
6/13/2006 2:56:00 PM
Laatste bewerking (GMT):
10/19/2008 7:14:00 PM
Show other editors
Inkomende kruisrelatie
3
Uitgaande kruisrelatie
0
Gemiddelde waardering:
8
by
1
gebruikers
x
Select file to upload