Predicatively computable functions on sets
Logic
2014-11-27 v9
Abstract
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.
Cite
@article{arxiv.1204.5582,
title = {Predicatively computable functions on sets},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1204.5582},
year = {2014}
}