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
đ
Jack Copeland
Protagonist
1
#2787
Arguments advanced by Jack Copeland.
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
■
Jack Copeland
Jack CopelandâArguments advanced by Jack Copeland.âD3B8AB
►
A determined machine can still have free will »
A determined machine can still have free will
A determined machine can still have free willâHumans and computers are both deterministic systems, but this is still compatible with their being free. Actions caused by an agents beliefs and desires are free because if those factors had been different the agent might have acted differently.âFFFACD
►
Turing's randomizer is only a tiebreaker »
Turing's randomizer is only a tiebreaker
Turing's randomizer is only a tiebreakerâHelplessness argument is misleading because it implies that random processes control all decision making. All the Turing randomizer does is determine what the machine will do in situations in which options are equally preferred.âFFFACD
►
Programs not universally realizable »
Programs not universally realizable
Programs not universally realizableâEven if it is ture that a pattern of molecule movements on a wall is isomorphic with, for example, the formal pattern of the WordStar computer program, the wall will not support the same counterfactuals as the program.âFFFACD
►
The Systems reply to the Chinese Gym »
The Systems reply to the Chinese Gym
The Systems reply to the Chinese GymâSearles Chinese Gym argument commits the same fallacy as the Chinese Room argument commits. It is invalid to infer that the gym as a whole doesnât understand Chinese from the fact that the individuals in the gym donât understand Chinese.âFFFACD
►
Neurons are diversely structured »
Neurons are diversely structured
Neurons are diversely structuredâComputer logic gates consist of variations on a single structure. The brain, by contrast, consists of many different kinds of neuronos (e.g. Pyramidal cells, Purkinje cells & Retinal Bipolar cells. âFFFACD
►
The "part-of" principle is fallacious »
The "part-of" principle is fallacious
The "part-of" principle is fallaciousâThe internalization reply rest on a fallacious part-of principle, whereby, if you cant do X, no part of you can do X. Just because the man who has internalized the Chinese Room cant speak Chinese, it does not follow that no part of him can speak âFFFACD
►
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.âFFFACD
►
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.âFFFACD
►
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.âFFFACD
►
Sense organs not prohibited by Turing »
Sense organs not prohibited by Turing
Sense organs not prohibited by TuringâThe Turing test does not prohibit machines with sense organs from entering. In fact, Turing thought the best way to prepare a computer for competition would be to give it sensory abilities and an appropriate education.âFFFACD
►
Some simulations are duplications »
Some simulations are duplications
Some simulations are duplicationsâSome simulations lack essential features of the object simulatedâeg theatrical death vs real death. Others capture the essential features despite being produced in nonstandard waysâeg artificial coal. The latter are duplications: the former are not.âFFFACD
►
A man simulating a woman is not a woman »
A man simulating a woman is not a woman
A man simulating a woman is not a womanâIf a man were to win the imitation game, he would only have succeeded in simulating a woman. He would, obviously, not be a woman. Therefore the imitation game is not an adequate test.âFFFACD
►
The black box objection »
The black box objection
The black box objectionâThe Test treats the mind as a black boxâinternal processes are left hidden and mysterious; all that matters is input and output. But internal processing shouldnt be ignored, as its crucial to determining whether or not a system really thinks.âFFFACD
►
SUPER PARRY could pass Test by brute force »
SUPER PARRY could pass Test by brute force
SUPER PARRY could pass Test by brute forceâAn advanced alien civilisation could write a program, like, Colbys PARRY, containing ready made responses to questions. This SUPER PARRY would be better prepared for the test, however, because it would contain responses to all possible questions.âFFFACD
►
Machine prepared for repeated sentences »
Machine prepared for repeated sentences
Machine prepared for repeated sentencesâThe aliens would design the program to anticipate repeated sentences and to reply with increasingly irritable responses ultimately terminating altogether.âFFFACD
►
Machine prepared for subsitution tricks »
Machine prepared for subsitution tricks
Machine prepared for subsitution tricksâBecause there are only a finite number of substitution tricks SUPER PARRY could be built to handle all of them.âFFFACD
►
The beefed-up Turing Test »
The beefed-up Turing Test
The beefed-up Turing TestâThe addition of a design criterion to the original Turing test ensures that the system being tested has the right kind of internal design.âFFFACD
►
Turing in a car crash »
Turing in a car crash
Turing in a car crashâYou and Turing are driving and your car crashesâhes gashed up but theres no blood; instead wires and silicon chips stick out of his skin. You might modify your judgment that Turing is a thinking being given this view of his internal constitution.â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:
#2787
Node type:
Protagonist
Entry date (GMT):
7/20/2007 6:22:00 PM
Last edit date (GMT):
7/20/2007 6:22:00 PM
Show other editors
Incoming cross-relations:
0
Outgoing cross-relations:
18
Average rating:
0
by
0
users
x
Select file to upload