Device Independence: A New Paradigm for Randomness Manipulation?
A trusted source of independent and uniform random bits is a basic resource in many computational tasks, such as cryptography, game theoretic protocols, algorithms and physical simulations. Implementing such a source presents an immediate challenge: how can one certify whether one has succeeded? i.e. suppose someone were to claim that a particular device outputs a uniformly random n-bit string; is there a feasible test to verify that claim?
Natural Models of Type Theory
The James Construction and pi_4(S^3)
The Hypoelliptic Laplacian: An Introduction
New Locally Decodable Codes from Lifting
Locally decodable codes (LDCs) are error-correcting codes that allow for highly-efficient recovery of "pieces" of information even after arbitrary corruption of a codeword. Locally testable codes (LTCs) are those that allow for highly-efficient testing to see if some given word is close to a codeword. Codes derived from evaluations of low-degree multivariate polynomials give the simplest
Remembering Albert O. Hirschman
The Hirschman family, friends, colleagues, and former students gathered on March 24, 2013, to remember and celebrate the life and work of Albert O. Hirschman (1915–2012), Professor in the School of Social Science at the Institute.