Alan Turing was a British mathematician and logician.Alan Turing, the father of computer science, made many contributions, both practical (deciphering codes during World War II) and theoretical (Turing machines). A pioneer in the world of computer science.
Turing set about to give a formal definition of what it means to be computable.(Strawn,2014),Alan Turing's paper "On Computable Numbers, with an Application to the Entscheidungsproblem" In his paper, Turing describes a hypothetical computing machine, exploring its functionality and inherent limitations, thus establishing the basis for modern programming and computability.(Petzold, 2008)Computers were created to solve mathematical problems yet are based on mathematics. Turing though proved that no machine could solve all mathematical problems and that machines can do all the computational work that humans can do The work of Alan Turing, a British scientist, who drew a boundary for computers. This boundary is that computers can solve problems that can be computed in a finite number of steps and that clearly lead to results. With this boundary, computers moved from theoretical to practical.(Teuscher, 2013)Turing left behind an ambitious idea of artificial intelligence,The tester is separated from the tested (a person and a machine) and the tester enters text through a device such as a computer keyboard. If more than 30% of the testers cannot determine whether the tested is a person or a machine, then the machine passes the Turing test and is considered to have artificial intelligence Theoretical work by Turing on computer problems and other problems such as artificial intelligence remains the basis for computing, artificial intelligence and modern cryptographic standards.(Peralta, 2022) Turing hopes that machines will eventually be able to compete with humans in all areas of pure intelligence.
Turing also introduced the concept of the Turing machine with, in 1936, an abstract model of computing that abstracts the process of mathematical operations performed by people using paper and pencil and replaces them with a virtual machine. A Turing machine operates in such a way that the program and its input can first be saved on a memory tape, and the Turing machine runs step by step through the program until it gives a result, also stored on the tape. This proved the theory of universal computing and confirmed the possibility of computer implementation; the Turing machine model also introduced the concepts of reading and writing and algorithms and programming languages, giving the main architecture of what a computer was supposed to be.