paper-tape Turing machine

Share on Facebook Share on Twitter Email
Top
(′pā·pər ¦tāp ′tu̇r·iŋ mə′shēn)

(computer science) A variation of a Turing machine in which a blank square can have a nonblank symbol written on it, but this symbol cannot be changed thereafter.


Post a question - any question - to the WikiAnswers community:

Copyrights: