In search of learning and knowing
β Scribed by Amy Tracy Wells
- Publisher
- Wiley (John Wiley & Sons)
- Year
- 2006
- Tongue
- English
- Weight
- 121 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-7870
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The supportive arguments for hypermedia and hypertext learning environments typically assert that as the systems permit individuals to selfβselect content based on needs, to control the pace and content, and/or provide a measure of control otherwise missing in traditional, linear texts and lectures, learning and knowing outcomes increase. There are two difficulties with this argument and some of the resultant empirical literature. The first is that knowing is a complex phenomenon which can be variously defined and measured. However, the literature often focuses on a narrow range of definitions and measures and doesn't exploit the full range of theory. This, in turn, may lead to the second difficulty, that of very limited outcomes. A cognitive model of learning and knowing is presented and contrasted with a sample of empirical research. This model provides a solid theoretical basis for research into cognitively engaging hypermedia systems.
π SIMILAR VOLUMES
Recent neurobiological evidence suggests that environmentally derived activity plays a central role in regulating neuronal growth and neuronal connectivity. Artificial neural networks with distributed representations display many features of knowing and learning that are known from biological intell
Perhaps no other student question is more annoying to instructors than "Do we need to know this for the exam?" A "no" answer implies that the material taught might be superfluous and the student can ignore it. A "yes" answer often implies the student will cram the material into memory, may not under
Area concentrated search provides a means by which foragers may exploit heterogeneities in a resource following a simple rule of thumb which reacts to encounters with that resource by changing search speeds. A model with few parameters is presented. It permits an analysis of optimal searching rules