A function is said to be constructible if some algorithm computes it, in binary, within volume , i.e., . Here, the volume is the combined number of active edges during all steps, which is the number of state-changes needed to run a certain Turing machine on a particular input.
Constructible Function
See also
Computable Function, Rabin's Compression TheoremExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Constructible Function." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ConstructibleFunction.html