Speaker: Kostas Beros (U. North Texas)

Title: Normal numbers and a completeness result in the difference hierarchy

Abstract: In this talk I consider a natural set of real numbers, arising in ergodic theory, and show that it is Wadge-complete for the class of differences of $F_{\sigma\delta}$ sets. I will recall basic definitions and motivate my result with a discussion of related theorems from the past twenty years.

Logic seminar

Keller Hall 401

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

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

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

Keller 303

This week Mushfeq Khan is continuing his

seminar from 2 weeks ago 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 Hall 303

TITLE: The Algebraic Approach to Determining the Complexity of Constraint Satisfaction Problems

SPEAKER: William DeMeo

ABSTRACT: The “CSP-dichotomy conjecture” of Feder and Vardi asserts that every constraint satisfaction problem (CSP) is in P or is NP-complete. Sometime around the late 1990′s it was observed that a CSP is naturally associated with a general (universal) algebra via a certain Galois connection, and that this connection makes it possible to use algebraic methods to determine the complexity class of a CSP. This led to the “algebraic CSP-dichotomy conjecture” which, after more than a decade of substantial research, has been reduced to the following conjecture: the CSP associated with a finite idempotent algebra A is tractable if and only if the variety generated by A has a Taylor term.

In this talk we try to give most of the background required to understand the algebraic approach to CSP. We give some concrete examples that demonstrate how one uses properties of a universal algebra to determine the complexity class of a CSP. If time permits, we will highlight some of our most recent discoveries that have helped resolve the dichotomy conjecture for most idempotent varieties.

The talk should be fairly self-contained for anyone greater than or equal to a math or cs graduate student. Roughly speaking, if you have heard of the complexity classes P and NP and if you know what a universal algebra is, then you should understand most of this talk.