Midwest Computability Seminar

XXV
Part viii


The Midwest Computability Seminar is meeting remotely in the fall of 2020. The recurring Zoom link is:

https://notredame.zoom.us/j/99754332165?pwd=RytjK1RFZU5KWnZxZ3VFK0g4YTMyQT09

Meeting ID: 997 5433 2165

Passcode: midwest


Slides    Panopto video    YouTube video


This session will be held jointly with the Computability Theory and Applications Online Seminar.


DATE: Tuesday, November 24th, 2020

TIME: 3:00 - 4:00 PM Central

SPEAKER: Karen Lange - Wellesley College

TITLE: Complexity of root-taking in power series fields & related problems

ABSTRACT: In earlier work with Knight and Solomon, we bounded the computational complexity of the root-taking process over Puiseux and Hahn series, two kinds of generalized power series. But it is open whether the bounds given are optimal. By looking at the most basic steps in the root-taking process for Hahn series, we together with Hall and Knight became interested in the complexity of problems associated with well-ordered subsets of a fixed ordered abelian group. Here we provide an overview of the results so far in both these settings.



Past and Future Sessions


Previous Seminars:

If you haven't been receiving the announcements and would like to be included in the list, send an email to drh@math.uchicago.edu.