Turing machine
Turing machine (British:) Turing Machine) It is simplification / an idealized virtual machine to argue with a computer in the one of the calculation models mathematically. M recognizes L that M recognizes L in computational complexity [computational complexity between - sky] t for representation t from natural number to natural number more minutely in time and says that [quantity of - area] is equal to or less than it for execute time of each M which I resemble it, and face it. I express length of character string x here. As for the language that is induction possible counting up, the influence on computational complexity and space computational complexity is small again in time even if they give Sadayoshi mentioned above a change about each next item without changing. On this account the details of the definition of the Turing machine are different by documents. When I examine space computational complexity finely, I establish the tape for exclusive use of the input that I renew it, and is not possible, and there is a thing ignoring the quantity of use domain there. In other words I sentence you to transition function representation and change the definition of the situation adequately. I can think about a machine calculating partial function f to Σ from Σ not only I recognize a language. In other words machine M each; move to an acceptance state for the first time since wrote character string f(x) in the tape when is similar, and face each other, and never move to an acceptance state when resemble it, and face it. When there is such M, it is said that f is of the partial induction or computability (computable). I change a definition of δ and do it non-crucially. Furthermore, I change a meaning of the acceptance, and a non-conclusiveness Turing machine and a Turing machine are defined. I increase a question state. Surprisingly I can make up a Turing machine (universal Turing machine) reproducing the movement of all Turing machines by constituting a transition rule well. The universal Turing machine reads the input symbol line of given another Turing machine and I obey it and move. In addition, it is proved that all Turing machine is all-around Turing machine. In other words it means that I answer the purpose only in one the computer architecture eventually.