Meta-computational complexity?
The meta-problem $\mathcal P$ is: Given a problem $P\in \mathcal P$, find a (Turing) machine that solves $P$, optimized for some resource constraints $C(P)$.


It's undecidable* whether a given Turing machine even solves&nbsp;$P$, let alone whether it's optimal according to some criterion.  Since your problem isn't computable even without resource bounds, there isn't really any scope for complexity theory.

And how are you going to specify the problem&nbsp;$P$ anyway, except by giving some Turing machine?

* Off the top of my head, probably not even recursively enumerable.