How is the non-existence of a solution proven? I've been wondering how an argument that a solution to a particular problem doesn't exist is put together. 
For instance "Pour-El and Richards found an ordinary differential equation $\phi'(t)=F(t,\phi(t))$ with $F$ computable and no computable solution."
Another puzzling example is the non-computability of Chaitin's constant. 
I'm not talking about trivial examples, e.g. the DE $f(x)=f(x)+1$.
Could you give examples of outlines of such proofs? The only strategy I can think of is showing that the assumption that a solution exists leads to a contradiction, but surely there are more sophisticated ways than this?
EDIT: In case it wasn't clear (it probably wasn't), I also would examples of proof strategies involved in proving the non-existence of solutions to, for instance, DEs. The reason my examples focuses on computability is because I couldn't find any examples of the non-existence.
 A: It sounds like you're asking how you tell that a given object (solution to a DE, Chaitin's constant, etc.) is not computable, not that it doesn't exist. Indeed, the point is that these things do exist, and can be proved to be pretty weird. So let me talk a bit about how you show that something is not computable.
The easiest way to show that a function $f$ is incomputable is to exhibit - for each computable function $c$ - a value $n$ such that $f(n)\not=c(n)$. For example, let $\varphi_i$ be some canonical listing of all partial computable functions, and define $f(n)$ to be $\varphi_n(n)+1$, if $\varphi_n(n)$ is defined, and $0$ otherwise. Then immediately by definition $f$ is not computable!
Sometimes the argument along these lines is more involved - for instance, to show that the halting function $g$ (given by $g(n)=0$ if $\varphi_n(n)$ is defined, and $1$ otherwise) is not computable, we need to talk about constructing machines: if such a $g$ were computable, it would be $\varphi_k$ for some $k$. Now show that there is a computable $j$ such that $\varphi_j(i)$ is $1$ if $\varphi_k(i)=0$ and is undefined otherwise, and think about $\varphi_j(j)$ . . .
There is also coding. If I've already shown that some $f$ is not computable, then I can show that a function $\hat{f}$ is not computable by "reducing" $f$ to $\hat{f}$: showing how I can compute $f$ "relative to" $\hat{f}$. Since $f$ is not computable, neither is $\hat{f}$. This can be made precise - see "oracle Turing machines." 
