home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mitech!gjc
- From: gjc@mitech.com (George J. Carrette)
- Newsgroups: sci.math.symbolic
- Subject: Re: The Real Meaning of Efficiency? (Re: Serious Programming, etc.)
- Message-ID: <3701@mitech.com>
- Date: 20 Nov 92 18:02:21 GMT
- References: <18NOV199217533011@reg.triumf.ca> <1egjolINNk2e@agate.berkeley.edu>
- Distribution: world
- Organization: Mitech Corporation, Concord MA
- Lines: 32
-
- In article <1egjolINNk2e@agate.berkeley.edu>, fateman@peoplesparc.Berkeley.EDU (Richard Fateman) writes:
- > In my view one of the most powerful abstractions for programming
- > mathematical algorithms is recursion. If a user writes a recursive
- > program in Mathematica, it appears that there is an enormous
- > efficiency penalty, at least compared to using built-in Map-like
- > commands. This is quite unfortunate.
-
- Well, the C language implementations available pretty much have
- the same overhead problem. Recursion being a lot more expensive
- than an iteration.
-
- So it is truly amusing that something like Mathematica has the same problem.
- Especially considering how so many people think of it as
- being so "high-level"
-
- Maybe there there is some deep philosophical reason for this?
-
- > digression ...
- > When IBM came out with the IBM-360 design in the mid 1960s, they
- > missed the boat on recursion and subroutine calling generally.
- > Some people think the IBM 360 set back the progress of programming
- > languages by 10 years or more.
- >
-
- Do you right tight, modular code, with lots of subroutines and data-driven
- or object-oriented techniques?
-
- You are going to get killed on the latest a RISC machines, as compared
- with how fast the straightline-coded standard benchmark fair
- will run.
-
- -gjc
-