BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Harrison-Trainor (Victoria University of Wellington\, New 
 Zealand)
DTSTART:20200513T010000Z
DTEND:20200513T020000Z
DTSTAMP:20260423T004913Z
UID:CTA/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/5/">The 
 tree of tuples of a structure</a>\nby Matthew Harrison-Trainor (Victoria U
 niversity of Wellington\, New Zealand) as part of Computability theory and
  applications\n\n\nAbstract\nGiven a countable structure\, one can associa
 te a tree of finite tuples from that structure\, with each tuple labeled b
 y its atomic type. This tree encodes the back-and-forth information of the
  structure\, and hence determines the isomorphism type\, but it is still m
 issing something: with Montalban I proved that there are structures which 
 cannot be computably (or even hyperarithmetically) recovered from their tr
 ee of tuples. I'll explain the meaning of this result by exploring two sep
 arate threads in computable structure theory: universality and coding.\n
LOCATION:https://researchseminars.org/talk/CTA/5/
END:VEVENT
END:VCALENDAR