View Proposal
-
Proposer
-
Thomas Basuki
-
Title
-
From Turing Machine to Functions
-
Goal
-
Building a program that checks whether a Turing Machine does implement a function
-
Description
- The Turing Machine is an abstract machine capable to perform any computation. The behaviour of a Turing Machine can be depicted as a graph consisting of states, transitions between states and actions combining movement of tape head and updating the tape content. The Turing Machine reads the input string in the tape and processes it until it halts and produces output string in the tape.
In this project, you have to develop a program that can check whether a Turing Machine does implement a function. The function takes a number of arguments, each is represented in unary in the Turing Machine. It is also aimed to build a set of test cases to test the performance of the program.
- Resources
-
-
Background
-
-
Url
-
-
Difficulty Level
-
Moderate
-
Ethical Approval
-
InterfaceOnly
-
Number Of Students
-
1
-
Supervisor
-
Thomas Basuki
-
Keywords
-
turing machine, program classification
-
Degrees
-
Bachelor of Science in Computing Science