Komponenta výukového serveru TI - Turingovsky úplné systémy

Abstract

Turing-complete systems are computational models capable of realizing any algorithm. This thesis describes the creation of a web application that simulates several such models - specifically the Turing machine, the Minsky machine, and the tag system. The application allows the user to define a specific machine and its input data, view the computation process in a clear manner, and control the simulation. A key feature is the mutual simulation between the implemented models, which demonstrates their Turing completeness. During mutual simulation, a simulating machine is automatically constructed, and detailed information about the process is displayed, such as the step ratio between the simulating and the simulated machine. The application also provides management of saved machines, several pre-made example machines, and a user interface for creating a custom machine. The application is implemented in C# using the Blazor framework and builds upon a previous bachelor's thesis.