Share This
Computer Science

CSc 30400 - Introduction to Theoretical Computer Science

Description

Finite state automata, pushdown automata, Turing Machines, and the languages they can recognize. Church’s Thesis. Computibility. The classes P and NP; NP-complete and intractable problems.

Prereq: CSc 10400. 3 hr./wk.; 3 cr.