Sign inSign in

Time constructible function

A function f(n)f(n) is time constructible if there exists a Turing machine that, given 1n1^n, outputs f(n)f(n) in O(f(n))O(f(n)) time.
as Michael Sipser defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Turing machine3Time complexity2Big O notation1Binary strings1Running time1Turing machine time complexity1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A function t(n)t(n) for which there exists a Turing machine that on inputs of length nn writes out t(n)t(n) symbols.
    • 29:31Hierarchy Theorems (Time, Space, and Nondeterministic)
    • 1:10:00Time Hierarchy Theorem
  • Michael Sipser

    MIT · Undergraduate

    • 2:14Provably Intractable Problems, Oracles

Connections

9

The lectures that define it or assume it, and the concepts next to it.

Concepts5

Lectures4

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.