Type-two Iteration with Bounded Query Revision
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we consider functionals which capture iteration on input length which...
Main Authors: | Bruce M. Kapron, Florian Steinberg |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1908.04923v1 |
Similar Items
-
Size and treewidth bounds for conjunctive queries.
by: Gottlob, G, et al.
Published: (2009) -
Bounds for the query complexity of approximate equilibria
by: Goldberg, PW, et al.
Published: (2016) -
Query lower bounds for log-concave sampling
by: Chewi, Sinho, et al.
Published: (2024) -
Lower bounds for the query complexity of equilibria in Lipschitz games
by: Goldberg, PW, et al.
Published: (2023) -
First-order query evaluation on structures of bounded degree
by: Wojciech Kazana, et al.
Published: (2011-06-01)