Thorsten Froehlich <tho### [at] trfde> wrote:
> No, every possible one! -- You remember what Warp keeps telling everybody
> about the POV-SDL whenever the "not a universal scripting language" argument
> comes up, don't you?

  Well, there are problems which are mathematically unsolvable (and thus
also unsolvable with a Turing-strong language - meaning that it would take
an infinite amount of time to solve it).
  Also problems belonging to the NP set of problems are usually too
complex to solve in an acceptable amount of time and/or memory (which
usually means in practice that all possible combinations have to be
checked for the solution (or best solution) to be found, that is, an
exponential amount of cases). If we think about the image as being a
graph (where each pixel is a node connected to 4 or 8 adjacent pixels),
one can easily come up with such problems.

  So "every possible one" is not strictly true. :)

-- 
#macro M(A,N,D,L)plane{-z,-9pigment{mandel L*9translate N color_map{[0rgb x]
[1rgb 9]}scale<D,D*3D>*1e3}rotate y*A*8}#end M(-3<1.206434.28623>70,7)M(
-1<.7438.1795>1,20)M(1<.77595.13699>30,20)M(3<.75923.07145>80,99)// - Warp -

Post a reply to this message