TURING REDUCTION

Domain	Definition
Math	A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic. (references)
Source: compiled by the editor from various references; see credits.

Anagrams: TURING REDUCTION

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "c-d-e-g-i-i-n-n-o-r-r-t-t-u-u"
	-2 letters: reintroducing.
	-3 letters: outintrigued, retrodicting, undercutting.
	-4 letters: cointerring, interdictor, introducing, outintrigue, reinducting.
	-5 letters: coenduring, countering, introducer, outgrinned, recounting, recruiting, reinducing, tincturing, undercount, unneurotic.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.