"A solvable connectionist model of immediate recall of ordered lists."

Neil Burgess (1994)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-09-18

- view
  - electronic edition @ neurips.cc (open access)
  - electronic edition @ djvuzone.org (archived)
- export record
  dblp key:
  - conf/nips/Burgess94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/Burgess94
Neil Burgess:
A solvable connectionist model of immediate recall of ordered lists. NIPS 1994: 51-58

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.