For any fixed k, iterators that stop after k length or lookahead revisions are lambda-P equivalent to the Cook-Urquhart recursor over type-one polynomial-time functions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Type-two Iteration with Bounded Query Revision
For any fixed k, iterators that stop after k length or lookahead revisions are lambda-P equivalent to the Cook-Urquhart recursor over type-one polynomial-time functions.