On the Computability of Conditional Probability von Ackerman, Nathanael L., Freer, Cameron E., Roy, Daniel M.

Volltext

An introduction to feedback Turing computability von Ackerman, Nathanael L, Freer, Cameron E, Lubarsky, Robert S

Volltext

On computability and disintegration von ACKERMAN, NATHANAEL L., FREER, CAMERON E., ROY, DANIEL M.

Volltext

Feedback computability on Cantor space von Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky

Volltext

Randomness extraction and asymptotic Hamming distance von Freer, Cameron E., Kjos-Hanssen, Bjoern

Volltext

Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets von Ackerman, Nate, Freer, Cameron E., Kaddar, Younesse, Karwowski, Jacek, Moss, Sean, Roy, Daniel, Staton, Sam, Yang, Hongseok

Volltext

GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables von Huot, Mathieu, Ghavami, Matin, Lew, Alexander K., Schaechtle, Ulrich, Freer, Cameron E., Shelby, Zane, Rinard, Martin C., Saad, Feras A., Mansinghka, Vikash K.

Volltext

Computable de Finetti measures von Freer, Cameron E., Roy, Daniel M.

Volltext

Optimal approximate sampling from discrete probability distributions von Saad, Feras A., Freer, Cameron E., Rinard, Martin C., Mansinghka, Vikash K.

Volltext

Graph Turing Machines von Ackerman, Nathanael L., Freer, Cameron E.

Volltext

Noncomputable Conditional Distributions von Ackerman, N. L., Freer, C. E., Roy, D. M.

Volltext

Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets von Ackerman, Nathanael L, Freer, Cameron E, Kaddar, Younesse, Karwowski, Jacek, Moss, Sean K, Roy, Daniel M, Staton, Sam, Yang, Hongseok

Volltext bestellen

GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables von Huot, Mathieu, Ghavami, Matin, Lew, Alexander K, Schaechtle, Ulrich, Freer, Cameron E, Zane Shelby, Rinard, Martin C, Saad, Feras A, Mansinghka, Vikash K

Volltext

A Notion of a Computational Step for Partial Combinatory Algebras von Ackerman, Nathanael L., Freer, Cameron E.

Volltext

On the computability of conditional probability von Ackerman, Nathanael L, Freer, Cameron E, Roy, Daniel M

Volltext

Feedback computability on Cantor space von Ackerman, Nathanael L, Freer, Cameron E, Lubarsky, Robert S

Volltext

The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions von Saad, Feras A, Freer, Cameron E, Rinard, Martin C, Mansinghka, Vikash K

Volltext bestellen

Optimal Approximate Sampling from Discrete Probability Distributions von Saad, Feras A, Freer, Cameron E, Rinard, Martin C, Mansinghka, Vikash K

Volltext

A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions von Saad, Feras A, Freer, Cameron E, Ackerman, Nathanael L, Mansinghka, Vikash K

Volltext bestellen

Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets von Ackerman, Nathanael L, Freer, Cameron E, Kaddar, Younesse, Karwowski, Jacek, Moss, Sean K, Roy, Daniel M, Staton, Sam, Yang, Hongseok

Volltext