Re: all permutations

Article View: comp.lang.prolog

Article #3611

#3611

From: Thom Fruehwirth
Date: Fri, 26 Aug 1988 14:01

15 lines
1112 bytes

In a recent posting on the topic Richard O'Keefe corrected my claim that
the version I presented is "much faster and shorter" (I meant "(much
faster) and shorter" not "much (faster and shorter)").

I have to agree with him. I wasn't careful enough when comparing the two
different versions (the other one by Tarau). It also seems that certain
operations (cut, unifying, clause selection), especially their timings,
depend heavily on the Prolog implementation one uses. (mine is AAIS
Prolog on the Macintosh). So one (including me) has to be carefull with
"absolute" claims. You can only be sure that something is the case in
your specific hardware/software configuration.

Thanks to Richard for pointing that out.

Thom

Technical Details

Message-ID: <1180@tuhold>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!amdcad!sun!pitstop!sundc!seismo!uunet!mcvax!tuvie!tuhold!thom

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!amdcad!sun!pitstop!sundc!seismo!uunet!mcvax!tuvie!tuhold!thom
From: thom@tuhold (Thom Fruehwirth)
Newsgroups: comp.lang.prolog
Subject: Re: all permutations
Message-ID: <1180@tuhold>
Date: 26 Aug 88 14:01:02 GMT
Organization: Institut f. Angewandte Informatik, TU Vienna
Lines: 15