Video Lectures

Separate tags with a comma.

I'll show a graphical user interface I wrote which explores the problem of inscribing rectangles in Jordan loops. The motivation behind this is the notorious Square Peg Conjecture of Toeplitz, from 1911.

I did not manage to solve this problem, but I...

Choiceless Polynomial Time

Ben Rossman

The choiceless computation model of Blass, Gurevich and Shelah (1999, 2002) is an algorithmic framework for computing isomorphism-invariant properties of unordered structures. Machines in this model have the power of parallel execution, but lack...

In various applications, one is given the advice or predictions of several classifiers of unknown reliability, over multiple questions or queries. This scenario is different from standard supervised learning where classifier accuracy can be assessed...