[Gllug] Best option for a lot of compute power

[Bernard Peek]

In message <20040607143848.GE6325 at pigeonhold.com>, Doug Winter 
<doug at pigeonhold.com> writes
>On Mon 07 Jun Tethys wrote:
>>
>> Richard Jones writes:
>>
>> >Seriously though, have you looked at using a declarative language to
>> >search through the space?  Prolog being the obvious choice.
>>
>> Yep, that was my first thought, too. Languages like Prolog are great
>> at calculating best fit scenarios[1]. I'm also completely astounded that
>> anyone could seriously believe that calculating a school time table would
>> require significant amounts of compute power.
>
>Sounds NP-Complete to me, so presumably could involve an exhaustive
>search, which could take a very very long time otherwise?

I've heard it quoted as an example of a problem that can't currently be 
solved by anything except a brute-force approach.



-- 
Bernard Peek
London, UK. DBA, Manager, Trainer & Author. Will work for money.

-- 
Gllug mailing list  -  Gllug at gllug.org.uk
http://lists.gllug.org.uk/mailman/listinfo/gllug