本文主要是介绍Turing Machine,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
Turing Machine
1. Definition
seven-tuple: P=(Q,Σ,Γ,δ,q0,B,F)
states, input symbols, tape symbols, transition fuctions, start state, blank symbol, final state
2. Language
The language accepted by TM is called recursively enumerable(RE) language.
3. Halt
We say a TM halts if it enters a state q, scanning a tape symbol X, and there is no move in this situation .
这篇关于Turing Machine的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!