SCXT 350
Exam #2 Review
Disclaimer: I have attempted to be comprehensive in the following,
but important items may have been omitted by mistake. If you see such
an omission, please let me know, but you are responsible for all of
the lecture material to date.
The second hour exam will be held on Friday, March 25. It will
cover
- Papers: Newell and Simon
- Textbook: Chapters 1 - 2
Be able to- Discrete state machines and Turing machines
- Be able to draw the graph associated with a given discrete state machine and, given some sample inputs, which would be accepted and which not (and why in either case).
- Be able to give a description of a Turing Machine
- Be able to state the (informal) Turing-Church hypothesis and say what it has to do with Cognitive Science.
- Artificial Intelligence
- Be able to say what AI is and describe some of the problems it is attempting to solve. Be particularly able to describe its connection to Cognitive Science
- GOFAI
- PSSH
- Be able to say what a physical symbol system is (Dawson has a nice
description)
- Be able to say what the physical symbol system hypothesis is and what
'sufficient' and 'necessary' mean in the context of the PSSH.
- Search
- Be able to define terms such as
- states (including start/initial and
final states)
- operators (and preconditions and post-conditions)
- heuristics
(and be able to give an example)
- means-ends analysis (in class Monday or Wednesday)
- productions
- Be able to describe and illustrate depth-first and breadth-first search
and heuristic search
There may be more, but I think that's it. If you have any questions,
please ask.