Description
Individuals encounter problems daily wherein varying numbers of constraints require delimitation of memory to target goal-satisfying information. Multiply-constrained problems, such as compound remote associates, are commonly used to study this type of problem solving.
Download count: 0
Details
Contributors
- Ellis, Derek (Author)
- Brewer, Gene A (Thesis advisor)
- Homa, Donald (Committee member)
- Blais, Chris (Committee member)
- Goldinger, Stephen (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2021
Subjects
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2021
- Field of study: Psychology