The RAAM network

Passive-active transformations can be achieved in part , via a recursive auto-associative memory (RAAM) network (see detailed text).

A RAAM network compresses constituent vectors into complex representations, and decompresses those complex representations back into their constituent parts.

Processes of compression and decompression can be repeated to deal with arbitrarily complex connectionist representations.



John Pollock, 1990.
RELATED ARTICLESExplain
Artificial Intelligence
Can computers think? [1]
Yes: connectionist networks can think [5a]
The Connectionist Dilemma
Connectionist representations avoid the dilemma
Tensor product representations
Constituents lack causal powers
Implicit-structured representations causally effective
The RAAM network
Chalmers's representations lack syntactic structure
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip