2010exer1 - TAMPERE U NIVERSITY OF T ECHNOLOGY Department...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: TAMPERE U NIVERSITY OF T ECHNOLOGY Department of Software Systems OHJ-2556 Artificial Intelligence prof. Tapio Elomaa Exercises 1 Spring 2010 1. Every year the Loebner prize is awarded to the program that comes closest to passing a version of the Turing test. Research and report on the latest winner of the Loebner prize. What techniques does it use? How does it advance the state of the art in AI? 2. Is the intelligent agent approach chosen in the textbook sufficient for describing all real-world phenomena? Which are the cases that support the approach? Which points, on the other hand, speak against it? 3. A neuron is a threshold unit that fires (is “on”) if the sum of its inputs is larger than its threshold value. The inputs come from other neurons or as external input. Let a neuron have binary states (0 or 1). The value that an edge transmits is the state of the start neuron × the weight of the edge. Logical variables take on binary values: 1 (true) or 0 (false). Design neuron networks implementing logical connectives and, or, exclusive-or (a.k.a. xor denoted ⊕: 0 ⊕ 0 = 0, 0 ⊕ 1 = 1, 1 ⊕ 0 = 1 and 1 ⊕ 1 = 0), and not when there are two or three logical variables (one in case of not). You may give real values to the weights of edges and thresholds in neurons. 4. Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side, without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place. (a) Formulate the problem precisely, making only those distinctions necessary to ensure a valid solution. Draw a diagram of the complete state space. (b) Implement and solve the problem optimally using an appropriate search algorithm. Is it a good idea to check for repeated states? 5. Describe a state space in which iterative deepening search performs much worse than depth-first search (for example, O(n2 ) vs. O(n)). ...
View Full Document

This note was uploaded on 04/23/2010 for the course QWE asd taught by Professor Asd during the Spring '10 term at University of Karachi.

Ask a homework question - tutors are online