Difference between revisions of "Complexity Zoo:K"
(No class starting with K? Must fix that.)
m (1 revision: Complexity zoo import.)
Latest revision as of 22:10, 17 November 2012
 K: Feasibly recursive functions
A class of number-theoretic functions, defined as the closure of basic integer arithmetic operations (, as well as constants 0, 1, and projections) under composition and polynomially long sums and products. Defined by [Con73], who mistakenly claimed it coincides with FP.