Nathanael L. Ackerman

Orcid: 0000-0002-8059-7497

Affiliations:
  • Harvard University, Department of Mathematics, Cambridge, MA, USA
  • University of California at Berkeley, Department of Mathematics, CA, USA


According to our database1, Nathanael L. Ackerman authored at least 28 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets.
Proc. ACM Program. Lang., January, 2024

2022
A Maximality Theorem for Continuous First Order Theories.
Reports Math. Log., November, 2022

Computable PAC Learning of Continuous Features.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
On computable aspects of algebraic and definable closure.
J. Log. Comput., 2021

On computable learning of continuous features.
CoRR, 2021

2020
Encoding Complete Metric Structures by Classical Structures.
Logica Universalis, 2020

An introduction to feedback Turing computability.
J. Log. Comput., 2020

Computability of Algebraic and Definable Closure.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019
Indivisible sets and well-founded orientations of the Rado graph.
Math. Log. Q., 2019

Feedback computability on Cantor space.
Log. Methods Comput. Sci., 2019

On the Computability of Conditional Probability.
J. ACM, 2019

Categoricity in multiuniversal classes.
Ann. Pure Appl. Log., 2019

Algorithmic barriers to representing conditional independence.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
On the computability of graphons.
CoRR, 2018

The Beta-Bernoulli process and algebraic effects.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
On computability and disintegration.
Math. Struct. Comput. Sci., 2017

On the computability of graph Turing machines.
CoRR, 2017

A classification of orbits admitting a unique invariant measure.
Ann. Pure Appl. Log., 2017

Graph Turing Machines.
Proceedings of the Logic, Language, Information, and Computation, 2017

2016
Invariant measures via inverse limits of finite structures.
Eur. J. Comb., 2016

2015
Vaught's Conjecture Without Equality.
Notre Dame J. Formal Log., 2015

Feedback Turing Computability, and Turing Computability as Feedback.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
On Transferring Model Theoretic Theorems of \({\mathcal{L}_{{\infty}, \omega}}\) in the Category of Sets to a Fixed Grothendieck Topos.
Logica Universalis, 2014

Sheaf Recursion and a Separation Theorem.
J. Symb. Log., 2014

2013
A Notion of a Computational Step for Partial Combinatory Algebras.
Proceedings of the Theory and Applications of Models of Computation, 2013

2011
Noncomputable Conditional Distributions.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Relativized Grothendieck topoi.
Ann. Pure Appl. Log., 2010


  Loading...