Title: Structural Computable Analysis

Speaker: Timothy McNicholl, Iowa State University

Abstract: Computability theory is the mathematical study of the limits and potentialities of discrete computing devices.  Computable analysis is the theory of computing with continuous data such as real numbers.  Computable structure theory examines which computability-theoretic properties are possessed by the structures in various classes such as partial orders, Abelian groups, and Boolean algebras.  Until recently computable structure theory has focused on classes of countable algebraic structures and has neglected the uncountable structures that occur in analysis such as metric spaces and Banach spaces.  However, a program has now emerged to use computable analysis to broaden the purview of computable structure theory so as to include analytic structures.  The solutions of some of the resulting problems have involved a delicate blend of methods from functional analysis and classical computability theory.  We will discuss progress so far on metric spaces and Banach spaces, in particular $\ell^p$ spaces, as well as open problems and new areas for investigation.

Bio: Tim McNicholl received his Ph.D. from The George Washington University in 1995.  He pursues research projects that involve a mixture of computability theory, complex analysis, and functional analysis and enjoys working with mathematicians from fields other than logic.  He has been an Associate Professor of Mathematics at Iowa State University since 2012 where he has directed the redesign of the precalculus curriculum.  HIs work on precalculus curricula helped the Iowa State University Mathematics Department win an award for an Exemplary Program or Achievement in a Mathematics Department from the American Mathematical Society in 2015.