SCXT 350

 

 

 

 

Hour Exam #3

 

 

 

 

 

Name_______________________________________

 

 

 

 

 

Friday, Dec. 1

100 pts.

 

 

 

 

 

 

 

Important note:  Because of an unusually busy end of semester, I regret that I will be unable to have these exams graded before Friday, Dec. 8.  I will shortly post a list of office hours for reading period and for Final Exam week.  I apologize for the inconvenience.

 

                                                                                                                        -Bob


 

I.                     Expertise

 

a.         (10 pts.)          Describe the architecture of an expert system, labeling the individual parts.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

b.         (5 pts.)            Long-term knowledge in an expert system is contained in the form of productions, sometimes known as rules.  Taking an exam is an expert task.  Give (informally, not in CLIPS form) an example of a non-trivial rule that you use in figuring out which problem on an exam to work on next.


II.          Memory

 

(15 pts.)          In his lecture, Professor Mark Reinitz gave us a basic model for memory with three major sub-systems.  Please list those memory subsystems, say in what order they are used in the process of committing to memory something for later retrieval (such as learning lines for a play). 

 


III.                  Computation, the commitment to Symbolic AI, and a strong argument against.

 

a.         (10 pts.)          One of the commitments of cognitive science (or, at least, the part of it we have been studying this term) is that intelligent action is computable.  What role does the Turing-Church hypothesis play in this?  (i.e., what is the Turing-Church hypothesis, and why is it important to CogSci?)

 

 

 

 

 

 

 

 

 

 

 

b.         (10 pts.)          Given the grammar for expressions:

 

            E -> E + T | E – T | T

            T -> T * F | T / F | F

            F -> a | b | c | ( E )

 

            Give a parse tree for the expression

 

                        (a + b) / c

 


c.         (10 pts.)          Consider the Finite State Automaton described by the following table:

 

In state

Character

Go to state

1

a

2

2

b

2

2

c

3

 

            The automaton starts in state 1, and state 3 is a final state (remind me to draw a picture of this on the board).

 

            Give an example of a string of characters (using the characters a, b, and c) that the automaton accepts, and an example of a string of characters that it does not accept (saying why it will not be accepted).

 


d.         (10 pts.)          What are the elements of a Turing Machine?

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

e.         (15 pts.)          State the Physical Symbol System Hypothesis and give a brief description of it as you would describe it to a friend.


f.          (15 pts.)          Give a description of Searle’s “Chinese Room”.  What takes place there?  In what way does this attack symbolic AI?