A NOTE ON EVENTUALLY COMPUTABLE FUNCTIONS

摘要

The importance of the class of computable (=recursive) functions is well known, both to mathematicians and to computer scientists. The class of number theoretic functions that are "combinatorial" (in the sense that all their Stirling coefficients are nonnegative) has been less widely studied, but nevertheless has played a key role in certain investigations involving computability. Computable functions may or may not be combinatorial, and vice-versa.