Saul Sternberg

Saul Sternberg is a professor emeritus of psychology and former Paul C. Williams Term Professor (1993–1998) at the University of Pennsylvania. He is a pioneer in the field of cognitive psychology in the development of experimental techniques to study human information processing. Sternberg received a B.A. in mathematics in 1954 from Swarthmore College and a PhD in social psychology from Harvard University in 1959.[1] He completed a postdoctoral fellowship in mathematical statistics at the University of Cambridge in 1960, and he subsequently worked as a research scientist in the linguistics and artificial intelligence research department at Bell Laboratories, where he continued to work as a member of the technical staff for over twenty years. Sternberg's first academic position was at the University of Pennsylvania, where he was employed from 1961–1964, and where he has remained since 1985. He has also served as a visiting professor at University College, London, the University of California, Berkeley, and Rutgers University. The impact of Sternberg's theoretical and empirical contributions to the field of cognitive psychology have been recognized by many organizations, and he has been elected to fellowship in the American Psychological Association, the Association for Psychological Science, the Society of Experimental Psychologists, the American Association for the Advancement of Science, and the National Academy of Sciences.[2]

Additive factors method

Sternberg is best known for his introduction of the additive factor method. This is a method that uses reaction time measures over a range of tasks in order to identify different cognitive processing stages. The logic of this method has been disputed as of 2011.[3]

The Sternberg Task

In the early 1960s, Sternberg published an original experiment demonstrating the mechanics of cognitive information processing. The experiment entails memorization of a positive set, a list of items such as numbers or words. The subject is then asked about a particular test item that may or may not have actually been present in the set, and is asked to respond "yes" or "no" accordingly. The time taken for the subject to respond is recorded. This process is then repeated over several trials. What Sternberg found was that response time varied with the size of the positive set. In particular, response time tended to increase with the size of the list.[4] This is significant because it demonstrates evidence for what is known today as the Serial Exhaustive Search Theory, which contends that when questioned regarding the presence of an item in a memory set, people will search every item in short-term memory without stopping, even if the item was found.[5]

References
  1. "Profiles in Giving Back: Dr. Saul Sternberg". www.woodrow.org. The Woodrow Wilson National Fellowship Foundation. 12 February 2018. Retrieved 18 July 2019. After completing his PhD at Harvard in 1960, Dr. Sternberg held a postdoctoral fellowship in mathematical statistics at the University of Cambridge, took up his first academic post at the University of Pennsylvania, and then went on to a research position at Bell Telephone Laboratories for more than two decades. While there, he conducted research in perception, memory, and the control of action, and for fifteen years headed the Human Information Processing Research Department.
  2. "Saul Sternberg's CV". Retrieved 22 December 2008.
  3. Stafford, Tom; Gurney, Kevin N. (14 November 2011). "Additive Factors Do Not Imply Discrete Processing Stages: A Worked Example Using Models of the Stroop Task". Frontiers in Psychology. 2: 287. doi:10.3389/fpsyg.2011.00287. ISSN 1664-1078. PMC 3214734. PMID 22102842.
  4. Bokhorst, F. "The Sternberg Short-Term Memory Experiment". University of Cape Town. Archived from the original on 2 December 2013. Retrieved 2 December 2013.
  5. Schmidt, Charles. "Scanning Short Term Memory". Rutgers. Archived from the original on 3 December 2013. Retrieved 2 December 2013.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.