Computability and Complexity CMPT 308 (3)
This course introduces students to formal models of computations such as Turing machines and RAMs. Notions of tractability and intractability are discusses both with respect to computability and resource requirements. The relationship of these concepts to logic is also covered. Prerequisite: MACM 201.
Mo, We, Fr 2:30 PM – 3:20 PM
REMOTE LEARNING, Burnaby