Logic Seminar-Densely computable structures

Time: Thursday, October 28, 4:30-5:30PM

Speaker: Valentina Harizanov, GWU

Title: Densely computable structures

Abstract: The study of approximate computability has been originally motivated by asymptotic density problems in combinatorial group theory. In recent years, computability theorists have investigated generically and coarsely computable sets introduced by C. Jockusch and P. Schupp. We generalize the notions of generic and coarse computability of sets to arbitrary structures by introducing generically and coarsely computable structures and isomorphisms. This is joint work with W. Calvert and D. Cenzer.