Skip to Content
University at Buffalo

UB Undergraduate Academic Schedule: Spring 2020


This information is updated nightly. Additional information about this course, including real-time course data, prerequisite and corequisite information, is available to current students via the HUB Student Center, which is accessible via MyUB.


|

CSE 396LR - Intro Theory Of Computatn
Lecture
Intro Theory Of Computatn R2 Enrollment Information (not real time - data refreshed nightly)
Class #:   14309   Enrollment Capacity:   40
Section:   R2   Enrollment Total:   25
Credits:   4.00 credits   Seats Available:   15
Dates:   01/27/2020 - 05/09/2020   Status:   OPEN
Days, Time:   M , 4:00 PM - 4:50 PM
Room:   Talbrt 103 view map
Location:   North Campus      
Chained Courses
Registering in the above section will automatically place you in the following class(es):
Enrollment Requirements
Prerequisites: Pre-Requisite: CSE 191 or MTH311 and CSE 250, and MTH142. Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only. Students must complete a mandatory advisement session with their faculty advisor.
  Course Description
Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness.
  Instructor(s)
             Staff      
  On-line Resources