Nathanael L. Ackerman

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 25

Top Topics

Kolmogorov Smirnov

Conditional Independencies

Top Venues

Ann. Pure Appl. Log.

J. Log. Comput.

Publications

Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. Proc. ACM Program. Lang. 8 (POPL) (2024)
Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets. CoRR (2023)
Nathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan
Computable PAC Learning of Continuous Features. LICS (2022)
Nathanael L. Ackerman, Mary Leah Karker
A Maximality Theorem for Continuous First Order Theories. Reports Math. Log. 57 (2022)
Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel
On computable aspects of algebraic and definable closure. J. Log. Comput. 31 (1) (2021)
Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel
On computable aspects of algebraic and definable closure. CoRR (2021)
Nathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan
On computable learning of continuous features. CoRR (2021)
Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
An introduction to feedback Turing computability. J. Log. Comput. 30 (1) (2020)
Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel
Computability of Algebraic and Definable Closure. LFCS (2020)
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
On the Computability of Conditional Probability. J. ACM 66 (3) (2019)
Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. AISTATS (2019)
Nathanael L. Ackerman, Will Brian
Indivisible sets and well-founded orientations of the Rado graph. Math. Log. Q. 65 (1) (2019)
Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. CoRR (2019)
Nathanael L. Ackerman, Will Boney, Sebastien Vasey
Categoricity in multiuniversal classes. Ann. Pure Appl. Log. 170 (11) (2019)
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute
Algorithmic barriers to representing conditional independence. LICS (2019)
Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
Feedback computability on Cantor space. Log. Methods Comput. Sci. 15 (2) (2019)
Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
The Beta-Bernoulli process and algebraic effects. CoRR (2018)
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute
On the computability of graphons. CoRR (2018)
Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
The Beta-Bernoulli process and algebraic effects. ICALP (2018)
Nathanael L. Ackerman, Cameron E. Freer, Aleksandra Kwiatkowska, Rehana Patel
A classification of orbits admitting a unique invariant measure. Ann. Pure Appl. Log. 168 (1) (2017)
Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
Feedback computability on Cantor space. CoRR (2017)
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
On computability and disintegration. Math. Struct. Comput. Sci. 27 (8) (2017)
Nathanael L. Ackerman, Cameron E. Freer
On the computability of graph Turing machines. CoRR (2017)
Nathanael L. Ackerman, Cameron E. Freer
Graph Turing Machines. WoLLIC (2017)
Nathanael L. Ackerman, Cameron E. Freer, Jaroslav Nesetril, Rehana Patel
Invariant measures via inverse limits of finite structures. Eur. J. Comb. 52 (2016)
Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
Feedback Turing Computability, and Turing Computability as Feedback. LICS (2015)
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
On computability and disintegration. CoRR (2015)
Nathanael L. Ackerman, Cameron E. Freer
A Notion of a Computational Step for Partial Combinatory Algebras. TAMC (2013)
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
Noncomputable Conditional Distributions. LICS (2011)
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
On the computability of conditional probability. CoRR (2010)