ScholarLens Back to search
2010•Microcomputer InformationRequires access

A Coding Method Universal Turing Machine

Liu Guang-zhi

Open publisher page 0 citations

Abstract

In order to simulate the all Turing machine with universal Turing machine, a method to encode the universal Turing machine based-on 0 and 1 is presented in this paper. In the first, we use the string of 0 and 1 to denote the Turing machine, secondly, encode the all symbols except the blank symbol with 0 and 1 and encode the state transfer function of Turing machine with 0 and 1. In fact, universal Turing just changes the express method of symbols and state transfer functions of Turing machine. Using the presented method, we can easily simulate the all Turing machine with universal Turing machine.

About this research paper

What this paper is about

In order to simulate the all Turing machine with universal Turing machine, a method to encode the universal Turing machine based-on 0 and 1 is presented in this paper. In the first, we use the string of 0 and 1 to denote the Turing machine, secondly, encode the all symbols except the blank symbol with 0 and 1 and encode the state transfer function of Turing machine with 0 and 1. In fact, universal Turing just changes the express method of symbols and state transfer functions of Turing machine. Using the presented method, we can easily simulate the all Turing machine with universal Turing machine.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to simulate the all Turing machine with universal Turing machine, a method to encode the universal Turing machine based-on 0 and 1 is presented in this paper. In the first, we use the string of 0 and 1 to denote the Turing machine, secondly, encode the all symbols except the blank symbol with 0 and 1 and encode the state transfer function of Turing machine with 0 and 1. In fact, universal Turing just changes the express method of symbols and state transfer functions of Turing machine. Using the presented method, we can easily simulate the all Turing machine with universal Turing machine.

Key concepts: Universal Turing machine, Turing machine examples, Turing machine, Super-recursive algorithm, Description number, Non-deterministic Turing machine, Computer science, Probabilistic Turing machine

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Coding Method Universal Turing Machine — Research Paper | ScholarLens