|
Title:
|
|
Intro to Complexity Theory
|
|
|
|
Instructor:
|
|
Cezar Câmpeanu
|
|
|
|
Email:
|
|
ccampeanu < at > upei < dot > ca
|
|
|
|
Office:
|
|
CASS 408
|
|
|
|
Tel:
|
|
(902)566-0485
|
|
|
|
Course web site:
|
|
Go To: http://www.smcs.upei.ca/~ccampeanu, and follow the links Teaching, and CS4910 under Fall 2021, or go to http://www.smcs.upei.ca/, Then follow the links: Faculty Members, Cezar Câmpeanu, Personal webpage(under Island Scholar Biography), Teaching, and CS4910 under Fall 2021.
|
|
|
|
General description:
|
|
This course introduces formal languages, computability, and complexity. Topics include: formal languages, computability, complexity related to various computability models
|
|
|
|
|
|
Topics of the course - Mathematical Review
- Basic Concepts and Notations
- Formal languages; Chomsky hierarchy.
- Automata, Regular Expressions, and Regular Languages
- Rewriting systems
- Decidability, Computability, and Complexity
|
|
|
|
PREREQUISITE:
|
|
CS 2920 and Math 2420
|
|
|
|
|
|
No prerequisite waiver for those who failed the above courses. Do not insist on circumventing the SMCS rules.
|
|
|
|
Essential to review:
|
|
elementary symbolic computation(logarithms, trigonomery, polynomials, matrices, exponentials), induction, derivatives, order relations, comparing real valued functions, graph theory.
|
|
|
|
Time and Location:
|
|
web/office
|
|
|
|
To make sure you are viewing the most recent version of this page,press the shift key while clicking on the Reload button.
It is your responsibility to check this page for updates.