260 likes | 420 Views
Theory of Discrete Computation . Typical programming examples: Sorting, pattern search, graph algorithms Program is a function from inputs to outputs Finite-state computation Automata theory, regular languages Limits of computability Turing machines Correctness Assertions, pre/post conditio
E N D