This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
learning_paradigms:cognitivism [2011/06/30 12:32] jpetrovic [About cognitivism] |
learning_paradigms:cognitivism [2011/06/30 14:50] jpetrovic [Criticisms] |
||
---|---|---|---|
Line 18: | Line 18: | ||
===== Human memory ===== | ===== Human memory ===== | ||
- | If human cognitive architecture **Memory** is often defined as "//an organism's ability to store, retain, and recall information and experiences//"(([[http://en.wikipedia.org/wiki/Memory|Wikipedia: Memory.]] Retrieved March 21, 2011.)). Since it has a crucial role in acquisition and retention of knowledge, it was the subject of many researches and an essential part of many cognitivist learning theories. | + | If human cognitive architecture is to be analyzed, then the role and properties of human memory system should also be accounted for. **Memory** is often defined as "//an organism's ability to store, retain, and recall information and experiences//"(([[http://en.wikipedia.org/wiki/Memory|Wikipedia: Memory.]] Retrieved March 21, 2011.)). Since it has a crucial role in acquisition and retention of knowledge, it was the subject of many researches and an essential part of many cognitivist learning theories. |
* [[memory_models:A Brief History of Human Memory Systems|A Brief History of Human Memory Systems Research]] | * [[memory_models:A Brief History of Human Memory Systems|A Brief History of Human Memory Systems Research]] | ||
Line 52: | Line 52: | ||
* **[[http://www.scientificamerican.com/article.cfm?id=why-is-turings-halting-pr|Turing's halting problem]]** which claims that given a description of a program, it is impossible to decide whether the program finishes running or continues to run forever for any given program input. This theorem proven by [[http://www.alanturing.net/|Alan Turing]] in 1936 shows how some things are naturally non-computable. | * **[[http://www.scientificamerican.com/article.cfm?id=why-is-turings-halting-pr|Turing's halting problem]]** which claims that given a description of a program, it is impossible to decide whether the program finishes running or continues to run forever for any given program input. This theorem proven by [[http://www.alanturing.net/|Alan Turing]] in 1936 shows how some things are naturally non-computable. | ||
- | During the 1970s **humanism** evolved as an opposing view to both behaviorism and cognitivism beginning with the **holistic approach**, belief in the power of an individual and view **learning as a way of fulfilling his potentials**. | + | During the 1970s [[learning_paradigms:humanism]] evolved as an opposing view to both behaviorism and cognitivism beginning with the **holistic approach**, belief in the power of an individual and view **learning as a way of fulfilling his potentials**. |
===== Bibliography ===== | ===== Bibliography ===== | ||