Past Events

A traditional goal of complexity theory is to distinguish between problems that are computationally tractable and those that are not The tractable so called easy problems are solvable in polynomial time and form the complexity class P From a practical standpoint however even problems solvable in cubic or quadratic time

I will speak about some aspects of fair claims resolution, which includes, e.g., resolution by a central authority, by markets autonomous agents , by a fix-point theorem, and even by

Reconnect workshops expose faculty teaching undergraduates to current applications of mathematical and computational sciences and provide an opportunity for government or industry professionals to learn about recent research in related areas The topic will be presented over the course of 3 days in a series of lectures and activities Participants

For the most up to date information about this event please see the workshop s main webpage Neural networks NNs are at the heart of modern machine learning and artificial intelligence ML AI systems The rapid development of these technologies has led to adoption across a variety of domains particularly