Zusammenfassung
Was zeichnet Experten vor Anfängern aus, was macht sie zu erfolgreicheren Problemlösern? Welches Wissen liegt ihrem Expertentum zugrunde und wie kann es zielführend beim Lösen neuer Probleme eingesetzt werden? Weshalb ist die Überlegenheit von Experten relativ eng auf den Gegenstandsbereich ihres Expertentums eingeschränkt?
Diese Arbeit wurde im Rahmen des Schwerpunktprogramms Wissenspsychologie durch die Deutsche Forschungsgemeinschaft unterstützt (Vo 212/2-4). — Erwin Gainer, Ursula Haack, Klaus Hahn, Dieter Heim, Hans Henning Schulze und Kai Wagner haben wesentliche Anteile an dieser Arbeit. Wir danken ihnen, Martin Heydemann, Otto Kühn, Franz Schmalhofer, Munira Schömann, Wolfgang Schwarz und Gerd Waloszek für anregende Diskussionen.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Anderson, J.R. (1983). The architecture of cognition. Cambridge, Mass.: Harvard University Press.
Anderson, J.R. (1987). Skill acquisition: Compilation of weak-method problem solutions. Psychological Review, 94, 192–210.
Anderson, J.R., Corbett, A.T.&Reiser, B.J. (1987). Essential USP. Reading, Mass.: Addison-Wesley.
Anderson, J.R., Farrell, R.&Sauers, R. (1984). Learning to program in LDP. Cognitive Science, 8, 87–129
Chase, W.G. and Simon, H.A. (1973). The mind’s eye in chess. In W.G. Chase (Ed.) Visual information processing. New York: Academic Press, 215–281.
Chi, M.T.H., Feltovich, P,J.&Glaser, R. (1981). Categorization&representation of physics problems by experts&novices. Cognitive Science, 5, 121–152.
DeGroot, A.D. (1965). Thought&choice in chess. The Hague: Mouton.
Fodor, J.&Pylyshyn, P. (1988). Connectionism&cognitive architecture: A critical analysis. Cognition, 28, 3–71.
Goebel, R. (1988). Das Schreiben rekursiver Funktionen: Ein Computermodell. Unveröffentlichte Diplomarbeit. Marburg: FB Psychologie
Goebel, R. (1990). Binding, Episodic Short-Term Memory,&Selective Attention, Or Why are PDP Models Poor at Symbol Manipulation? In D.S. Touretzky, J.L. Elman, T.J. Sejnowski,&G.E. Hinton (Hrsg.), Connectionist Models. Proceedings of the 1990 Summer School. San Mateo: Morgan Kaufman.
Goebel, R. (1992) The role of visual perception, selective attention,&short-term memory for symbol manipulation: a neural network model that learns to evaluate simple LISP expressions. In: K.F. Wender, F. Schmalhofer&H.D. Boecker: Cognition&Computer Programming. Ablex Publishing Corporation (im Druck).
Goebel, R.&Vorberg, D. (1991). Das Lösen rekursiver Programmierprobleme: Ein Simulationsmodell. Kognitionswissenschaft, 2, 27–36.
Greeno, J.G.&Simon, H.A. (1988). Problem-solving&reasoning. In R.C. Atkinson, RJ. Hermstein, G. Lindzey,&R.D. Luce (Eds.) Stevens’ Handbook of Experimental Psychology, 2nd ed. Vol. 2. New York: Wiley, 589–672.
Haack, U., Hahn, K.&Wagner, K.U. (1989). Programmieren als Problemlösen: Die Struktur von Expertenwissen. Zeitschrift für Psychologie, 197, 247–262.
Harvey, B. (1985/1986). Computer Science LOGO Style (Vols. 1+2). Cambridge, Mass.: MIT Press
Haussmann, K. (1986). Iteratives vs. rekursives Denken beim Problemlösen im Mathematikunterricht. Mathematica Didactica, 9, 61–74.
Hinsley, D.A., Hayes, J.R.&Simon, H.A. (1977). From words to equations: meaning&representation in algebra problems. In: Carpenter, P.&Just, M. (eds.), Cognitive processes in comprehension. Hillsdale, N.J.: Erlbaum.
Hofstadter, D.R. (1991). The roots of mental fluidity. TR 56, Indiana University: Center for Research on Concepts&Cognition.
Holyoak, K.J.&Thagard, P. (1989), Analogical mapping by constraint satisfaction. Cognitive Science, 13(3), 295–355.
Kahney, H. (1984). What novice programmers know about recursion. In: A. Janda (ed.), Human factors in computing systems (S. 209–228 ). Amsterdam: North-Holland.
Kant, E.&Newell, A. (1984). Problem solving techniques for the design of algorithms. Information Processing&Management, 20, 97–118.
Kintsch, W.&Greeno, J. G. (1985). Understanding&solving word arithmetic problems. Psychological Review, 92, 109–129.
Kurland, D.M.&Pea, R. D. (1985). Children’s mental models of recursive LOGO programs. Journal of Educational Computing Research, 1, 235–243.
Leinbach, C.&Wijesinha, A.L. (1986). On classifying recursive algorithms. ACM -Bci 18, 186–190
Luchins, A. (1942). Mechanisation in problem solving. Psychological Monographs, 54, 1–95.
Mitchell, M.&Hofstadter, D. (1990). The right concept at the right time: how concepts emerge as relevant in response to context-dependent pressures. Proceedings of the 12th Annual Conference of the Cognitive Science Society, 1990, 174–181.
Norman, D.A. (1986). Reflections on Cognition&Parallel Distributed Processing. In D.E. Rumelhart&J.L. McClelland (Hrsg.), Parallel Distributed Processing. Volume H, MIT Press, Cambridge, MA.
Pinker, S.&Prince, A. (1988). On Language&Connectionism: Analysis of a Parallel Distributed Processing model of Language Acquisition. Cognition, 28, 73–193.
Pirolli, P.L. (1986). A cognitive model&computer tutor for programming recursion. Human-Computer-Interaction, 2, 319–355.
Pirolli, P.L.&Anderson, J.R. (1985). The role of learning from examples in the acquisition of recursive programming skills. Canadian Journal of Psychology, 39, 240–272.
Polya, G. (1949). Schule des Denkens. Vom Lösen mathematischer Probleme. Bern: Francke.
Sauers, R.&Farrell, R. (1982). GRAPES user’s manual. Pittsburgh, Pa.: Department of Psychology, CM University.
Schoenfeldt, A.H. (1985). Mathematical problem solving. New York: Academic Press.
Soloway, E. (1985). From problems to programs via plans: The content&structure of knowledge for introductory LISP programming. Journal of Educational Research, 1, 157–172.
Touretzky, D.S. (1990). Common LISP. A gentle introduction to symbolic computation. Redwood City, Ca.: Addison-Wesley.
Vorberg, D.&Goebel, R. (1991). Das Lösen rekursiver Programmierprobleme: Rekursionsschemata. Kognitionswissenschaft, 1, 83–95.
Winston, P.H.&Horn, B.K.P. (1984). LISP, 2nd ed. Reading, Mass.: Addison-Wesley.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goebel, R., Vorberg, D. (1992). Ein Simulationsmodell für das Lösen rekursiver Programmierprobleme. In: Reiss, K., Reiss, M., Spandl, H. (eds) Maschinelles Lernen. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77623-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-77623-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55641-1
Online ISBN: 978-3-642-77623-6
eBook Packages: Springer Book Archive