I like working with theoretical computer science and discrete mathematics to design systems. Interests include complexity theory, programming languages, compilers, parallel computing, and numerical computing.
-- A Complexity Zoo!
-- PowerPoint is a Turing-complete language.
-- Super Mario Bros. is NP-hard.