CS 1502 Formal Methods in Computer Science

Description

The course is an introduction to the theory of information and computation as a physical phenomenon. The course covers standard formalizations of computational concepts and proofs of noteworthy implications of these formalizations. Typical topics include: finite automata, computability, reducibility, and complexity. [Effective 2164]

  • Credits: 3

Prerequisites

Requirements and Grading

Current Sections

Spring 2019

Class No.
Days
Times
Room
Instructor(s)
TA(s)
Type
Session
Writing
Class No.: 27397 (1060)
Days: TuTh
Times: 1:00 pm - 2:15 pm
Room: LAWRN 106
Instructor(s): T. Kosiyatrakul
TA(s):
Type: LEC
Session: AT
Writing:
Class No.: 27441 (1200)
Days: TuTh
Times: 4:00 pm - 5:15 pm
Room: IS 404
Instructor(s): M. Bender
TA(s):
Type: LEC
Session: AT
Writing:
Class No.: 29775 (1210)
Days: MW
Times: 11:00 am - 12:15 pm
Room: LAWRN 209
Instructor(s): T. Kosiyatrakul
TA(s):
Type: LEC
Session: AT
Writing:

Future Sections

Please click the headings below to view the hidden sections.

Past Sections

Please click the headings below to view the hidden sections.