BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Victor Selivanov (Institute of Informatics Systems\, Novosibirsk)
DTSTART:20210209T130000Z
DTEND:20210209T140000Z
DTSTAMP:20260423T005738Z
UID:CTA/41
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/41/">Pri
 mitive recursive ordered fields and some applications</a>\nby Victor Seliv
 anov (Institute of Informatics Systems\, Novosibirsk) as part of Computabi
 lity theory and applications\n\n\nAbstract\nWe establish primitive recursi
 ve versions of some known facts about computable ordered fields of reals a
 nd the field of computable reals and then apply them to some problems in l
 inear algebra and analysis. In particular\, we find a partial primitive re
 cursive analog of Ershov-Madison’s theorem about real closures of comput
 able ordered fields\, relate the corresponding fields to the primitive rec
 ursive reals\, give sufficient conditions for primitive recursive root-fin
 ding\, computing normal forms of matrices\, and computing solution operato
 rs of some linear systems of PDE.\nThis is joint work with Svetlana Seliva
 nova.\n
LOCATION:https://researchseminars.org/talk/CTA/41/
END:VEVENT
END:VCALENDAR