Pith. sign in

Cook (1992): Computability and complexity of higher type functions

· 1992 · Mathematical Sciences Research Institute publications · DOI 10.1007/978-1-4612-2822-6

1 Pith paper cite this work, alongside 90 external citations. Polarity classification is still indexing.

1 Pith paper citing it
90 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

cs.CC 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Type-two Iteration with Bounded Query Revision

cs.CC · 2019-08-14 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Type-two Iteration with Bounded Query Revision cs.CC · 2019-08-14 · conditional · none · ref 4

    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.