Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,593 of 10,432    |
|    Richard Fateman to bursejan@gmail.com    |
|    Re: Blinding Fast GB in Prolog (not yet     |
|    05 Aug 17 16:29:40    |
      From: fateman@cs.berkeley.edu              On 8/5/2017 9:49 AM, bursejan@gmail.com wrote:       > Its not yet confirmed, [...].              I could not find the reference to this timing in the "pac" package,       though there is material that seems to be a gb() program.       Is it possible to provide a more specific reference?              The program appears to use multi-dimensional arrays and       array indexing, features in SWI-Prolog. SWI-Prolog also       provides other non-standard Prolog features, like linking       to C programs. Once you are willing to add essentially       alien features to a "Prolog" system, many things become       easier, and this is probably natural if you are committed       to Prolog as part of your language syntax, but want to       make it "industrial strength".              I am going to guess that Bursejan's prolog (Jekejeke)       cannot run these programs without adding such       features from SWI-Prolog        and that is why this timing is "not yet confirmed".              Once you start adding features, as mentioned earlier,       you could simply call a conventionally-programmed CAS       and be done with it.              RJF              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca