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
đ
Machine is dated
Einwand
1
#282
The machine would not be able to answer questions about current events.
Argument anticipated by 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: but Neo-Turing test is adequate »
No: but Neo-Turing test is adequate
No: but Neo-Turing test is adequateâThe neo-Turing test interprets the Turing test as providing an overt, measurable behavioural and operational definition of thinkingâand refines the test to avoid classical problems associated with behaviourism and other related criticisms.â59C6EF
▲
The Psychologism Objection »
The Psychologism Objection
The Psychologism ObjectionâBehaviour by itself isnt enough: internal differences matter. If two systems behave in exactly the same way, one might be intelligent while the other is stupid because of differences in the way each system processes information.âEF597B
▲
All Possible Conversations Machine »
All Possible Conversations Machine
All Possible Conversations MachineâAn unintelligent machine engaging in sensible conversation by searching a database containing all possible lines of conversation in a finite Turing test, would pass the neo-Turing testâbut it would be only echoing its programmers intelligence.â98CE71
■
Machine is dated
Machine is datedâThe machine would not be able to answer questions about current events.âEF597B
●
Dated system can still be intelligent »
Dated system can still be intelligent
Dated system can still be intelligentâIntelligence doesnt require knowledge of current events. For example, the machine could be programmed to simulate Robinson Crusoe, who is intelligent even though he cant answer questions about recent events.âEF597B
●
Machine could be updated »
Machine could be updated
Machine could be updatedâProgrammers could periodically update the machines list of responses.â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:
#282
Node type:
OpposingArgument
Eingabedatum (GMT):
6/15/2006 1:35:00 PM
Zuletzt geÀndert am (GMT):
12/9/2007 11:19:00 PM
Show other editors
Eingehende Kreuzverbindungen
0
Abgehende Kreuzverbindungen
0
Durchschnittsbewertung
0
by
0
Nutzer
x
Select file to upload