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
đ
PARRY did not pass the test
Einwand
1
#3921
PARRY did not pass the test. The Turing Test is a compared comparison in which a judge knows that there is one computer and one human and has to choose which is which. Unlike the Loebner Prize, which is a Turing Test, PARRY was simply an exercise.
Personal communication, Hugh Loebner, December 2007.
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: existing AI programs have passed the test »
No: existing AI programs have passed the test
No: existing AI programs have passed the testâThe Turing Test is not an adequate test of thinking because existing AI systems have passed the test that clearly do not meet key criteria for thinking or intelligence.â59C6EF
▲
PARRY »
PARRY
PARRYâPARRY beat an extended Turing test by simulating a paranoid subject via a natural language parser and an interpretation-action module tracking a range of emotional states and applying paranoia-specific strategies to deal with shame-induced distress.â98CE71
■
PARRY did not pass the test
PARRY did not pass the testâPARRY did not pass the test. The Turing Test is a compared comparison in which a judge knows that there is one computer and one human and has to choose which is which. Unlike the Loebner Prize, which is a Turing Test, PARRY was simply an exercise.âEF597B
►
ELIZA did not pass the test »
ELIZA did not pass the test
ELIZA did not pass the testâELIZA did not pass the test. The Turing Test is a compared comparison in which a judge knows that there is one computer and one human and has to choose which is which. Unlike the Loebner Prize, which is a Turing Test, ELIZA was simply an exercise.âFFFACD
◄
Hugh Loebner »
Hugh Loebner
Hugh LoebnerâArguments advanced by Hugh Loebner.â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
+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:
#3921
Node type:
OpposingArgument
Eingabedatum (GMT):
12/7/2007 4:28:00 PM
Zuletzt geÀndert am (GMT):
12/7/2007 4:29:00 PM
Show other editors
Eingehende Kreuzverbindungen
1
Abgehende Kreuzverbindungen
1
Durchschnittsbewertung
0
by
0
Nutzer
x
Select file to upload