Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Computing machinery and intelligence


Related Topics

  
  computing machinery and intelligence - a.m. turing, 1950   (Site not responding. Last check: 2007-10-21)
The reader must accept it as a fact that digital computers can be constructed, and indeed have been constructed, according to the principles we have described, and that they can in fact mimic the actions of a human computer very closely.
The digital computers considered in the last section may be classified amongst the 'discrete state machines' these are the machines which move by sudden jumps or clicks from one quite definite state to another.
Intelligent behaviour presumably consists in a departure from the completely disciplined behaviour involved in computation, but a rather slight one, which does not give rise to random behaviour, or to pointless repetitive loops.
www.cse.msu.edu /~cse841/papers/Turing.html   (11062 words)

  
 COMPUTING MACHINERY AND INTELLIGENCE   (Site not responding. Last check: 2007-10-21)
Alternatively she can stick up a notice once and for all in the hall which he will see when he leaves for school and which tells him to call for the shoes, and also to destroy the notice when he comes back if he has the shoes with him.
I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 109, to make them play the imitation game so well that an average interrogator will not have more than 70 per cent chance of making the right identification after five minutes of questioning.
It would not be possible for a digital computer to predict exactly what answers the differential analyser would give to a problem, but it would be quite capable of giving the right sort of answer.
cogprints.org /499/00/turing.html   (10279 words)

  
 Turing test - Wikipedia, the free encyclopedia
Described by Alan Turing in the 1950 paper "Computing machinery and intelligence", it proceeds as follows: a human judge engages in a natural language conversation with two other parties, one a human and the other a machine; if the judge cannot reliably tell which is which, then the machine is said to pass the test.
Turing further replies that computers could still surprise humans, in particular where the consequences of different facts are not immediately recognizable.
Although they award an annual prize for the computer system that, in the judges' opinions, demonstrates the "most human" conversational behaviour (with A.L.I.C.E. being a recent winner multiple times, and learning AI Jabberwacky in second), they have an additional prize for a system that in their opinion passes a Turing test.
en.wikipedia.org /wiki/Turing_test   (2022 words)

  
 Computing machinery   (Site not responding. Last check: 2007-10-21)
The Association for Computing Machinery (ACM) is an organization devoted tobringing Computer Science students beyond the four walls of a classroom and into...
Association for Computing Machinery is a student chapter of a pre-professionalsociety on campus.
The Association for Computing Machinery, or ACM, was founded in 1947 as theworld's first scientific and educational computing society.
www.dentalsee.com /computing+machinery.html   (720 words)

  
 the Turing test and intelligence - abelard
The present chess computer programmes are essentially based upon principles laid out by Von Neumann[3], the only fundamental change has been the ever increasing speed of modern computer hardware with some minor software refinements.
Intelligence is not merely ‘there’ or ‘not there’, but presents on a continuum in which we are potentially able to make distinctions.
As such, intelligence may be regarded as inherent in every object down to the level of stimulus-response, or even the ‘equal’ and opposite reaction of Newton’s descriptions.
www.abelard.org /turing/tur-hi.htm   (3714 words)

  
 iEssay - Computing Machinery And Intelligence
Computing Machinery and Intelligence by A.M. Turing is an essay comparing the abilities of computers and the human mind.
He then asserts that digital computers can be built and have been built that “in fact mimic the actions of the human computer very closely”(p.438).
He also further proposes that a computer with an infinite capacity to store information could be constructed, in imitation of the unknown mental capacities of the hum....
www.iessay.com /essays/4-11263.html   (275 words)

  
 Philosophy- Squashed Turing- Computing Machinery and Intelligence - Condensed and Abridged
Alan Turing is the 'Father of The Computer'- a brilliant original thinker who studied subjects from philosophy and psychology through to physics, chemistry and biology.
The digital computer may be classified amongst the "discrete-state machines." These are the machines which move by sudden jumps or clicks from one quite definite state to another.
The special property of digital computers, that they can mimic any discrete-state machine, is described by saying that they are universal machines, with the important consequence that, considerations of speed apart, it is unnecessary to design various new machines to do various computing processes.
www.btinternet.com /~glynhughes/squashed/turing.htm   (3901 words)

  
 Encyclopedia: Computing machinery and intelligence   (Site not responding. Last check: 2007-10-21)
Alan Turing is often considered the father of modern computer science.
Artificial intelligence This is not the name for a single subject, but rather for a number of theories, which are dependant on the context of need of the current case.
The Turing test is a proposal for a test of a machines capability to perform human-like conversation.
www.nationmaster.com /encyclopedia/Computing-machinery-and-intelligence   (191 words)

  
 Computing Machinery and Intelligence A.M. Turing   (Site not responding. Last check: 2007-10-21)
