4 citations · 8 across the 5 of their papers we have counts for
5 papers
On the computability of graphons
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer +2
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in e…
Stable regularity for relational structures
Nathanael Ackerman, Cameron Freer, Rehana Patel
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that unde…
Properly ergodic structures
Nathanael Ackerman, Cameron Freer, Alex Kruckman +1
We consider ergodic -invariant probability measures on the space of -structures with domain (for a countable relational language), and…
Countable infinitary theories admitting an invariant measure
Nathanael Ackerman, Cameron Freer, Rehana Patel
Let be a countable language. We characterize, in terms of definable closure, those countable theories of for which there exists an -inva…
On the computability of graph Turing machines
Nathanael Ackerman, Cameron Freer
We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model o…