Oct 14, 2024  
2020-2021 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  The University
  Academic Advisement, Progression and Support Services
  Academic Regulations
  Admission and Readmission
  Colleges/Schools and Associated Programs
  Certificates, Degrees and other Undergraduate Programs
  Courses
  Distance Education/ECU Online
  Expenses and Financial Assistance
  General Education Program
  Scholar, International, and Leadership Programs
  Student Affairs
  What’s New This Year?
  Academic Calendars
  Archived Catalogs
  Campus Map
  Faculty Emeriti
  Graduate Catalog
  University Policies
HELP
2020-2021 Undergraduate Catalog [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CSCI 4602 - Automata, Computability and Complexity

3 F

P: CSCI 2405 , CSCI 2530 . Examination of finite automata and regular languages. Includes Turing machines, the Church-Turing thesis, computability and unsolvability, complexity, and the theory of NP-completeness.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)