We have mentioned that the "book of rules" supplied to the human computer is replaced in the machine by a part of the store.
It is not normally possible to determine from observing a machine whether it has a random element, for a similar effect can be produced by such devices as making the choices depend on the digits of the decimal for π.
Even when we consider the actual physical machines instead of the idealized machines, reasonably accurate knowledge of the state at one moment yields reasonably accurate knowledge any number of steps later.
www.cs.pomona.edu /~marshall/papers/TuringArticle.html   (10566 words)

  
 AI from TAU - Useful Links
IEEE Annals of the History of Computing (The full text of Annals is available to Computer Society members).
Computational Science Education Project.An electronic book for teaching Computational Science and Engineering.
CMU Artificial Intelligence Repository - A very rich collection of files, programs and publications of interest to Artificial Intelligence researchers, educators, and students.
www.tau.ac.il /humanities/philos/ai/links.html   (928 words)

  
 Alan Turing Scrapbook - Turing Test
As part of his argument Turing put forward the idea of an 'imitation game', in which a human being and a computer would be interrogated under conditions where the interrogator would not know which was which, the communication being entirely by textual messages.
What he claimed was that with intelligence, as opposed to sex, imitation is as good as the real thing.
Turing's democratic and open approach to 'testing' intelligence is one that everyone is invited to share in and respond to.
www.turing.org.uk /turing/scrapbook/test.html   (1357 words)

  
 A. M. Turing's "Computing Machinery and Intelligence," annotation by Michelle Yacht   (Site not responding. Last check: 2007-10-21)
