|
CS 491
Foundations of Autonomous Systems
Fall 2016
|
[4/17/2016] Please sign up for this course on MyNevada! More to be posted soon.
If you're interested in getting ahead for the semester, please look at the
course's textbooks and related links which are posted below.
Instructor:
Richard Kelley
Lead Teaching Assistant:
Banafsheh Rekabdar
Head Teaching Fellow:
Duncan Wilson
Lectures:
MW 5:30PM-6:45PM. Located in:
SEM 234.
Discussion Section:
Date and location to be decided.
Important Email Addresses:
rkelley@unr.edu
rekabdar.b@gmail.com
duncanw@nevada.unr.edu
Prerequisites
Students are expected to have the following background:
- Knowledge of basic computer science principles and skills, (such as big-O notation, queues, stacks, graphs, etc.) at a level sufficient to write a reasonably non-trivial computer program. (think CS 302 weekly project level of difficulty)
- Familiarity with the discrete mathematics and proof techniques. CS 365, MATH 301, or equivalent class should prepare you.
- Mild interest in self-reference, music, the mind, Zen, aesthetics, language, experience, philosophy, computer science, and mathematics.
Textbooks
There are two required texts for the course: Notes and extra reading will be posted periodically on the course web site.
Material we are also considering including presented in no particular order:
A Course in Formal Languages, Automata and Groups.
The Aha Sessions with Knuth. The videos of the class (and other interesting videos) can be found here!
A Person Paper on Purity in Language by William Satire (alias Douglas R. Hofstadter).
Rudy Rucker and John Walker's Cellular Automata Laboratory. (also Stephen Wolfram's A New Kind of Science is a standard in CA theory)
Complexity: A Guided Tour by Melanie Mitchell.
Metamagical Themas: Questing For The Essence Of Mind And Pattern by Douglas Hofstadter.
Will robots see? by Stanley A. Klein.
Quantum Computing Since Democritus by Scott Aaronson.
Generalized Musical Intervals and Transformations by David Lewin.
Sipser's Introduction to Theory of Computation.(a gold standard for both clarity describing technical material and for CS theory itself)
Borges' Library of Babel.
George Pólya's How to Solve It.
Information and Handouts: