Start With The Turing Machine

WHO IS TURING?

Alan Mathison Turing was born on June 23, 1912, but quenched on June 7, 1954. He is British mathematician and logician, known as the father of computer science and the father of artificial intelligence. I believe that he has been be our idol in Computer industry.

In this paper, I don’t prepare to dwell on Alan Turing’s a life, which seems to be a historist’s assignment, If you finish reading my paper and are conquered by Turing’s talent, I recommend you to read some other biographies such as 《Alan Turing》 writen by Andrew hodges, or Charles’ 《The secret of Turing: the interpretation of his life, thoughts and papers》and so forth.

THE BACKGROUND BEHIND TURING MACHINE

There is a line in the Turing’s paper, “This will include a development of the theory of functions of a real variable expressed in terms of computable numbers.” According to my understanding, the paper << ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM >> put forward a model to compute the number by a machine(a-machine).

TEST OF TURING MACHINE

EXAMPLES OF COMPUTING MACHINES

SIMPLE

You may had a problem the same with me when I once touched the example of computing machines above. I confused by the authors’ design that the numbers of the m-config are four but not two lead to a inconceivable outcome that the outputs of the machine would be “0 1 0 1…” rather than “010101…”.

I was quickly aware of that these details do not influence author’s purpose to define the computing machines and clarify their operation theory. Moreover, Turing attempted to compare it with the next explaination as follows.

COMPLEX

We will attempt to acquire a sequence as “001011011101111011111…” with the computing machine. The table as follows provided us with the details about how to operate.

The calculation process and results are as follows:

ENUMERATION OF COMPUTABLE SEQUENCES

The following, we’ll abstract the form:

THINK

In fact, Turing’s paper shows us not just what I wrote above. I completed to clarify the first a-machine’s operational theory and also present the process of how author abstracted the overcomplicated form to standard rules.

Due to the limited time, I’m too late to read the later part of Turing’s paper. Although, I has been conquered by the clever design of the computing machine. Besides, I realized that Turing machine’s development cannot do without the process from concrete to abstract.

At that end, I have a burning desire somebody forwardly connect with me to discuss whatever you focuse on the areas of technology. My wechat’s number is 15728442542.

REFERENCE:

Turing’s paper <<ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM >>link.