Is there a function $f(x)$ and a constant $k$ so that $f(x-k) \neq O(f(x))$?
If it exist, what is the function, and if it doesn't, what is the proof to that?
My intuition is that big O refers to the worst case, meaning worst x, so no constant should have a significant effect on the time complexity, but I'm not sure at all, and I'm struggling to write it formally.
As Christian Blatter commented, let $f(x)=e^{-x^2}$. Then $$ \begin{align} f(x-k) &=e^{-(x-k)^2}\\ &=e^{2kx-k^2}e^{-x^2}\\ &=e^{2kx-k^2}f(x) \end{align} $$ That is, for $k\gt0$, $\frac{f(x-k)}{f(x)}$ grows without bound as $x\to\infty$.
This means that $f(x-k)\not\in O(f(x))$.