Proper complexity function

Proper complexity function

A proper complexity function is a function f mapping a natural number to a natural number such that:

  • f is nondecreasing;
  • there exists a k-string Turing machine M such that on any input of length n, M halts after O(n + f(n)) steps, uses O(f(n)) spaces, and output s f(n) consecutive blanks.

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.

Search another word or see Proper complexity functionon Dictionary | Thesaurus |Spanish
Copyright © 2015, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature