Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site randvax.UUCP
Path: utzoo!linus!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!randvax!lseward
From: lseward@randvax.UUCP (Larry Seward)
Newsgroups: net.math.symbolic
Subject: MACSYMA vs. SMP
Message-ID: <2080@randvax.UUCP>
Date: Tue, 30-Oct-84 20:32:53 EST
Article-I.D.: randvax.2080
Posted: Tue Oct 30 20:32:53 1984
Date-Received: Fri, 2-Nov-84 04:02:53 EST
Organization: Rand Corp., Santa Monica
Lines: 21

Forwarded news...

Received: from mit-mc.arpa by rand-unix.ARPA; Mon, 29 Oct 84 11:17:21 pst
Message-Id: <8410291917.AA16013@rand-unix.ARPA>
Date: 29 October 1984 14:16-EDT
From: Jeffrey P. Golden <JPG@MIT-MC>
Subject: MACSYMA vs. SMP

In answer to Jim Purtillo's recent mail:
I have used SMP very little, so I am not a good candidate to answer your 
mail.  It would be nice if people who have ready access to both SMP and 
MACSYMA could come up with some test suites of examples that come up in 
regular use (i.e. not canned examples produced by Inference or Symbolics) 
to compare for capability, ease of use, and speed.
Some classes of examples where I would think MACSYMA would shine over 
SMP include: multivariate factorization, indefinite integration especially 
where the Risch code is used, and problems where exact answers are required.
SMP tends to introduce floating point numbers pretty early in the game.

It would be great if some comparisons could be run by those who have SMP 
and MACSYMA on the same machine.