Math 206
|
||||
|
Ana sayfa / Home
Öğrenci Semineri / Students' Seminar
Takvim / Calendar 2003-2004 |
This course builds on Math 205 to give a grounding in the use of logic for mechanised theorem proving, and also deals with the issues of computability, suitable models for computation and the major outstanding question in computational theory, the P=NP problem. The course will include the following: Logic and resolution, theorem proving, relation to logic programming languages, Turing machines, computability, P=NP and NP-complete problems. Instructors:
|
|||