I am an Assistant Professor of Mathematics at Gonzaga University. I earned my Ph.D. from the University of Notre Dame in 2010 where my adviser was Peter Cholak. My research has been in computability theory, specifically algorithmic randomness. I have been looking at a definition of algorithmically random closed sets based on the probability theory of set-valued random variables (commonly called RACS).

### Teaching

- Office hours: MWF 2:00-3:00, Tu 9:30-10:30, and M 3:00-4:00 in the Math Lab or by appointment.
- The course web page for Math 258-03,04 Calculus II, Fall 2015.
- The course web page for Math 421 Probability Theory, Fall 2014.
- The course web page for Math 259-03 Calculus III, Spring 2015.
- The course web page for Math 301 Fundamentals of Mathematics, Spring 2015.
- The course web page for Math 157.07 Calculus I, Fall 2014.
- The course web page for Math 301 Fundamentals of Mathematics, Fall 2014.
- The course web page for Math 499 Senior Comprehensive, Fall 2014.
- The course web page for Math 422 Mathematical Statistics, Spring 2014.
- The course web page for Math 259 Calculus III Sections 01 and 03, Spring 2014.
- The course web page for Math 157 Calculus I Sections 06 and 07, Fall 2013.
- The course web page for Math 258 Calculus II Sections 03 and 04, Fall 2012.
- The course web page for Math 157 Calculus I Sections 01 and 03, Spring 2012.
- The course web page for Math 148 Survey of Calculus, Fall 2011.
- The course web page for Math 321, Spring 2011.
- The course wiki for Math 414, Spring 2011.

### Writing/publications

- "Martin-Löf random generalized Poisson processes". Submitted for publication.
- "TT-functionals and Martin-Löf randomness for Bernoulli measures". Submitted for publication.
- "Martin-Löf randomness in spaces of closed sets" (pdf). Journal of Symbolic Logic, vol. 80 no. 2 (2015).
- My thesis: "Algorithmically random closed sets and probability" (pdf). Published in 2010.

### Talks

- Spokane Regional Mathematics Colloquium, April, 2011: "Hilbert's problems, Godel, and the limits of computation". Slides.
- Logic Seminar, the Ohio State University, May 6, 2010: "Algorithmically random closed sets".
- Radical Pi Seminar, the Ohio State University, May 5, 2010: "Random fractals".
- Gonzaga University Seminar, April 5, 2010: "Random fractals". Slides.
- Graduate Student Conference in Logic, UIUC, April 18, 2009: "Algorithmically random closed sets and probability". Abstract.
- Joint Math Meetings, Washington, D.C., January 8, 2009: "Algorithmically random closed sets and probability". Slides.
- Midwest Computability Seminar, University of Chicago, September 23, 2008: "Random closed sets and probability". Abstract.
- Notre Dame Graduate Student Seminar, Feb. 4, 2008: "A short tour of algorithmic randomness". Abstract.
- Notre Dame Graduate Student Seminar, Oct. 9, 2006: "Effective randomness for fun and profit". Abstract.
- Notre Dame Logic Seminar, Feb. 9, 2006: "Measure and domination" Abstract (pdf) and slides.

### Other

- A small site about the Monty Hall problem.

Logan Axon

Department of Mathematics

MSC 2615

Gonzaga University

Spokane, WA 99258

Office: Herak 221

Phone: 509.313.3897

Email: axon@gonzaga.edu

Last updated 9/18/2015