Turing machine encoding
= Turing machine encoding
{c}
{title2=$\operatorname{enc}(M)$}
A finite <string> describing a <Turing machine>'s states, <alphabets>, transition rules and designated initial and halting states. Standard encodings have a <decidable language> of valid descriptions. A syntactic property of an encoding need not be an <extensional property of programs>; for example, adding an unreachable state changes state count without changing the accepted <formal language>.