Artificial Intelligence

Alan Turing





Alan Mathison Turing, OBE, FRS (23 June 1912–7 June 1954) was an English mathematician, logician, and cryptographer.
Turing is often considered to be the father of modern computer science. Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine. With the Turing test, he made a significant and characteristically provocative contribution to the debate regarding artificial intelligence: whether it will ever be possible to say that a machine is conscious and can think. He later worked at the National Physical Laboratory, creating one of the first designs for a stored-program computer, although it was never actually built. In 1948 he moved to the University of Manchester to work on the Manchester Mark I, then emerging as one of the world's earliest true computers.
During the Second World War Turing worked at Bletchley Park, Britain's codebreaking centre, and was for a time head of Hut 8, the section responsible for German naval cryptanalysis. He devised a number of techniques for breaking German ciphers, including the method of the bombe, an electromechanical machine that could find settings for the Enigma machine.






artificial intelligence: a definition






artificial intelligence [AI] is the science of making machines do things that would require intelligence [as] if done by [humans]

i agree..!!..

and

artificial intelligence: research areas

•Knowledge Representation
•Programming Languages
•Natural Language (e.g., Story) Understanding
•Speech Understanding
•Vision
•Robotics
•Machine Learning
•Planning
•………..

amazing and..hard!!

planning as a technical problem..

following(Tower of Hanoi) is famous problem in discrete mathematics

Most toy versions of the puzzle have 8 disks. The game seems impossible to many novices, yet is solvable with a simple algorithm

[edit] Simple solution
The following solution is a simple solution for the toy puzzle.
Alternate moves between the smallest piece and a non-smallest piece. When moving the smallest piece, always move it in the same direction (either to the left or to the right, but be consistent). If there is no tower in the chosen direction, move it to the opposite end. When the turn is to move the non-smallest piece, there is only one legal move

anyway.. this lecture was fun and good^^