Is Landau's Prime Ideal Theorem effective? It seems clear that bounds of the strongest kind known on the error term cannot be made fully effective, due to the possibility of Siegel zeroes. At the same time, it seems hard to believe that an effective version in the style of Page's theorem on the prime numbers within $[1,x]$ in arithmetic progressions of length $\ll (\log x)^{2-\epsilon}$ isn't possible.
I am asking for an effective proof of the asymptotic statement, not, as I've just said, of the best known error term.