Posts
Alan Mathison Turing (born 23 June 1912 – died 7 June 1954) was an
English mathematician, computer scientist and cryptologist. He is
considered the founder of computer science by RaillyNews.
Who is Alan Turing?
With the Turing test he developed, he put forward a criterion for whether machines and computers can have the ability to think.
II. He was considered a war hero because he played a crucial role in cracking German codes during World War II. In addition, during his years at Manchester University, he laid the conceptual basis of modern computers with the definition of an algorithm called the Turing machine.
His name also went down in the history of mathematics with the Church-Turing Hypothesis he developed with his thesis teacher Alonzo Church, whom he worked with at Princeton. This thesis states that all calculations that can be described by an algorithm consist of calculations that can be described by four operations, projection, articulation and scanning operations. It is an undisproved hypothesis about the philosophy of mathematics rather than a mathematical theorem...
University and his work on computabilityTuring's unwillingness to study classical Greek and Latin, and his always preferred mathematics and science, prevented him from winning a scholarship to Trinity College, Cambridge. He went to Cambridge Kings College, his second choice. He was a student there from 1931 to 1934, earned a diploma with a distinguished honor, and was elected an academic member of Kings College in 1935 for a dissertation on the central limit theorem.
In a very important article, Computable Numbers: An Application to the Problem of Decision Making, presented on May 28, 1936, Kurt Gödel reformulated the results of proofs of limits of computation and proof prepared in 1931 with the universal arithmetic-based formal language, replacing it now as Turing machines He put forward the proof that we have mentioned, based on simpler and more formal methods. He proved that any mathematical problem imaginable can be solved using such a machine, if it can be represented by an algorithm.
Turing machines are the main research element of today's theories of computation. He went on to prove that the Termination Problem for Turing machines is undecidable, and that it is not a consequence of the Decision-Making Problem: in general, it is not possible to decide, even if an algorithmically presented Turing machine always terminates...
Various events are held in England and in various parts of the world, especially in universities, with the aim of perpetuating the memory of Turing, and special halls, buildings and squares in faculties and campuses are called Turing. For example, a scientific symposium with international participation called 'Turing Days' is organized every year at Istanbul Bilgi University. The aim of the meeting is to create a platform where new trends and developments in 'Computation Theory and Computer Science' are discussed and introduced in international circles.
Source: RaillyNews
