Skip to Content
University at Buffalo

UB Academic Schedule: Summer 2022 (Session University 9 Week - First : May 31 - Jul 29)


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.

Departments may offer courses in many different sessions. The majority of summer courses are offered in the following sessions: Six Week-First, Six Week-Second, Six Week-Third and Twelve Week. You may want to begin your search for courses in these sessions.


|

CSE 396LR - Intro Theory Of Computatn
Lecture
Intro Theory Of Computatn L1 Enrollment Information (not real time - data refreshed nightly)
Class #:   12390   Enrollment Capacity:   33
Section:   L1   Enrollment Total:   32
Credits:   4.00 credits   Seats Available:   1
Dates:   05/31/2022 - 07/29/2022   Status:   OPEN
Days, Time:   F , 10:00 AM - 11:00 AM
Room:   Remote view map
Location:   Remote      
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)
             Murphy look up    
  On-line Resources
Other Courses Taught By: Murphy