Can algorithms of arbitrarily worse complexity be systematically created?
Yes, of course.  $2^{f(n)}$ is asymptotically larger than $f(n)$, so you can come up with an unending sequence of larger and larger running times.

The answer to your other questions are also yes, by the time hierarchy theorem.