Computing Machinery and Intelligence By A.M. Turing (Hindi/हिंदी में)

1. The Imitation GameTuring begins by bypassing the ambiguous question, "Can machines think?" because defining "machine" and "think" is too difficult and subjective. Instead, he proposes a practical substitute: The Imitation Game.In this game, there are three participants: a man (A), a woman (B), and an interrogator (C) who is separated from them. The interrogator’s goal is to determine which is the man and which is the woman. To complicate this, the man tries to deceive the interrogator, while the woman tries to help.Turing then modifies the game: What happens if a machine takes the place of the man? If the machine can fool the interrogator as often as a human being can, we should accept that the machine is intelligent. This test separates the physical capabilities of a human (like skin or voice) from intellectual capabilities.2. Digital Computers and UniversalityTuring defines the "machine" strictly as a Digital Computer. He explains that a computer consists of three parts: Store: Memory (like a human's paper or rulebook). Executive Unit: The part that performs calculations. Control: Ensures instructions are followed correctly.He introduces the concept of Discrete State Machines. While the physical world is continuous, computers operate in distinct steps (on/off). Turing argues that digital computers are Universal Machines. This means that given enough memory and speed, a digital computer can mimic the behavior of any other machine. Therefore, we do not need different machines for different tasks; one properly programmed computer can do it all.3. Contrary Views (Objections)Turing anticipates and refutes the major arguments against the idea that machines can think: The Theological Objection: The argument that God gives souls only to humans. Turing argues this limits God’s power; if God wishes, He could grant a soul to a machine just as He does to a human body. The "Heads in the Sand" Objection: The fear that machines will dominate humans. Turing dismisses this as a fear-based reaction that doesn't need a logical refutation. The Mathematical Objection (Gödel’s Theorem): Logic proves there are questions a specific machine cannot answer (limitations). Turing counters that human intellect is not proven to be error-free or unlimited either. We often make mistakes, so a fallible machine is not necessarily "unthinking." The Argument from Consciousness: Professor Jefferson argued that a machine cannot write a sonnet out of emotion. Turing uses a "viva voce" (oral exam) dialogue to show that if a machine can discuss its own writing intelligently, we must accept it thinks. To deny this leads to Solipsism (the belief that only I think, and everyone else is a machine), which is socially impractical. Arguments from Disabilities: Claims that machines can never "be kind," "enjoy strawberries," or "make mistakes." Turing argues these views come from limited experience with current, primitive machines. He also distinguishes between "errors of functioning" (broken parts) and "errors of conclusion." A thinking machine might make errors of conclusion (like humans). Lady Lovelace’s Objection: The claim that computers can only do what we order them to do; they cannot originate anything. Turing argues that machines often surprise their programmers. Furthermore, a machine can be programmed to learn, eventually doing things the programmer didn't explicitly plan. Argument from the Nervous System: The brain is continuous (analog), not discrete (digital). Turing argues that for the purpose of the Imitation Game (text-based), a digital machine can calculate and simulate the output of a continuous system accurately enough to fool a human.