Mid Term Papers Home  |  Join  |  Contact Us  |  Privacy Policy  |  Login  |  Logout
  Search Keywords:  


Acceptance Essays
American History
Anatomy
Animal Science
Anthropology
Arts
Astronomy
Aviation
Beauty
Biographies
Book Reports
Business
Computers
Creative Writing
Current Events
Economics
Education
Engineering
English
Environmental Science
Ethics
European History
Film
Foreign Languages
Geography
Government
Health
History
Human Sexuality
Legal Issues
Marketing
Mathematics
Medicine
Miscellaneous
Music
Mythology
Philosophy
Physiology
Poetry
Political Science
Politics
Psychology
Religion
Science
Shakespeare
Social Issues
Sociology
Speech
Sports
Supernatural
Television
Technology
Theater
Zoology

Artificial Intelligence

Below is a free term papers summary of the paper "Artificial Intelligence." If you sign up, you can be reading the rest of this term papers in under two minutes. Registered users should login to view this term paper.

Term Paper TitleArtificial Intelligence
# of Words1057
# of Pages (250 words per page double spaced)4.23
Artificial Intelligence

     Artificial Intelligence has been very highly debated and discussed since its emergence after World War II. My purpose in this paper is to present some of the major components of AI and to show arguments for and against its existence. Along the way I will insert my opinions and thoughts on AI and give my reasons for holding these thoughts as true.
     The current concept of AI relating to computers was first introduced by Alan Turing in the 1950s. He formed the basis of computing and designed the Turing Machine, which was one of the first models of a computer. A Turing Machine is a machine that consists of a long strand of tape with some square marks on it, a reading head, and something it outputs to. The reading head can move either back and forth and outputs a 0 if the spot is empty and a 1 if the spot has a square in it. This process is what a computer does. This is all that a computer does. It reads its code (the tape) and either activates an electrical pulse or does nothing. The code is in binary form, ex: 0110001111. The interesting thing about the Turing Machine is that this same process is very similar to the activation of neurons in the brain. Either the neuron fires or it doesn’t.
     Turing formed a theory in which he claimed that his machine could perform any computable action. This theory is unproven but is widely held as true, and has also not been disproved. The key word in his theory as relating to AI is computable. Computable doesn’t take into consideration time. Where as the number of rational numbers is computable; the number of real numbers is not because the number of irrational numbers is not computable. The formula to get every rational number is to divide every integer by every other integer. This is infinite but does compute every rational number. There is no formula that will find every irrational number. This is important because since a computer is a Turing Machine it can not do any thing that is not computable. Thus, if the human mind can do something that is not computable then a computer could not replace the human mind.
In John Searle’s essay he presents an argument against strong AI. His main point is that merely solving a problem doesn’t indicate an understanding of the problem. He gives an example, which is called the Chinese room. He shows that given certain information he could translate Chinese without understanding any Chinese.
Searle shows a major component lacking from AI today. This component i...

This is not the end of the termpaper! Register below to see the complete version of this term paper.

Membership Plans Credit Card Check
1 month membership
3 month membership
(You Save 50%)
6 month membership
(You Save 67%)

Home  |  Login  |  Logout  |  Join  |  Privacy Policy  |  Contact Us
Copyright © 2002-2007 Mid Term Papers. All rights reserved. This term papers website is used for research purposes only.
If you have forgotten your username or password, please click here.
If you like to cancel your account, please click here.

1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - 11 - 12 - 13 - 14 - 15 - 16 - 17 - 18 - 19 - 20 - 21 - 22