Bakhadyr Khoussainov: Algorithmically random algebraic structures

Invitation to the Logic Seminar at the National University of Singapore

Date: Wednesday, 16 April 2014, 17:00 hrs

Room: S17#04-05, Department of Mathematics, NUS

Speaker: Bakhadyr Khoussainov, University of Auckland

Title: Algorithmically random algebraic structures


Abstract: In this talk we introduce the concept of algorithmically
random algebraic structure. In particular, we construct
algorithmically random structures in the classes of graphs, trees,
universal algebras, and monoids. We prove that there exist computably
enumerable algorithmically random trees. We also build algorithmically
random universal algebras and graphs computable in the halting set.

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.

This site uses Akismet to reduce spam. Learn how your comment data is processed.