Cogito, Ergo sum! cognitive processes of students dealing with data structures
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Models and areas for CS education research
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Didactic strategies for promoting significant learning in formal languages and automata theory
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Exploring students' understanding of the concept of algorithm: levels of abstraction
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
A visual and interactive automata theory course emphasizing breadth of automata
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Reduction -- an abstract thinking pattern: the case of the computational models course
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Applying abstraction to master complexity
Proceedings of the 2nd international workshop on The role of abstraction in software engineering
| Hi-index | 0.00 |
The paper illustrates how theories from mathematics education can be applied for explaining student conception of computing science ideas. It does this by demonstrating how the theme of reducing abstraction [5] can be used for analyzing students' mental processes when the students are in the process of solving problems in Computability Theory. The topic of Computability Theory in presented here as an example for demonstrating how research in Computing Science education can use learning theories, "borrowed" from mathematics education research, for explaining learning processes.