Time-constructible function

From Complexity
Revision as of 02:18, 28 December 2011 by Vipul (talk | contribs) (Created page with "==Definition== A '''time-constructible function''' is a function <math>f</math> from the set of natural numbers to itself such that there exists a Turing machine that takes ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

A time-constructible function is a function f from the set of natural numbers to itself such that there exists a Turing machine that takes as input n and outputs f(n) in time O(f(n)).

Any function that bounds from above the time taken by a Turing machine must be a time-constructible function.