32-G480
32 Vassar Street
Office Phone: (617) 253-2897
Computer Science and Artificial
Intelligence Laboratory
Massachusetts Institute of
Technology
Cambridge, MA 02139
![[photo]](photos/freer-outsidetall.png)
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.
Publications
Causal entropic forces, with Alexander Wissner-Gross, Physical Review Letters 110, 168702, 2013. Supplemental Material.
A notion of a computational step for Partial Combinatory Algebras, with Nate Ackerman, in Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC 2013), LNCS Vol. 7876, 133–143, 2013.
Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence, with Daniel Roy and Joshua Tenenbaum, in Turing's Legacy, ASL Lecture Notes in Logic, 2013. arXiv:1212.4799.
Computable de Finetti measures, with Daniel Roy, Annals of Pure and Applied Logic 163, no. 5, 530–546, 2012. arXiv:0912.1072.
Noncomputable conditional distributions, with Nate Ackerman and Daniel Roy, in Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Sci. (LICS 2011), 107–116, 2011.
Relativistic statistical arbitrage, with Alexander Wissner-Gross, Physical Review E 82, 056104, 2010.
Posterior distributions are computable from predictive distributions, with Daniel Roy, in Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS 2010), Journal of Machine Learning Research (JMLR) Workshop and Conference Proceedings 9, 2010.
Computable exchangeable sequences have computable de Finetti measures, with Daniel Roy, in Mathematical Theory and Computational Practice, Proceedings of Computability in Europe (CiE 2009), LNCS Vol. 5635, 218–231, 2009.
Preprints
Invariant measures concentrated on countable structures, with Nate Ackerman and Rehana Patel. arXiv:1206.4011.
Algorithmic aspects of Lipschitz functions, with Bjørn Kjos-Hanssen, André Nies, and Frank Stephan.
On the computability of conditional probability, with Nate Ackerman and Daniel Roy. arXiv:1005.3014.
PhD Thesis
Models with High Scott Rank, PhD thesis, Harvard University, 2008.
Patents
System and method for relativistic statistical securities trading, with Alexander Wissner-Gross, U.S. Patent Application 13/117,571 (2011).