4 citations · 10 across the 8 of their papers we have counts for
Showing 2017 · math.LOShow all
3 papers · 2 filters
math.LO2017★ 1 cited
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…
math.LO2017
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…
math.LO2017
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…