Proper complexity function
A proper complexity function is a function f mapping a natural number to a natural number such that:
If f and g are two proper complexity functions, then f + g, fg, and 2f, are also proper complexity functions.
Similar notions include honest function, space-constructible function, and time-constructible function.
