CSCI 356
Theory of Computing
Lec 10, Lec 10 and Lec 10 selected
An introduction to the theoretical foundations of computer science, examining finite automata, context-free grammars, Turing machines, decidability and undecidability, and complexity theory. Strategies will be developed to help categorize problems as tractable or intractable.
Sections
Lecture, pick one
Lec 10
Fri 11:30-12:20
Lec 10
Wed 12:30-13:20
Lec 10
Mon 13:30-14:20
Syllabus
Have the syllabus for CSCI 356? Share it and everyone gets the grading, textbooks and rules.