Speaker: Johanna Franklin, Hofstra University
Johanna Franklin, an associate professor of mathematics at Hofstra University is primarily interested in algorithmic randomness and recursion theory. Other research interests include: mathematical logic, computability theory, effective analysis, and computable model theory. She received her BS and in Mathematical Sciences with minors in Physics and Linguistics and MS in Mathematical Sciences in 2001 from Carnegie Mellon University in Pittsburgh, PA. She received her Ph.D. in Logic in 2007 from University of California, Berkeley.
Title: Computable categoricity of random fields
Abstract: The algebraic fields of characteristic 0 can be classified using a computable homeomorphism onto Cantor space. This enables us to define a random field as one that is mapped to a random element of Cantor space. In this talk, I will discuss the computable categoricity of random fields in the contexts of two different languages: the standard language of fields and an expanded language with root predicates that hold when their inputs define polynomials that have roots in the field under consideration.
This work is joint with Russell Miller.
Dr. Franklin’s visit supported by Simons Foundation Grant `Computing with Continuous Data’ (PI Timothy H. McNicholl)