请输入您要查询的字词:

 

单词 NondeterministicTuringMachine
释义

non-deterministic Turing machine


The definition of a non-deterministic Turing machine is the same as the definition of a deterministic Turing machine except that δ is a relationMathworldPlanetmath, not a function. Hence, for any particular state and symbol, there may be multiple possible legal moves.

If SΓ+ we say T accepts S if, when S is the input, there is some finite sequencePlanetmathPlanetmath of legal moves such that δ is undefined on the state and symbol pair which results from the last move in the sequence and such that the final state is an element of F. If T does not accept S then it rejects S.

An alternative definition of a non-deterministic Turing machine is as a deterministic Turing machine with an extra one-way, read-only tape, the guess tape. Then we say T accepts S if there is any string c(S) such that, when c(S) is placed on the guess tape, T accepts S. We call c(S) a certificate for S, and otherwise that it rejects S. In some cases the guess tape is allowed to be two-way; this generates different time and space complexity classesPlanetmathPlanetmath than the one-way case (the one-way case is equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath to the original definition).

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 8:32:32