Deterministic Turing Machine. A simple computer whose input and output consist of an endless tape of 1s and 0s and whose instructions can be given in terms of a FSM. A DTM is theoretically (asymptotically speaking) as good as any other computer.
Log in or register to write something here or to contact authors.
Need help? firstname.lastname@example.org