Running time is asymptotically tight bound. "Asymptotically" because it matters for only large values of nnn. "Tight bound" because we've nailed the running time to within a constant factor above and below.

Running time has lower bound and upper bound once the number of computations get large enough.

Computation takes time to run. The notation used for running time of computations is Big-Theta.