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
🔎
Computers have understood analogy
TegenArgument
1
#176
Existing computer models have discovered and understood analogies.
PAGE NAVIGATOR
(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
▲
Can computers think? [1] »
Can computers think? [1]
Can computers think? [1]☜Can a computational system possess all important elements of human thinking or understanding? ☜FFB597
▲
No: computers can't draw analogies »
No: computers can't draw analogies
No: computers can't draw analogies☜Computers cant understand analogical comparisons or metaphors. For example, a machine could not understand the sentence: she ran like the wind.☜59C6EF
■
Computers have understood analogy
Computers have understood analogy☜Existing computer models have discovered and understood analogies.☜EF597B
●
ACME »
ACME
ACME☜ACME is a connectionist network that discovers cross domain analogical mappings. The ACME network uses structural, semantic, and pragmatic constraints to seek out those mappings.☜FF97FF
●
SME »
SME
SME☜SME is a structure-mapping engine that discovers analogies between domains by a set of match rules. The analogies that result are judged according to the criteria of clarity, richness abstractness, and systemacity.☜FF97FF
●
COPYCAT »
COPYCAT
COPYCAT☜COPYCATs neither a symbol manipulator nor a connectionist network—though it draws on both paradigms. Representations arent delivered hand-tailored to the model but are built up through fluid interaction between low-level and high-level components.☜FF97FF
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
+Commentaar (
0
)
- Commentaar
Voeg commentaar toe
Newest first
Oldest first
Show threads
+Citaten (
0
)
- Citaten
Voeg citaat toe
List by:
Citerank
Map
+About
- About
Gemaakt door:
David Price
NodeID:
#176
Node type:
OpposingArgument
Gemaakt op (GMT):
6/6/2006 2:28:00 PM
Laatste bewerking (GMT):
11/29/2007 1:05:00 PM
Show other editors
Inkomende kruisrelatie
0
Uitgaande kruisrelatie
0
Gemiddelde waardering:
0
by
0
gebruikers
x
Select file to upload