I am an Assistant Professor of Mathematics at Gonzaga University. I recently earned my Ph.D. from the University of Notre Dame 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). A summary of my current work is available here (pdf).

Teaching

• Office Hours: MF 9:30-10:30, TuW 2:10-3:00, and W 10:00-11:00 in the Math Lab, or by appointment.
• 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 at Gonzaga.
• The course wiki for Math 414, Spring 2011 at Gonzaga.

Thesis

• Final version from April 16, 2010: "Algorithmically random closed sets and probability" (pdf).
• A preliminary version from March 4, 2010: "Algorithmically random closed sets and probability" (pdf) . I will post a final version sometime after my defense on April 1.

Talks

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

Logan Axon
Department of Mathematics
MSC 2615
Gonzaga University
Spokane, WA 99258
Office: Herak 221
Phone: 509.313.3897
Email: axon@gonzaga.edu