Reflector – A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis

Abstract

The Turing Machine model has proven to be capable of simulating every known computational model. Since its inception the model has served as the basis on which computational devices have been constructed. The paper focuses on highlighting the fact that Turing Machine serves as a precise model for defining and executing a specific algorithm based on the Computability Theory. The paper also highlights the fact that when executed on a Turing Machine an algorithm’s time and space complexity can be analyzed based on the Complexity Theory. Therefore, this model can serve as a superb abstraction for the computational devices as number of steps and space required to execute an algorithm can be predicted. It is worth mentioning that the simulator engine named Reflector designed in this study is the foremost simulator in the regards to have the distinct capabilities of; firstly dynamically modelling a Turing Machine based on its manifestations and secondly performing Time & Space Complexity Analysis of an algorithm executed on the Turing Machine.