Given that our problem seems quite difficult, let us focus on a simpler problem. Consider the equation
, or the entire plane, if c(x,y) = 0.
After a suitable formalization, this problem may be proven
to be non-computable, unless a very restricted set of operators
is allowed in the construction of c:
for any fixed computer program, there will
be equations which it cannot graph correctly.
| Jeff Tupper | March 1996 |