DocumentCode
2002023
Title
Decidability and Constructivism
Author
Quevedo-Torrero, Jesús Ubaldo
Author_Institution
Dept. of Comput. Sci., Univ. of Wisconsin-Parkside, WI
fYear
2009
fDate
27-29 April 2009
Firstpage
1711
Lastpage
1714
Abstract
Occasionally, computer science college instructors are concerned with what to teach but not with the how to teach it. However, the application of the learning theory of constructivism in computer science education has a positive impact on student achievement. Moreover, research findings in this area suggest that effective constructivist lessons in computer science involved the design of cognitive models. This paper presents the design of a cognitive model that can be used in the teaching of the theory of computation. This model represents a framework notation for the construction of a decider Turing machine that will be the basis for decidabilty.
Keywords
Turing machines; computability; computer science education; decidability; decision theory; Turing machine; cognitive model; computer science education; constructivism; decidability; learning theory; Application software; Automata; Computational modeling; Computer science; Computer science education; Educational institutions; Information technology; Mathematical model; Programming profession; Turing machines; Turing machine; theory of computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-3770-2
Electronic_ISBN
978-0-7695-3596-8
Type
conf
DOI
10.1109/ITNG.2009.291
Filename
5070912
Link To Document