SCXT 350
Exam #3 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 third hour exam will be held on Friday, Dec. 6. It will
cover
- Papers
- Copeland Chapters 6, 9, 10
- Course Notes (clips.ppt, neural.ppt)
- Clips
- Grammars and computability
- Basic neural networks
Be able to
- Describe the architecture of an expert system
- Describe what rules are in an expert system and how they might
be used.
- Be able to write basic Clips templates, deffacts, and rules
- Use basic grammars to generate and parse expressions
- Describe and use a finite state automaton, including
- Sketching and using a sketch of a FSA
- Creating and using a state transition table for a FSA
- Using a grammar for a FSA
- Describe a PDA
- Give a description of Turing machines and be able to run a simple program.
- Describe the Chinese Room thought-experiment and say what it
is intended to demonstrate.
There may be more, but I think that's it. If you have any questions,
please ask.