Nathanael L. Ackerman

Proc. ACM Program. Lang., January, 2024

2022

A Maximality Theorem for Continuous First Order Theories.

[BibT_eX]

[DOI]

Mary Leah Karker

Reports Math. Log., November, 2022

Computable PAC Learning of Continuous Features.

[BibT_eX]

[DOI]

Julian Asilis

Jieqi Di

Jean-Baptiste Tristan

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.

[BibT_eX]

[DOI]

J. Log. Comput., 2021

On computable learning of continuous features.

[BibT_eX]

[DOI]

Julian Asilis

Jieqi Di

Jean-Baptiste Tristan

CoRR, 2021

2020

Encoding Complete Metric Structures by Classical Structures.

[BibT_eX]

[DOI]

Logica Universalis, 2020

An introduction to feedback Turing computability.

[BibT_eX]

[DOI]

Robert S. Lubarsky

J. Log. Comput., 2020

Computability of Algebraic and Definable Closure.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019

Indivisible sets and well-founded orientations of the Rado graph.

[BibT_eX]

[DOI]

Will Brian

Math. Log. Q., 2019

Feedback computability on Cantor space.

[BibT_eX]

[DOI]

Robert S. Lubarsky

Log. Methods Comput. Sci., 2019

On the Computability of Conditional Probability.

[BibT_eX]

[DOI]

J. ACM, 2019

Categoricity in multiuniversal classes.

[BibT_eX]

[DOI]

Will Boney

Sebastien Vasey

Ann. Pure Appl. Log., 2019

Algorithmic barriers to representing conditional independence.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Feras A. Saad

Vikash K. Mansinghka

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

On the computability of graphons.

[BibT_eX]

[DOI]

CoRR, 2018

The Beta-Bernoulli process and algebraic effects.

[BibT_eX]

[DOI]

Sam Staton

Dario Stein

Hongseok Yang

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

On computability and disintegration.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

On the computability of graph Turing machines.

[BibT_eX]

[DOI]

CoRR, 2017

A classification of orbits admitting a unique invariant measure.

[BibT_eX]

[DOI]

Aleksandra Kwiatkowska

Ann. Pure Appl. Log., 2017

Graph Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2017

2016

Invariant measures via inverse limits of finite structures.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2016

2015

Vaught's Conjecture Without Equality.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2015

Feedback Turing Computability, and Turing Computability as Feedback.

[BibT_eX]

[DOI]

Robert S. Lubarsky

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.

[BibT_eX]

[DOI]

Logica Universalis, 2014

Sheaf Recursion and a Separation Theorem.

[BibT_eX]

[DOI]

J. Symb. Log., 2014

2013

A Notion of a Computational Step for Partial Combinatory Algebras.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

2011

Noncomputable Conditional Distributions.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

Relativized Grothendieck topoi.

[BibT_eX]

[DOI]