Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: non-deterministic Turing machine
Issue Date: 6-Sep-2002
Publisher: PlanetMath
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
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

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