University at Buffalo

UB Undergraduate Academic Schedule: Spring 2018


  • 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. Information about HUB can be found at www.buffalo.edu/hub


  • |

    CSE 396LR - Intro Theory Of Computatn
    Lecture
    Intro Theory Of Computatn 000 Enrollment Information (not real time - data refreshed nightly)
    Class #:   <<<  >>>   Enrollment Capacity:   220
    Section:   000   Enrollment Total:   0
    Credits:   4.00 credits   Seats Available:   220
    Dates:   01/29/2018 - 05/11/2018   Status:   OPEN
    Days, Time:   T R , 11:00 AM - 12:20 PM
    Room:   Knox 109 view map
    Location:   North Campus      
    Chained Courses
    You must register in one of the class(es) below to get the above section:
    Enrollment Requirements
    Prerequisites: Pre-Requisite: CSE 191 or MTH311 and CSE 250, and MTH142 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only
      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)
                 Regan, K W look up    
      On-line Resources
    Other Courses Taught By: Regan, K W