A SIMPLE OBSERVATION REGARDING ITERATIONS OF FINITE-VALUED POLYNOMIAL-TIME FUNCTIONS
Jerzy Mycka · Reports on Mathematical Logic · 2009
A b s t r a c t. We present this note to point out that the finitevalued polynomial-time computable functions are closed with respect to iteration. This fact is not a difficult result, however it can be useful in constructions not exceeding the class of polynomialtime computable functions.