Sep

1

Thu

Achilles Beros will

speak on “Algorithmic learning and the arithmetic hierarchy”

Summary:

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

Sep

8

Thu

This week the Sporadic Logic Seminar will be Mushfeq Khan speaking on

“Turing degrees and Muchnik degrees of recursively

bounded DNR functions”.

Summary:

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.

Keller 303

Sep

15

Thu

I will give a tutorial talk, how to use LEAN and Coq/MathCopm.SSReflect, which are famous proof assistant systems.

Keller 303

## University of Hawaiʻi at Mānoa