Mia Minnes

I work in mathematical logic and theoretical computer science. More specifically, I am interested in automata (finite automata, Buchi automata, and tree automata) and their relation to model theory, computability theory, algorithmic randomness, and various algebraic and combinatorial structures.

For details and publications, see my research page.

For more than ten years, I have taught and TAed many classes: calculus (for engineers and for other non-math majors), linear algebra, vector calculus, abstract algebra, introduction to mathematical logic, introduction to computability theory, and a seminar course in Kolmogorov complexity. I have also taken on active roles training TAs, mentoring younger graduate students, and contributing to curriculum committees.

For details and course websites, see my teaching page.

• NSF Grant DMS-1060351 2010-2013
• NSF Grant DMS-0901005 2009-2010
• Cornell Mathematics Department Teaching Award2007-2008
• Robert John Battig Graduate Prize (Research) 2006-2007
• NSERC Postgraduate Fellowship 2003-2007

• 2010-present SE Warschawski Visiting Assistant Professor, UCSD
• 2008-2010 CLE Moore Instructor, MIT

• 2008 PhD (Mathematics), Cornell University
• 2006 MS (Mathematics), Cornell University
• 2006 MS (Computer Science), Cornell University
• 2003 BSc (Mathematics & Engineering), Queen's University
• 2003 BA (Philosophy), Queen's University