Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1238

Title: non-deterministic Turing machine
Issue Date: 6-Sep-2002
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/NonDeterministicTuringMachine.html
Abstract: The definition of a non-deterministic Turing machine is the same as the definition of a deterministic Turing machine except that delta is a relation, not a function. Hence, for any particular state and symbol, there may be multiple possible legal moves. If ... we say
URI: http://www.citidel.org/handle/10117/1238
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
NonDeterministicTuringMachine.html22KbHTMLView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback