Arnold Beckmann, Samuel R. Buss, Sy-David Friedman, Moritz Müller and Neil Thapen
Computability, Volume 8, Number 1, Pages 67 - 98.
Publication year: 2018

The Cobham Recursive Set Functions (CRSF) provide an analogue of polynomial time computation which applies to arbitrary sets. We give three new equivalent characterizations of CRSF. The first is algebraic, using subset-bounded recursion and a form of Mostowski collapse. The second is our main result: the CRSF functions are shown to be precisely the functions computed by a class of uniform, infinitary, Boolean circuits. The third is in terms of a simple extension of the rudimentary functions by transitive closure and subset-bounded recursion.