BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Degree spectra of computable functions on natural
numbers with standard order - Dariusz Kalociński (
Polish Academy of Sciences)
DTSTART;TZID=Europe/London:20220610T111500
DTEND;TZID=Europe/London:20220610T121500
UID:TALK174845AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/174845
DESCRIPTION:The degree spectrum of a computable relation on a
computable structure consists of all Turing degree
s of the images of the relation across all computa
ble copies of the structure. Investigation of the
degree spectra of computable relations on the comp
utable structure consisting of natural numbers and
the standard order has exhibited spectra such as
the trivial one\, all c.e. degrees and all degree
s. I will review recent results regarding the rest
riction of this problem to graphs of unary total r
ecursive functions. This approach has led\, among
others\, to the the negative answer to one of the
questions posed by M. Wright\, namely whether the
aforementioned spectra exhaust all possibilities.
The talk will be based on a joint work with N. Baz
henov and M. Wrocławski.
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:
END:VEVENT
END:VCALENDAR