View Proposal

---

Proposer

Thomas Basuki

Title

A Complete Turing Machine Simulator

Goal

Building a software that reads a graph of Turing Machine and turns it into a Turing Machine simulator

Description

Turing Machine has always been used as a tool to teach the theory of computing and computability. The behaviour of a Turing Machine can be depicted as a graph and then formally defined in text following a specific format. The formal definition of a Turing Machine with an input string can then be given as an input for a simulator that runs the Turing Machine on the given input to produce output. This has been the standard way to test the correctness of a Turing Machine. In this project, you have to develop a program that can read a Turing Machine graph, translate it to a formal definition and simulate the Turing Machine behaviour on input strings. Your program will ask the user to provide input strings and visualise how the Turing Machine runs on the input.

Resources

Background

Url

Difficulty Level

Moderate

Ethical Approval

InterfaceOnly

Number Of Students

1

Supervisor

Thomas Basuki

Keywords

turing machine, simulator, graph

Degrees

Bachelor of Science in Computing Science