Postdoctoral Fellow, CSAIL

32-G480
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology

32 Vassar Street
Cambridge, MA 02139

Office Phone: (617) 253-2897

Research

My research interests are in the computability and complexity theory of probabilistic inference, computable probability theory, the model theory of graphs and graph limits, and the physics of causality and computation.

Curriculum Vitae

Publications

Computable de Finetti measures, with Daniel Roy, to appear in Annals of Pure and Applied Logic. arXiv:0912.1072.

Noncomputable conditional distributions, with Nate Ackerman and Daniel Roy, in Proc. 26th Ann. IEEE Symp. on Logic in Computer Science (LICS 2011).

Relativistic statistical arbitrage, with Alexander Wissner-Gross, Phys. Rev. E 82, 056104, 2010.

Posterior distributions are computable from predictive distributions, with Daniel Roy, in Proc. 13th Int. Conf. on Artificial Intelligence and Statistics (AISTATS 2010), Journal of Machine Learning Research W&CP 9, 2010.

Computable exchangeable sequences have computable de Finetti measures, with Daniel Roy, in Mathematical Theory and Computational Practice, Proc. of Computability in Europe (CiE 2009), LNCS Vol. 5635, 2009.

Models with High Scott Rank, PhD thesis, Harvard University, 2008.

Preprints and papers in progress

Invariant measures concetrated on countable structures, with Nate Ackerman and Rehana Patel.

Effective aspects of Lipschitz functions, with Bjørn Kjos-Hanssen and André Nies.

On the computability of conditional probability, with Nate Ackerman and Daniel Roy. arXiv:1005.3014.

Patents

System and method for relativistic statistical securities trading, with Alexander Wissner-Gross, U.S. Patent Application 13/117,571 (2011).

PGP Public Key

MIT home page