He defines the digital computer to be those machines “intended to carry out any operations which could be done by a human computer.
Instead of programming into a computer every little nugget of human knowledge and understanding, and the relations between, Turing argues that a program must be written that directs a computer to learn.
Turing defines the digital computer as that machine whose explicit purpose is to mimic, i.e.
www.chicagoschoolmediatheory.net /annotations/turing.htm   (581 words)

  
 Turing, `Computing Machinery and Intelligence’
They imply that there is no machine such that it can answer all yes/no questions correctly (that is, that for any machine there are some yes/no questions it can’t answer correctly).
His model of the mind is of something with “with little mechanism and lots of blank sheets”.
The advantage of bringing up the computer as a child is that the programmer doesn’t have to try to enumerate in advance everything that the machine ought to know.
www.uab.edu /philosophy/faculty/ross/PHL_372_Turing.htm   (289 words)

  
 Commentary on Turing's ``Computing Machinery and Intelligence''
Turing's aim was to refute claims that aspects of human intelligence were in some mysterious way superior to the artificial intelligence that Turing machines might be programmed to manifest.
The underlying question is about the limits of ``algorithmic intelligence'', whether all reasoning is in accordance with some rule or other---whether, that is, to be reasonable is to be acting in accordance with a rule---or whether some exercises of reason go beyond anything covered by antecedent rules.
So seeming novelty in human intelligence might be algorithmic in some wider system after all; and, even if not already algorithmic, there would be some machine that could be built incorporating the apparently novel move.
users.ox.ac.uk /~jrlucas/Godel/turitest.html   (1488 words)

  
 Citations: Analysis of Discrete Event Coordination - Kurshan (ResearchIndex)   (Site not responding. Last check: 2007-10-21)
In this paper, we use the term interesting witness to mean a computation path showing one non trivial example of the truth of the formula.
Events are emitted by a CFSM or by the environment where the system operates and can be detected some time later by one or more CFSMs or by the environment.
A witness can be computed in exactly the same manner as in the last section.
citeseer.lcs.mit.edu /context/5549/0   (5726 words)

  
 BBC NEWS | Magazine | Has text-porn finally made computers 'human'?
But a good case can be made for regarding all three as some of the smartest artificial intelligences around.
The machine would be judged intelligent if it could trick a human into thinking they were swapping text with another person.
The next candidate for smartest machines are the computer controlled opponents, or 'bots, found in many computer games.
news.bbc.co.uk /1/hi/magazine/3503465.stm   (840 words)

  
 Citebase - Computing Machinery and Intelligence
Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable.
The new field of hypercomputation studies models of computation that can compute more than the Turing machine and addresses...
Searle implements a computer programme that can pass the Turing Test in Chinese.
www.citebase.org /cgi-bin/citations?id=oai:cogprints.soton.ac.uk:499   (809 words)

  
 Turing Test
Perhaps machine intelligence is simply different from human intelligence and trying to evaluate it in human terms is a fundamental mistake.
A narrower concept of a Turing test is for a computer to successfully imitate a human within a particular domain of human intelligence.
The authors, who consider Turing to be one of the greatest scientists of the 20th century, examine problems with the Turing Test and conclude that a goal of passing the test is harmful to the field of AI research.
www.aaai.org /AITopics/html/turing.html   (2659 words)

  
 Intelligence   (Site not responding. Last check: 2007-10-21)
Agency tasked with unifying criminal intelligence units of Canadian law enforcement agencies in the fight against the spread of organized crime in Canada.
Computational Intelligence: journal information, contents lists and abstracts on the Blackwell Publishing website.
Established in 1993, the National Drug Intelligence Center (NDIC) is a of the US Department of Justice and a member of the Intelligence Community.
mortgage-rate.allworldsites.com /q/mortgage-rate-intelligence.htm   (784 words)

  
 Peter Suber, Links for "Minds & Machines"
See Hippias searches on artificial intelligence, artificial life, the Chinese room, and the Turing test.
These are links to the topics of the course and the larger fields to which they belong —artificial intelligence, cognitive science, neuroscience, and philosophy of mind.
Co-sponsored by the Association for Computing Machinery, the Los Alamos E-print Archive, and the Networked Computer Science Technical Reference Library.
www.earlham.edu /~peters/courses/mm/mmlinks.htm   (733 words)

  
 computing machinery and intelligence - a.m. turing, 1950
On computable numbers, with an application to the Entscheidungsproblem (Turing)
Computing machinery and intelligence was published by Alan Turing in 1950.
A M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem
www.abelard.org /turpap/turpap.htm   (11247 words)

  
 Open Directory - Society: Philosophy: Philosophy of Mind   (Site not responding. Last check: 2007-10-21)
Computing Machinery and Intelligence - The classic 1950 article by Alan Turing on machine intelligence, where he introduces the famous Turing test.
Stanford Encyclopedia - The Computational Theory of Mind - The philosophical theory that the mind is, or functions like, a computer; by Steven Horst.
Stanford Encyclopedia of Philosophy - The Turing Test - Proposal due to Alan Turing for a criterion of the presence of mind or consciousness; by Graham Oppy and David Dowe.
dmoz.org /Society/Philosophy/Philosophy_of_Mind   (1271 words)

  
 CSE 4/510 & PHI 498, Spring 2004, Phil. of Comp. Sci.: Philosophy of AI
Simon, Herbert A. "Computer Science as Empirical Inquiry: Symbols and Search", Communications of the ACM 19(3) (March): 113-126.
Abstract: The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended.
Some arguments of James H. Fetzer against computationalism are examined and found wanting, and his positive theory of minds as semiotic systems is shown to be consistent with computationalism.
www.cse.buffalo.edu /~rapaport/510/philai.html   (585 words)

  
 philosophy: philosophy-of-mind Spirit And Sky
Host of the Tucson "Toward a Science of Consciousness" conferences, and periodically stages on-line courses on aspects of Consciousness Studies.
The classic 1950 article by Alan Turing on machine intelligence, where he introduces the famous Turing test.
A comprehensive and up-to-date collection of terms, definitions, and scholarly works on the topic of Philosophy of Mind that provides useful background material for the study of artificial intelligence theory.
www.spiritandsky.com /philosophy/philosophy-of-mind/index.html   (582 words)

  
 Cogprints - The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence   (Site not responding. Last check: 2007-10-21)
Harnad, Stevan (2004) The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence, in Epstein, Robert and Peters, Grace, Eds.
Moreover, any dynamic system (that we design and understand) can be a candidate, not just a computational one.
Journal of Theoretical and Experimental Artificial Intelligence 1: 5-25.
cogprints.org /3322   (494 words)

  
 Search Tuna Report for test   (Site not responding. Last check: 2007-10-21)
Description: Queendom offers online psychological tests on personality, intelligence, career, health and relationships, plus trivia quizzes, live chat, free psychological counseling, and articles on mental and women's health.
We decided to do this test last, because we killed a lot of Twinkies during these experiments, and didn want to know before the other tests were over if they were sentient....
Some Challenges And Grand Challenges For Computational Intelligence, Edward Feigenbaum, Journal of the ACM JACM, 2003, 50 1....
www.searchtuna.com /ftlive2/966.html   (1332 words)

  
 CS/ENGRI 172, Summer 2003: Computing, Information, and Intelligence   (Site not responding. Last check: 2007-10-21)
An introduction to computer science using methods and examples from the field of artificial intelligence.
Topics include game playing, search techniques, learning theory, compute-intensive methods, data mining, information retrieval, the Web, natural language processing, machine translation, and the Turing test.
Most, but not all, handouts will also eventually be made available here.
www.cs.cornell.edu /Courses/cs172/2003su   (410 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.