This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS103 HO#3 Introduction March 29, 2010 1 CS103 Mathematical Foundations of Computing Robert Plummer 3/29/10 Today What we will study and why How the course will be run Propositional logic Logic Induction Sets, Relations, and Functions Automata and Formal Languages Computability Theory Complexity Theory CS103 Mathematical Foundations of Computing 1 2 3 4 5 6 7 8 L o g ic I n d u c t io n S e t s , R e la t io n s , F u n c t io n s A u t o m a t a a n d L a n g u a g e s C o m p u t a b ilit y T h e o r y C o m p le x it y T h e o r y Number of Lectures 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Foundation Theory Number of Lectures Why Is CS103 Important? Proof skills Way of Thinking Foundations of CS Applications Programming Languages Compilers Circuit Design AI Cryptography Intellectually and Philosophically Interesting CS103 HO#3 Introduction March 29, 2010 2 Course Details Instructor: Bob Plummer Gates 178 Office hours M, W 3:30 5:00 or by appointment TAs: Mridul Aanjaneya Steven Elia Tyler Mullen Karl Uhlig "Working Office Hours" to be announced Online Course Support This quarter we will be using CourseWork to report grades, and our class website as a repository for handouts, announcements, etc. The website is http://cs103.stanford.edu We also have an email hotline that is closely monitored by course staff: cs103staff@gmail.com Textbooks 1. Custom book for Logic portion of the class Introduction to Theory of Computation, CS103. Instructor: Robert Plummer. Available at the Bookstore only 2. Text for the second part of the course Sipser, Introduction to the Theory of Computation, 2 nd Ed. Some course notes will also be distributed Midterm Tuesday, May 4, 7 9 pm Final Friday, June 4, 12:15 3:15 pm Locations to be announced Alternate exams are given on an individual basis and and only for emergencies or official university business Exams 9 written problem sets, counted equally Due in class 3 free late days (max. 1 on any assignment)3 free late days (max....
View
Full
Document
This document was uploaded on 02/08/2011.
 Fall '09

Click to edit the document details