Turing machine

Turing machineTuring machine is a hypothetical machine which can run any computer algorithm. It is a theoretical model of a computer. Machine is hypothetical because it requires an infinite tape for reading/writing. Turing machine consists of (infinite) tape, read/write head, internal state and a list of rules based on the current internal state and the symbol on the tape rule tells which symbol to write to the tape, which internal state to switch to and whether to move one step left or one step right on the tape. I built a model of a Turing machine for the first exhibition from the series “Re-Making/Re-Mixing History” titled “Alan Turing Electronic Alchemist”“Alan Turing Electronic Alchemist” by RADIONA.ORGRADIONA.ORG makerspace.”