Anonymous user
Universal Turing machine: Difference between revisions
m
→{{header|Haskell}}
mNo edit summary |
|||
Line 835:
<lang haskell>
import Control.Monad.State
import Data.List (intersperse, nub, find)
data TapeMovement = MoveLeft | MoveRight | Stay deriving (Show, Eq)
Line 890:
let (pos, currentState, tape) = current m
item = tape !! pos
(i == item || i == noOpSymbol
return $! find isValid (rules m)
msgToLog :: a -> UTM a ()
|