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
🔎
Jerry Fodor
Πρωταγωνιστής
1
#2784
Arguments advanced by Jerry Fodor.
Λεπτομέρειες πλοηγού
(Βοήθεια)
-
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
■
Jerry Fodor
Jerry Fodor☜Arguments advanced by Jerry Fodor.☜D3B8AB
►
Unconscious and conscious states aren't identical »
Unconscious and conscious states aren't identical
Unconscious and conscious states aren't identical☜Searle presupposes that any given unconscious state is identical to its conscious form. But identity is partly determined by causal powers, and the causal powers of an unconscious state are different from the causal powers of a conscious state.☜FFFACD
►
The consciousness-pill thought experiment »
The consciousness-pill thought experiment
The consciousness-pill thought experiment ☜The connection principle isnt controversial, even in an extreme form. Its just an interesting possibility—and because the possibility isnt controversial, theres nothing wrong with Searles account.☜FFFACD
►
Implementable in functional system »
Implementable in functional system
Implementable in functional system☜Properly organized functional states generate consciousness. Such organization exists in the brain and can be built into computers as well.☜FFFACD
►
Computationalism »
Computationalism
Computationalism☜Computationalism locates the mental in abstract computational states embedded in a complex network of inputs, outputs, and other mental states: machine-state functionalism locates it in the various possible machine states that could implement them. ☜FFFACD
►
Brain-style modelling can be misleading »
Brain-style modelling can be misleading
Brain-style modelling can be misleading ☜Basing psychological theories on facts about the brain can be misleading. Neural inspiration seems useful, but its led to a revival of such weak psychological theories as: associationism; microfeature analysis; and statistically based learning.☜FFFACD
►
Facts about the brain may be irrelevant »
Facts about the brain may be irrelevant
Facts about the brain may be irrelevant☜Structures at different levels of organisation are often dissimilar. Thinking may have little in common with the neural structures its implemented in. Basing a theory of cognitive architecture on a theory about the brain requires care.☜FFFACD
►
The Connectionist Dilemma »
The Connectionist Dilemma
The Connectionist Dilemma☜The connectionist approach to cognitive science is impaled on the horns of a dilemma: it is either inadequate as a theory of mind, or else it is an implementation of the classical architecture (see detailed text).☜FFFACD
►
Connectionism is associationism »
Connectionism is associationism
Connectionism is associationism☜Processing units in a connectionist network are connected by associative links. Associationist theories cant account for systematicity and related phenomena: symbolic AI can via structured representations and structure sensitive thought processes.☜FFFACD
►
Constituents lack causal powers »
Constituents lack causal powers
Constituents lack causal powers☜The parts of a tensor product representation are not explicitly contained or tokened within it—the parts have no independent status in the complex representation. As such, tensor product constituents lack individual causal powers.☜FFFACD
►
The Regress of Contexts »
The Regress of Contexts
The Regress of Contexts ☜Smolenskys coffee representation leads to an infinite regress of representations. Coffee depends on a higher order representation of cup-with-coffee. But cup-with-coffee presumably depends on another (eg cup-with-coffee-on-the table). And so on.☜FFFACD
►
Yes: physical symbol systems can think [3] »
Yes: physical symbol systems can think [3]
Yes: physical symbol systems can think [3]☜Thinking is a rule governed manipulation of symbolic representational structures. In humans, symbol systems are instantiated in the brain, but the same symbol systems can also be instantiated in a computer. ☜FFFACD
►
Symbol structures can be distributed »
Symbol structures can be distributed
Symbol structures can be distributed☜A classicial symbol processor can be physically distributed in memory, and can thereby exhibit graceful degradation. So distributed systems like connectionist networks dont have any principled advatange over physical symbol systems.☜FFFACD
►
The 100-step constraint »
The 100-step constraint
The 100-step constraint☜Alogrithms modelling cognitive processes must meet the 100-step constraint for performing complex tasks imposed by the brains timescale. Classical sequential algorithms, which run in millions of time-steps now, seem unlikely to meet the constraint.☜FFFACD
►
Symbol processing can take place in parallel »
Symbol processing can take place in parallel
Symbol processing can take place in parallel☜A classical system can be implemented in a parallel architecture: eg by executing multiple symbolic processes at the same time. So parallel processing systems, like connectionist networks, have no principled advantage over classical symbol systems.☜FFFACD
►
The language of thought »
The language of thought
The language of thought☜The language of thoughts a formal language that mental processes operate on; with a combinatorial syntax and semantics. Sentences are generated from combinations of words: complex mental representations from combinations of simpler representations.☜FFFACD
►
Affordances are trivial »
Affordances are trivial
Affordances are trivial☜Affordances are just another name for whatever it is in the environment that makes an organism respond as it does. But such a notion cant provide a substantial explanation of perception and adds nothing new to our knowledge of perception mechanism☜FFFACD
►
Classicists aren't committed to explicit rules »
Classicists aren't committed to explicit rules
Classicists aren't committed to explicit rules☜The possibility of implicit rules doesnt argue against the classical symbolic framework, because theres a body of work within the classicist camp that shows how implicit rules can be modeled.☜FFFACD
►
Proper instantiations require the right causal connections »
Proper instantiations require the right causal connections
Proper instantiations require the right causal connections☜The definition of instantiation used in the Chinese Room argmument isnt sufficiently rich for the Chinese Room to be considered as an instantiation of a program. ☜FFFACD
►
Causal connection to world is essential to meaning »
Causal connection to world is essential to meaning
Causal connection to world is essential to meaning☜Mental states become meaningful— intentional or semantic—through causal connecton via the senses to, and ability to act on, the external world. Searle doesnt show that no causal connection could ever produce meaning at all, just that his man cant.☜FFFACD
►
Turing Test only provides partial evidence »
Turing Test only provides partial evidence
Turing Test only provides partial evidence☜The Turing Test only provides partial, inductive evidence of intelligence, and passing the test does not guarantee successful simulation of human behaviour. Moreover, any given Turing test provides only a finite sample of a test takers repertoire.☜FFFACD
◄
Jerry Fodor »
Jerry Fodor
Jerry Fodor☜Arguments advanced by Jerry Fodor.☜FFFACD
◄
Jerry Fodor »
Jerry Fodor
Jerry Fodor☜Arguments advanced by Jerry Fodor.☜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
+Σχόλια (
0
)
- Σχόλια
Προσθήκη σχολίου
Newest first
Oldest first
Show threads
+Αναφορές (
0
)
- Αναφορές
Προσθήκη αναφοράς
List by:
Citerank
Map
+About
- About
Προστέθηκε από:-
David Price
NodeID:
#2784
Node type:
Protagonist
Ημερ/νία δημιουργίας(GMT):
7/20/2007 6:20:00 PM
Ημερ/νία τελευτ. επεξεργασίας(GMT time):
7/20/2007 6:20:00 PM
Show other editors
Εισερχόμενες συνδέσεις ιδεών:
2
Εξερχόμενες συνδέσεις ιδεών:
20
Μέση βαθμολογία:
0
by
0
χρήστες
x
Select file to upload