We investigate two conjectured spectral graph theoretic strengthenings of Turán's theorem. Let $μ_1 \ge \ldots \ge μ_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $ω(G)$. The concise version of Turán's theorem is that $n/(n - d)$ is a lower bound for the clique number $ω(G)$, where $d$ is the average degree. Our first conjecture is that $d$ can be replaced in this bound with $\sqrt{s^+}$, where $s^+$ is the sum of the squares of the positive eigenvalues. We prove this conjecture for triangle-free, weakly perfect and Kneser graphs and for almost all graphs. We have also used various software tools to search for a counter-example. Nikiforov proved a spectral version of Turán's theorem that \[ μ_1^2 \le \frac{2m(ω(G) - 1)}{ω(G)}, \] and Bollobás and Nikiforov conjectured that for $G \not = K_n$ \[ μ_1^2 + μ_2^2 \le \frac{2m(ω(G) - 1)}{ω(G)}. \] For our second conjecture, we propose that for all graphs $(μ_1^2 + μ_2^2)$ in this inequality can be replaced by the sum of the squares of the $ω(G)$ largest eigenvalues, provided they are positive. We prove the conjecture for weakly perfect, Kneser, and classes of strongly regular graphs. We also provide experimental evidence and describe how the bound can be applied. Liu and Ning published a wide-ranging paper entitled ``Unsolved Problems in spectral graph theory'', and these two conjectures were placed second and fourth in their list of such problems.