32 citations · 125 across the 17 of their papers we have counts for
9 papers · 1 filter
On computable aspects of algebraic and definable closure
Nathanael Ackerman, Cameron Freer, Rehana Patel
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quanti…
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…
Feedback computability on Cantor space
Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
We introduce the notion of feedback computable functions from to , extending feedback Turing computation in analogy with the standard notion of computability for functio…
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…
On computability and disintegration
Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy
We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration,…
Algorithmic aspects of Lipschitz functions
Cameron Freer, Bjørn Kjos-Hanssen, André Nies +1
We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differen…