Applications of theory of finite automata, push-down automata, and Turing machines to the design of digital machines. Emphasis will be on the computational capabilities of classes of finite and infinite automata and on the consequences for digital design. Theory of NP completeness, description of NP complete problems in digital design, and the consequences for design processes.