Computable Exchangeable Sequences Have Computable de Finetti Measures. - Cameron E. Freer; Daniel M. Roy 001 (CiE, 2009)

Posterior distributions are computable from predictive distributions. - Cameron E. Freer; Daniel M. Roy 001 (AISTATS, 2010)

Noncomputable Conditional Distributions. - Nathanael L. Ackerman; Cameron E. Freer; Daniel M. Roy 001 (LICS, 2011)

Computable de Finetti measures. - Cameron E. Freer; Daniel M. Roy 001 (Ann. Pure Appl. Log., 2012)

Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence - Cameron E. Freer; Daniel M. Roy 001; Joshua B. Tenenbaum (CoRR, 2012)

A Notion of a Computational Step for Partial Combinatory Algebras. - Nathanael L. Ackerman; Cameron E. Freer (TAMC, 2013)

Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence. - Cameron E. Freer; Daniel M. Roy 001; Joshua B. Tenenbaum (Turing's Legacy, 2014)

Algorithmic Aspects of Lipschitz Functions. - Cameron E. Freer; Bjørn Kjos-Hanssen; André Nies; Frank Stephan 001 (Comput., 2014)

Feedback Turing Computability, and Turing Computability as Feedback. - Nathanael L. Ackerman; Cameron E. Freer; Robert S. Lubarsky (LICS, 2015)

Invariant measures via inverse limits of finite structures. - Nathanael L. Ackerman; Cameron E. Freer; Jaroslav Nesetril; Rehana Patel (Eur. J. Comb., 2016)

Graph Turing Machines. - Nathanael L. Ackerman; Cameron E. Freer (WoLLIC, 2017)

A classification of orbits admitting a unique invariant measure. - Nathanael L. Ackerman; Cameron E. Freer; Aleksandra Kwiatkowska; Rehana Patel (Ann. Pure Appl. Log., 2017)

On the computability of graph Turing machines. - Nathanael L. Ackerman; Cameron E. Freer (CoRR, 2017)

On computability and disintegration. - Nathanael L. Ackerman; Cameron E. Freer; Daniel M. Roy 001 (Math. Struct. Comput. Sci., 2017)

The Beta-Bernoulli process and algebraic effects. - Sam Staton; Dario Stein; Hongseok Yang; Nathanael L. Ackerman; Cameron E. Freer; Daniel M. Roy 001 (ICALP, 2018)

On the computability of graphons. - Nathanael L. Ackerman; Jeremy Avigad; Cameron E. Freer; Daniel M. Roy 001; Jason M. Rute (CoRR, 2018)

A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. - Feras A. Saad; Cameron E. Freer; Nathanael L. Ackerman; Vikash K. Mansinghka (AISTATS, 2019)

Algorithmic barriers to representing conditional independence. - Nathanael L. Ackerman; Jeremy Avigad; Cameron E. Freer; Daniel M. Roy 001; Jason M. Rute (LICS, 2019)

On the Computability of Conditional Probability. - Nathanael L. Ackerman; Cameron E. Freer; Daniel M. Roy 001 (J. ACM, 2019)

Feedback computability on Cantor space. - Nathanael L. Ackerman; Cameron E. Freer; Robert S. Lubarsky (Log. Methods Comput. Sci., 2019)

The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions. - Feras Saad; Cameron E. Freer; Martin C. Rinard; Vikash Mansinghka 001 (AISTATS, 2020)

Computability of Algebraic and Definable Closure. - Nathanael L. Ackerman; Cameron E. Freer; Rehana Patel (LFCS, 2020)

Deep Involutive Generative Models for Neural MCMC. - Span Spanbauer; Cameron E. Freer; Vikash Mansinghka 001 (CoRR, 2020)

An introduction to feedback Turing computability. - Nathanael L. Ackerman; Cameron E. Freer; Robert S. Lubarsky (J. Log. Comput., 2020)

Optimal approximate sampling from discrete probability distributions. - Feras A. Saad; Cameron E. Freer; Martin C. Rinard; Vikash K. Mansinghka (Proc. ACM Program. Lang., 2020)

On computable learning of continuous features. - Nathanael L. Ackerman; Julian Asilis; Jieqi Di; Cameron E. Freer; Jean-Baptiste Tristan (CoRR, 2021)

On computable aspects of algebraic and definable closure. - Nathanael L. Ackerman; Cameron E. Freer; Rehana Patel (J. Log. Comput., 2021)

Computable PAC Learning of Continuous Features. - Nathanael L. Ackerman; Julian Asilis; Jieqi Di; Cameron E. Freer; Jean-Baptiste Tristan (LICS, 2022)

GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables. - Mathieu Huot; Matin Ghavami; Alexander K. Lew; Ulrich Schaechtle; Cameron E. Freer; Zane Shelby; Martin C. Rinard; Feras A. Saad; Vikash K. Mansinghka (Proc. ACM Program. Lang., 2024)

Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. - Nathanael L. Ackerman; Cameron E. Freer; Younesse Kaddar; Jacek Karwowski; Sean K. Moss; Daniel M. Roy 001; Sam Staton; Hongseok Yang (Proc. ACM Program. Lang., 2024)