论文信息 - Feasible set functions have small circuits

Feasible set functions have small circuits

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. ∗Supported in part by NSF grants DMS-1101228 and CCR-1213151, by the Simons Foundation, award 306202, and by the Skolkovo Institute for Science and Technology. †Supported by the Austrian Science Fund (FWF) under project number P24654. ‡Supported by the Austrian Science Fund (FWF) under project number P28699. §Partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement 339691. The Institute of Mathematics of the Czech Academy of Sciences is supported by RVO:67985840.

Samuel R. Buss | Neil Thapen | Sy-David Friedman | Arnold Beckmann | Moritz Müller

[1] Vladimir Sazonov,et al. On Bounded Set Theory , 1997 .

[2] Samuel R. Buss,et al. Cobham recursive set functions , 2016, Ann. Pure Appl. Log..

[3] Yehoshua Bar-Hillel,et al. The Intrinsic Computational Difficulty of Functions , 1969 .

[4] G. Sacks. Higher recursion theory , 1990 .

[5] Joel David Hamkins,et al. Infinite Time Turing Machines , 2000 .

[6] Samuel R. Buss,et al. Safe Recursive Set Functions , 2015, J. Symb. Log..

[7] Ralf Schindler,et al. P≠NP for Infinite Time Turing Machines , 2003 .

[8] Joel David Hamkins,et al. P != NP cap co-NP for Infinite Time Turing Machines , 2005, J. Log. Comput..

[9] Patrick Saint-Dizier,et al. Review of Prolog and natural-language analysis: CSLI lecture notes 10 by Fernando C. N. Pereira and Stuart M. Shieber. Center for the Study of Language and Information 1987. , 1988 .

[10] Arnold Beckmann. Cobham Recursive Set Functions and Weak Set Theories , 2017 .

[11] Toshiyasu Arai,et al. Predicatively computable functions on sets , 2012, Arch. Math. Log..

[12] R. Jensen,et al. The fine structure of the constructible hierarchy , 1972 .

[13] Peter Aczel,et al. Non-well-founded sets , 1988, CSLI lecture notes series.

[14] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.