Michael is currently a 3rd year graduate student in mathematics at the University of Wyoming. His interests include complexity, combinatorics, coding, philosophy, piano composition, and poetry. After graduating from Trinity College in 2006 with a B.S. in computer science, Michael headed the quantitative department of a global hedge fund, then subsequently enrolled in a Ph.D. program of study focused on graph theory, theoretical computer science, and combinatorics. Mike has enjoyed teaching math during the year and working at NASA over the summer. For his M.S., Michael developed new approximation algorithms for finding maximum cliques in hypergraphs. He is currently starting on his dissertation and hopes that the NKSSS can provide new approaches to some pure mathematics problems in graph theory. After graduating, he hopes to become a research fellow at Wolfram Research.
Project: CAs, Graphs, and Topology
This project aims to find totalistic cellular automata that can compute/detect/classify the structural and topological properties of graphs.
Favorite Four-Color Totalistic Cellular Automaton