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
đ
Alan Turing
Protagonist
1
#2768
Arguments advanced by Alan Turing.
CONTEXT
(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
▲
Protagonists »
Protagonists
ProtagonistsâThe contributions of over 300 protagonists can be explored via a surname search, or using the growing list developing here.âD3B8AB
■
Alan Turing
Alan TuringâArguments advanced by Alan Turing.âD3B8AB
►
Computers can make certain types of mistakes »
Computers can make certain types of mistakes
Computers can make certain types of mistakesâMachines cant commit errors of functioningâarising from physical constructionâif they are properly constructed. But can commit errors of conclusionâarising from the reasoning processâeg by making faulty inferences based on inadequate information.âFFFACD
►
Computers can be subject of own thoughts »
Computers can be subject of own thoughts
Computers can be subject of own thoughtsâWhen a computer solves equations, the equations can be said to be the object of its thought. Similarly when a computer is used to predict its own behaviour or to modify its own program, we can say that its the object of its own thoughts.âFFFACD
►
Behaviour diversity dependent on storage capacity »
Behaviour diversity dependent on storage capacity
Behaviour diversity dependent on storage capacityâGreat diversity of behaviour is possible for machines if they have large enough storage capacities. Objection is based on misconception that it is not possible for a machine to have much storage capacity.âFFFACD
►
Strawberry-enjoying computers may yet be made »
Strawberry-enjoying computers may yet be made
Strawberry-enjoying computers may yet be madeâComputers may yet be created that will enjoy strawberries and cream, but the only importance of this would be to illuminate other issues, such as the possibility of friendship between man and machine.âFFFACD
►
Poor inductions from limited experience »
Poor inductions from limited experience
Poor inductions from limited experienceâDisability arguments are bad inductions from a limited base of experience. Just because the machines we have seen are clunky, ugy, mechanical and so forth, we cant assume that a machine could never fall in love or enjoy strawberries and cream. âFFFACD
►
Be a solipsist or be pragmatic »
Be a solipsist or be pragmatic
Be a solipsist or be pragmaticâRegarding consciousness as a necessary requirement for thought seems reasonable until you consider how you know if someone else is conscious. Solipsism is one respose to the uncertainty, judging pragmatically on the basis of behaviour another.âFFFACD
►
Turing Test is an adequate test of thinking »
Turing Test is an adequate test of thinking
Turing Test is an adequate test of thinkingâIf a computer can persuade judges that it is human via teletyped conversations, it passes the test and is deemed able to think.âFFFACD
►
Computers aren't entirely predictable »
Computers aren't entirely predictable
Computers aren't entirely predictableâBelief that computers are entirely predictable is based on false assumption that humans can know everything that follows deductively from a set of premises. But humans learn new things in part through the working out of deductive consequences.âFFFACD
►
Machines frequently surprise us »
Machines frequently surprise us
Machines frequently surprise usâComputer users and even experts are often surprised by the things that computers do.âFFFACD
►
Argument applies to any case of surprise »
Argument applies to any case of surprise
Argument applies to any case of surpriseâYou could always say that being surprised came from you, the interpreter, not from anything original on the other persons or machines partâeg surprise at a joke could be attributed to your interpretation rather than creativity by the joke teller.âFFFACD
►
Random selection produces free will »
Random selection produces free will
Random selection produces free willâMachines can exhibit free will by way of random selection, produced in the machine via the generation of random values (for example by sampling random noise).âFFFACD
►
Theological argument is ungrounded »
Theological argument is ungrounded
Theological argument is ungroundedâThe view that only humans have souls is as ungrounded as the view that men have souls but women dont. For all we know, in creating thinking machines, we may be serving Gods ends by providing dwellings for souls he creates.âFFFACD
►
The Transmigration Consolation »
The Transmigration Consolation
The Transmigration ConsolationâHeads-in-sand objections too trivial to merit response; consolation is more appropriate. Some comfort may be found in belief that souls may pass from humans to machines when humans die by the theological doctrine of the transmigration of the soul.âFFFACD
►
A human can't simultaneously beat all machines »
A human can't simultaneously beat all machines
A human can't simultaneously beat all machinesâTheorems like Churchs, Gödels, and Turings, show only that a human can beat one machine on a given occasion. But theres no reason to believe that a human can out-think all machines. âFFFACD
►
Confuses rules of conduct with rules of behaviour »
Confuses rules of conduct with rules of behaviour
Confuses rules of conduct with rules of behaviourâWe cant formulate a complete set of rules of conduct for human performance, but human behaviour is still governed by natural laws that can in principle be given a mechanical descriptionâand hence its possible to build a machine to fit this descriptâFFFACD
►
Perform the test in telepathy-proof rooms »
Perform the test in telepathy-proof rooms
Perform the test in telepathy-proof roomsâTo prevent ESP related problems the test would have to be carried out in telepathy-proof rooms.âFFFACD
►
Yes: human imitation is sufficient »
Yes: human imitation is sufficient
Yes: human imitation is sufficientâThe orginal Turing Test is an imitation game in 2 stages: 1) a man and a woman each try to convince an iterrogator that he or she is a woman; 2) the man is replaced by a machine. If the machine successfully imitates the man, it can think.â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
<<
<
April 2024
>
<<
April 2024
S
M
T
W
T
F
S
14
31
1
2
3
4
5
6
15
7
8
9
10
11
12
13
16
14
15
16
17
18
19
20
17
21
22
23
24
25
26
27
18
28
29
30
1
2
3
4
19
5
6
7
8
9
10
11
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
+Comments (
0
)
- Comments
Add a comment
Newest first
Oldest first
Show threads
+Citations (
0
)
- Citations
Add new citation
List by:
Citerank
Map
+About
- About
Entered by:-
David Price
NodeID:
#2768
Node type:
Protagonist
Entry date (GMT):
7/20/2007 6:03:00 PM
Last edit date (GMT):
7/20/2007 6:03:00 PM
Show other editors
Incoming cross-relations:
0
Outgoing cross-relations:
17
Average rating:
0
by
0
users
x
Select file to upload