Time complexity of a language whose alphabet has a single symbol
The language $\{a^n : \text{ the $n$th Turing machine halts on the empty string} \}$ is undecidable.

In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.