In article <3d8e3587@news.povray.org>, Warp <war### [at] tagpovrayorg> 
wrote:

>   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. :)

Well, what I really meant was every filter possible to do as a filter 
built-in to POV-Ray. It is "possible" to do any of these in POV-Script, 
it is just that some of them would be utterly impractical or just too 
difficult or slow.

-- 
Christopher James Huff <cja### [at] earthlinknet>
http://home.earthlink.net/~cjameshuff/
POV-Ray TAG: chr### [at] tagpovrayorg
http://tag.povray.org/

Post a reply to this message