Constructible Function
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.
Read more about Constructible Function: Time-constructible Definitions, Space-constructible Definitions, Examples, Applications
Famous quotes containing the word function:
“Think of the tools in a tool-box: there is a hammer, pliers, a saw, a screwdriver, a rule, a glue-pot, nails and screws.—The function of words are as diverse as the functions of these objects.”
—Ludwig Wittgenstein (1889–1951)