plc.myforum.ro

kosta · Member Joined: 09 Aug 2015 Posts: 161 Location: Salonic

Creating a Turing Machine in Python – Part 1
A Turing machine is a mathematical tip of computation that reads and writes symbols of a tape based on a table rules. Each Turing machine can be defined by a list of states and a list of transitions. Based on a start state (s0), the Turing machine works its way through all the states until it reaches a final state (sf). If no transition leads to the final state, the Turing machine will run ‘forever’ and eventually run into errors.

A transition is defined by the current state, the read symbol at the current position on the tape, the next state and the next symbol that must be written to the tape. Additionally, it contains a direction to determine whether the head of the tape should move the left, right or not at all. To visualize this process, let’s take a look at a very simple Turing machine that increments the value from the initial tape by one.
https://www.codeproject.com/Articles/1222216/Creating-a-Turing-Machine-in-Python-Part-2
https://github.com/phillikus/turing_machine