Connecting Education and Fun: Using Turing Machine Games in Theory of Computation
This program is tentative and subject to change.
Active learning in computer science can take many forms: group problem-solving, project-based learning, peer instruction, and interactive lab exercises. This poster presents activities in an undergraduate-level Theory of Computation course, where students solved puzzles for three games related to Turing Machines: Turing Tumble, Code Master, and the Game of Life. After the game session, students completed reflections to make connections between the games and Turing Machines. While the reflections were graded solely on completion, they demonstrated that students can make connections between these game environments and Turing Machines. For example, students recorded similarities about the infinite tape and the Game of Life grid cells, switches in Turing Tumble and transitions in Turing Machines, and string acceptance in a state machine being similar to the conditions to reach the portal in Code Master.
Dr. Tammy VanDeGrift is a Professor of computer science in the Shiley School of Engineering at the University of Portland (Oregon, USA). She enjoys teaching and studying how people learn engineering and computer science.