|
CSE30151 Home Page
Description: Introduction to formal languages and automata, computability theory, and complexity theory. Text: Intro to the Theory of Computation, International, 2nd or 3rd Ed. (preferred), Michael Sipser with ERRATA Version 3. Classroom: Tusdays/Thursdays, 12:30-1:45, 101 Jordan Hall of Science Instructor: Prof. Peter Kogge 326A Cushing. Office Hours Mondays & Tuesdays 2-3pm TAs:
Course Details: See Administration Quiz Distribution
Honor Code: ND Honor Code. CSE Guide to Honor Code Final Exam: Friday, December 15 10:30 AM - 12:30 PM 101 Jordan Hall of Science
|
Tuesday: |
The Micron Automata Processor Chip. Video
Quantum Computing Quest Speaker: Jonathan Baker |
|
Thursday: |
Final Exam Review
Language Class Review Sheet |
|
Reading: | Chap. 7 | |
Assignments |
Project 3: Turing Machine Project (version 1) Due Tuesday Dec. 5, 11:59 pm EDT. See directory TestFiles for test files.
Homework 8 Due Thursday Dec. 7, noon. Project 4. Optional Combinator Project. For reference see Combinators Lecture and Book chapter on Combinators. See directory TestFiles for test files. Deadline midnight Wed Dec. 13 |
|
Other |
A Tikz tutorial. Thanks to TA Satyaki Sikdar
An on-line point and click State Diagram drawing program TM visual simulator in Excel |
Previous weeks calendars, including class, readings, and homework information, are on the Calendar page.
See Change Log for complete list
Copyright © Peter Kogge
2017 |