Current location - Training Enrollment Network - Mathematics courses - Is Allen Ling a math problem?
Is Allen Ling a math problem?
Alan turing is the father of mathematics and computer science. 1936, Turing submitted a paper entitled "On the application of numerical calculation in solving difficult problems" to the authoritative mathematics magazine in London.

Alan turing was born in London, England on 19 12. He has shown a high IQ since he was a child. At the age of three, he was able to teach himself. At the age of five, he wrote an observation composition about the microscope.

However, Turing's personality is extremely withdrawn and not good at expression, so Turing became the target of bullying in his youth. In this environment, there appeared a senior who changed Turing's life. The senior protected Turing and stopped others from bullying Turing. At the same time, this senior and Turing have the same hobbies. They are very interested in mathematics and science and often discuss this knowledge together.

Later 193 1 was admitted to King's College, Cambridge University. After graduation, I went to Princeton University to study for my doctorate. After the outbreak of World War II, he returned to Cambridge. Everyone knows what happened afterwards. Turing helped Britain crack the German "Ingmar" cipher machine, helped Britain win World War II and became a hero in the world.

As a famous mathematician, Turing has made great contributions to the development of computer technology and artificial intelligence.

For example, Turing once wrote a paper entitled "Computing Machine and Intelligence", which caused a great shock in the field of computer science. At the same time, Turing spent 40,000 pounds to successfully develop a computer, which was the fastest and most powerful computer in the world at that time, laying a solid foundation for later computer development.

Later, Turing put forward the question of "Can machines think" and designed the famous "The Imitation Game Test", which was later called "Turing Test".

The Present Situation of Mathematical Problems in alan turing

Marc Lackenby, a mathematician at Oxford University, found an algorithm that can judge whether a knot is an "ordinary knot" faster than any previous algorithm. This algorithm can judge whether the knot represented by the knot graph with crossing number n is an ordinary knot in the so-called "quasi-polynomial time".

Reference to the above content: Allen Matheson Turing-Baidu Encyclopedia