CSE 350 - Spring 2009

Theory of Computation: Honors

Prof. Leo Bachmair

http://www.cs.sunysb.edu/~leo/cse350.html


Announcements


Course Description

Introduces the abstract notions of machine computation for honors students. Includes finite automata, regular expressions, and formal languages, with emphasis on regular and context-free grammars. Explores what can and cannot be computed by considering various models of computation, including Turing machines, recursive functions, and universal machines.

Prerequisites: CSE 150; CSE Honors Program or Honors College or WISE or permission of instructor


Course Information


Assignments


Examinations


Grading Schema

The course grades will be based on assignments and exams according to the following formula:


Instructor

Prof. Leo Bachmair
1427 Computer Science Building
Office hours: TuTh 12-1:45, W 11-12
Phone: (631) 632-8452
Email: leo (at) cs (dot) sunysb (dot) edu


Teaching Assistant

Supriya Garg
2110 Computer Science Building
Office hours: M 2-3 p.m.
Email: sgarg (at) cs (dot) sunysb (dot) edu


Meeting Time and Place


Student Support

If you have a physical, psychological, medical, or learning disability that may impact your course work, please contact Disability Support Services at (631) 632-6748 or here. They will determine with you what accommodations are necessary and appropriate. All information and documentation is confidential.

Students who require assistance during emergency evacuation are encouraged to discuss their needs with their professors and Disability Support Services. For procedures and information go to the following web site.


Page maintained by Leo Bachmair