Predicatively computable functions on sets
Toshiyasu Arai · arXiv (Cornell University) · 2012
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.