Title: Computability-Theoretic Properties of Orders and Complexity of Identifying Algebraic Properties on Computable Magmas
Speaker: Trang Ha
Date and Time: Monday, April 9, 2:30-3:30pm
Place: Rome 204
Abstract : A magma is computable if both its domain and its atomic diagram are computable. We investigate the Turing complexity of orders on computable orderable magmas by studying their algebraic and topological properties. We further discuss the spaces of orders on special self-distributive (and not necessarily associative) magmas that come from knot theory named quandles. We also consider the complexity of the index set of magmas that satisfy certain algebraic properties within the class of computable magmas.