Alan Turing’s “Computing Machinery and Intelligence”

  1. [5 marks] Read Alan Turing’s “Computing Machinery and Intelligence” – you can find it here https://www.csee.umbc.edu/courses/471/papers/turing.pdf and answer the following questions. Is the “imitation game” a good test for machine intelligence? Discuss why or why not? (you should read other sources including John Searle’s description of the Chinese Room at http://plato.stanford.edu/entries/chineseroom/) 2. [5 marks] If you were going to design a test for intelligence, what attributes would you test and why? Discuss why you think these attributes would be a good indicator of intelligence. 3. [5 marks] Consider the following 1 D cellular automata. Assume the only ON cells are shown (Xs) and that the grid is infinite in size. X X X X Using the rule table below, fill in the missing five generations of the above CA. Left neighbour Current cell Right neighbour Result 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 4. [5 marks] Assuming that we are using Moore’s neighbourhood, complete the rule set that will transform this 2-D CA from the Current Generation to the Next Generation. Current Generation Next Generation X X X X X X X X X X X X X X X – If the number of ON neighbours is exactly _______________, then the cell maintains its current state – If the number of ON neighbours is exactly ________________ , then the cell will be ON in the next period regardless of its current state –If the number of ON neighbours is any other number then the cell will be OFF in the next period 5. [5 marks] Consider the following Margolus Rule: MS, D 0; 14; 11; 5; 10; 6; 9; 7; 8;15; 1; 2; 13; 3; 12, 4. Using the chart in your notes, show the next generation of the given pattern and state if the rule is reversible. Start with the 4-cell block in the top left corner. Current Generation Next Generation X X X X X X X X X X X X X X X X X X X X X X X X X 6. [10 marks] Cellular Automata are basically collections of simple finite state machines. Briefly describe 5 other examples of finite state machines and their uses.