{-
 - A simple interpreter for a Turing machine
 - This is all the machinery for actually simulating the running of such a machine
 - It can move the tape, write to the tape, read from the tape
 - When run is supplied with a transition function and initial tape, it should output the final result of the TM
 - Each TM is assumed to transition to a special state Q "END", where the transition function will not be applied again, but the value of the tape at the current head and right will be returned
 - Run assumes that the TM starts on a special Q "START".
 - -}
-- Imports

--import Data.List

main :: IO ()
main = return ()
main :: IO ()
main = return ()
main = return ()