Frank Stephan: The complexity of semiautomatic structures

Invitation to the Logic Seminar at the National University of Singapore

Date: Wednesday, 21 October 2015, 17:00 hrs

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

Speaker: Frank Stephan

Title: The complexity of semiautomatic structures


This talk extends previous work on semiautomatic structures and in
particular investigates complexity issues with groups and semigroups;
furthermore, results from recursion theory are used to show that one
specific structure is not semiautomatic while a related one can be
shown to be semiautomatic.

This is joint work with Sanjay Jain, Bakhadyr Khoussainov,
Dan Teng and Siyuan Zou.

This talk has been presented at the conference CCR 2015 in Heidelberg.

Leave a Reply

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

Time limit is exhausted. Please reload CAPTCHA.