32 citations · 125 across the 17 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.LO2017
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…
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…