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
🔎
Excluding sub-cognitive questions makes test unbiased
Einwand
1
#230
A machine's inability to answer subcognitive questions—e.g. questions about ranking associative pairings—may show that machines can never match human responses, but we can make the test unbiased by excluding such questions.
Argument anticipated by Robert French, 1990.
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: failing the Test is not decisive »
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
▲
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
■
Excluding sub-cognitive questions makes test unbiased
Excluding sub-cognitive questions makes test unbiased☜A machines inability to answer subcognitive questions—e.g. questions about ranking associative pairings—may show that machines can never match human responses, but we can make the test unbiased by excluding such questions.☜EF597B
●
A purely cognitive test isn't an intelligence test »
A purely cognitive test isn't an intelligence test
A purely cognitive test isn't an intelligence test☜We cant distill a level of purely cognitive quesitons to make an unbiased test. Excluding all subcognitive questions would exclude all questions involving analogy and categorizations, which would render the test useless as a test of intelligence.☜EF597B
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
+Kommentare (
0
)
- Kommentare
Kommentar hinzufügen
Newest first
Oldest first
Show threads
+Verweise (
0
)
- Verweise
Hinzufügen
List by:
Citerank
Map
+About
- About
Eingabe von:
David Price
NodeID:
#230
Node type:
OpposingArgument
Eingabedatum (GMT):
6/13/2006 3:22:00 PM
Zuletzt geändert am (GMT):
10/23/2007 7:24:00 PM
Show other editors
Eingehende Kreuzverbindungen
0
Abgehende Kreuzverbindungen
0
Durchschnittsbewertung
0
by
0
Nutzer
x
Select file to upload