Document Type

Syllabus

Description

Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture.

Publication Date

Fall 2011

College

College of Engineering and Computer Science

Department

Computer Science

Course Number

CS/MTH 410/610


Share

COinS