Graduate Student Seminar

Graduate Student Seminar

Title:  How Complicated are Orderings on Computable Structures?
Speaker: Trang Ha

Abstract:  A structure A is computable if it has the set of natural numbers N as its domain and all functions and relations on A are computable. We will examine some algebraic structures in this effective setting. Our main focus will be the complexities of orderings on these structures.

Note: The Graduate Student Seminar is mandatory for ALL graduate Students! Attendance will be taken.  Also, please take note of the new day, Thursday.