Lower Elementary Recursive Functions
Lower elementary recursive functions follow the definitions as above, except that bounded product is disallowed. That is, a lower elementary recursive function must be a zero, successor, or projection function, a composition of other lower elementary recursive functions, or the bounded sum of another lower elementary recursive function.
Whereas elementary recursive functions have potentially exponential growth, and comprise the exponential hierarchy, the lower elementary recursive functions have polynomial growth.
Read more about this topic: ELEMENTARY
Famous quotes containing the words elementary and/or functions:
“When the Devil quotes Scriptures, it’s not, really, to deceive, but simply that the masses are so ignorant of theology that somebody has to teach them the elementary texts before he can seduce them.”
—Paul Goodman (1911–1972)
“Let us stop being afraid. Of our own thoughts, our own minds. Of madness, our own or others’. Stop being afraid of the mind itself, its astonishing functions and fandangos, its complications and simplifications, the wonderful operation of its machinery—more wonderful because it is not machinery at all or predictable.”
—Kate Millett (b. 1934)