... 's belief that machines could be as intelligent as humans became stronger after Alan Turing, a British mathematician, wrote the first computer program for chess in 1947, and declared that machines would compete with humans in all purely intellectual fields including chess (36). Turing is a very respected innovator, so his declaration about machines with artificial intelligence encouraged next generation of innovators ... becoming better at performing their tasks. In 1997, the Deep Blue computer defeated the world champion, Garry Kasparov, in a classic chess match against computer for the...

• Word Count: 2656
• Approx Pages: 11
• Has Bibliography
• Grade Level: Undergraduate

... Gary Kasparov and "walking" away with a rating of 3200 compared to Kasparov's rating of 2800 in 1992 Deep Blue and its team proved a lot of people wrong. As sophisticated as chess is, Deep Blue took this game and developed a strategy with precise calculations. In any one turn Deep Blue would do a 20 billion-move search and move accordingly. Deep Blue "reduced ... chess to a problem in pure computation rather than one of judgment and intuition." In the counter argument to functionalism it is easy to see that Deep Blue is not a "living entity" ... but a very well programmed computer. The...

• Word Count: 2048
• Approx Pages: 8
• Grade Level: High School

... modifying or improving it.1 In summary of all this symbol scanning is a machine which can solve any solvable problem - and through this it may simulate human thought. Any modern computer is essentially a modified Turing machine. The question at the center of artificial intelligence is: "Are human beings also Turing machines?" Or more specifically: "Can human intelligence be simulated by ... even realize it. Between then and now, AI research has been largely confined to the academic and scientific world. In 1960, Joseph Wiezbaum of M.I.T. (Massachusetts Institute of Technology) developed...

• Word Count: 5546
• Approx Pages: 22
• Has Bibliography
• Grade Level: High School

... capabilities of humans and A.I. systems. In the Turing Test, a judge used a Teletype to communicate with two players in other rooms: a person and a computer. The judge would know the players only by anonymous labels, such as "player A" and "player B". The judge would then ask the players questions; and ... based on their responses would determine which player was a computer. The goal of A.I. is to pass the Turing test, but not imitate human behavior. So, what are some examples of A.I.? The most famous use ... of A.I. was when in 1997, Reigning chess champion Garry Kasparov played a che...

• Word Count: 345
• Approx Pages: 1
• Has Bibliography
• Grade Level: High School

... be possible to build artificial machines whose intelligence matches, and possibly even exceeds, that of humans. The study of artificial intelligence has provided better programming techniques for building smarter computer systems. Can computers become intelligent? Is this really possible and if so, how? Scholars of all fields both support and oppose the idea of intelligent computers but it ... has grown from a dozen researchers, to thousands of engineers and specialists; and from programs capable of playing chess, to systems designed to diagnose disease. AI has always been on the pioneeri...

• Word Count: 763
• Approx Pages: 3
• Grade Level: Undergraduate