Can Computers Think
Can Computers Think
House cleaning robots ? But does this mean they are intelligent ?
Advertisement
Thinking Computer : Rs. 100,000
What is intelligence ?
Newell and Simon - the use and manipulation of various symbol systems, such as those featured in mathematics or logic Large debate in the AI, Psychology, Philosophy community
Alan Turing
British scientist
Helped solved the Enigma Machine (WWII) Advances in Probability Theory
Chinese Room
The system comprises:
a human, who only understands English a rule book, written in English two stacks of paper.
One stack of paper is blank. The other has indecipherable symbols on them.
In computing terms
the human is the CPU the rule book is the program the two stacks of paper are storage devices.
The system is housed in a room that is totally sealed with the exception of a small opening.
Eventually, the human will write some symbols onto one of the blank pieces of paper and pass these out through the opening.
Searles Claim
We have a system that is capable of passing the Turing Test and is therefore intelligent according to Turing. But the system does not understand Chinese as it just comprises a rule book and stacks of paper which do not understand Chinese. Therefore, running the right program does not necessarily generate understanding.
Strong AI
Strong AI is artificial intelligence that matches or exceeds human intelligence The intelligence of a machine can successfully perform any intellectual task that a human being can Advocates of "Strong AI" believe that computers are capable of true intelligence They argue that what intelligence is strictly algorithmic, i.e., a program running in a complex, but predictable, system of electrochemical components (neurons).
Strong AI
Many supporters of strong AI believe that the computer and the brain have equivalent computing power With sufficient technology, it will someday be possible to create machines that have the same type of capabilities as humans However, Strong AI's reduction of consciousness into an algorithm is difficult for many to accept Proponents are: Ray Kurzweil, Marvin Minsky etc.
Weak AI
The Weak AI thesis claims that machines, even if they appear intelligent, can only simulate intelligence They will never actually be aware of what they are doing Some weak AI proponents believe that human intelligence results from a superior computing mechanism which, while exercised in the brain, will never be present in a Turing-equivalent computer Roger Penrose is a proponent of Weak AI
Algorithms
The word comes from the Persian mathematician Abu Jafar Mohammed ibn Musa al Khowarizm He wrote a book
Kitab Al-jabr wal-muqabala
Example algorithm
Euclids algorithm for highest common factor of two numbers
Euclids algorithm
This is a systematic procedure that will work for any two positive integers
Hilbert's programme:
To establish the foundations of mathematics, in particular by clarifying and justifying use of the infinite: ``The definitive clarification of the nature of the infinite has become necessary, not merely for the special interests of the individual sciences but for the honour of human understanding itself.''
Aimed to reconstitute infinitistic mathematics in terms of a formal system which could be proved (finitistically) consistent, complete and decidable.
David Hilbert
(1862-1943)
Consistent: It should be impossible to derive a contradiction (such as 1=2). Complete: All true statements should be provable. Decidable: There should be a (definite, finitary, terminating) procedure for deciding whether or not an arbitrary statement is provable. (The Entscheidungsproblem)
There is the problem. Seek its solution. You can find it by pure reason, for in mathematics there is no ignorabimus.
Wir mssen wissen, wir werden wissen
Bertrand Russell
(1872-1970)
Alfred Whitehead
(1861-1947)
Russell's paradox showed inconsistency of naive foundations such as Frege's: {X | XX} "The set of sets which are not members of themselves" Theory of Types and Principia Mathematica (1910,1912,1913)
Kurt Gdel
(1906-1978)
Uber formal unentscheidbare Stze der Principia Mathematica und verwandter Systeme (1931)
Alan Turing
(1912-1954)
On computable numbers with an application to the Entscheidungsproblem (1936) Church, Kleene, Post
Turing machine
Imagine a device for carrying out a computational procedure (like Euclids algorithm) What is the general form such a machine can take ?
Machine should have discrete states (large but finite in number) Input/Output of unrestricted size Finite number of states implies cannot internalize the data
Tape ......
A Turing Machine
...... Read-Write head
Control Unit
28
The Tape
No boundaries -- infinite length
......
......
Example:
......
Time 0
a b a c
......
Time 1
a b k c
......
31
Blank symbol
......
a b a c
head
q1
a b, L
q2
Move Right
q1
a b, R
Adapted from slide by Costas Busch,
q2
33
36
The brains design is a probabilistic fractal Weve already created simulations of ~ 20 regions (out of several hundred) of the brain
37
The answer is No; there is no procedural method for answering the halting problem Human beings can do this by inspection
Does this imply human brain can perform non-computational procedures ? If so what is the mechanism ?
Penroses belief
There is some part of conscious thinking that cannot be simulated on a computer What is it in the physics of the world that cannot be controlled computationally ? Is quantum mechanics the answer ?
In quantum mechanics, a particle can be in two places at the same time Quantum wave function collapse happens when the particle is observed
Further readings
http://www.brainpickings.org/index.php/20 10/09/07/what-does-it-mean-to-be-human/