Antonella Perucca (University of Regensburg), Reductions of algebraic numbers
Number theory talk, accessible to all graduate students. Join us! Abstract: We start by considering the reductions of the integers modulo the various prime numbers. More precisely, we investigate the multiplicative order of the reductions of an integer.
We then generalize this setting to number fields and illustrate some results which are joint work with Christophe Debry.
Speaker: William Stein (SageMath, Inc. & University of Washington)
Title: What is SageMath good for?
Abstract: Answer – almost everything you do. I will talk about how you can use SageMath in teaching and research. In particular, how to use Sage to support courses involving computation, to help in collaborative writing of LaTeX documents, to contribute and improve peer reviewed implementations of algorithms, and to explore new mathematics.
Achilles Beros will
speak on “Algorithmic learning and the arithmetic hierarchy”
I will present a theorem from my thesis that establishes the arithmetic
complexity of a well-known learning criterion. Two other papers have
been published since then that continue the line of research. I will
discuss the newer papers as well as broader connections between
recursion theory and learning theory.
Keller Hall 303
This week the Sporadic Logic Seminar will be Mushfeq Khan speaking on
“Turing degrees and Muchnik degrees of recursively
bounded DNR functions”.
This talk is based on a forthcoming paper by Steve Simpson. It contains
some results that shed light on a part of the Muchnik lattice that remains
poorly understood: the various degrees of recursively bounded DNR functions
obtained by varying the recursive bound.