In complexity theory, a time-constructible function is a function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n). The purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine.^[1]

There are two different definitions of a time-constructible function. In the first definition, a function f is called time-constructible if there exists a positive integer n₀ and Turing machine M which, given a string 1ⁿ consisting of n ones, stops after exactly f(n) steps for all n ≥ n₀. In the second definition, a function f is called time-constructible if there exists a Turing machine M which, given a string 1ⁿ, outputs the binary representation of f(n) in O(f(n)) time (a unary representation may be used instead, since the two can be interconverted in O(f(n)) time).^[1]

There is also a notion of a fully time-constructible function. A function f is called fully time-constructible if there exists a Turing machine M which, given a string 1ⁿ consisting of n ones, stops after exactly f(n) steps.^[2] This definition is slightly less general than the first two but, for most applications, either definition can be used.^[3]

Similarly, a function f is space-constructible if there exists a positive integer n₀ and a Turing machine M which, given a string 1ⁿ consisting of n ones, halts after using exactly f(n) cells for all n ≥ n₀. Equivalently, a function f is space-constructible if there exists a Turing machine M which, given a string 1ⁿ consisting of n ones, outputs the binary (or unary) representation of f(n), while using only O(f(n)) space.^[1]

Also, a function f is fully space-constructible if there exists a Turing machine M which, given a string 1ⁿ consisting of n ones, halts after using exactly f(n) cells.^[2]

All the commonly used functions f(n) (such as n, n^k, 2ⁿ) are time- and space-constructible, as long as f(n) is at least cn for a constant c > 0. No function which is o(n) can be time-constructible unless it is eventually constant, since there is insufficient time to read the entire input. However, ⁠⁠ is a space-constructible function.

Time-constructible functions are used in results from complexity theory such as the time hierarchy theorem. They are important because the time hierarchy theorem relies on Turing machines that must determine in O(f(n)) time whether an algorithm has taken more than f(n) steps. This is, of course, impossible without being able to calculate f(n) in that time. Such results are typically true for all natural functions f but not necessarily true for artificially constructed f. To formulate them precisely, it is necessary to have a precise definition for a natural function f for which the theorem is true. Time-constructible functions are often used to provide such a definition.

Space-constructible functions are used similarly, for example in the space hierarchy theorem.

This article incorporates material from constructible on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.