MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Why is recursion so slow in Mathematica?


I am not in favor of writing things in assembler. In fact, with a JIT-
compiler high-level code is sometimes *faster* than compiled code in
practical circumstances. The reason is that the compilation can be
optimized for the machine at hand in stand of precompiled for all x86
platforms or whatever you have.

Anyways, OCaml is definately a high-level language too so anyone
sticking with that should not feel like a fossil.

All the best,

On 8 Juni, 07:42, DrMajorBob <btre... at> wrote:
> As Szabolcs demonstrated in this case, using the right algorithms and  
> structures makes Mathematica far more competitive with compiled languages=
> like OCaml.
> But the difference in speed between languages is also overwhelmed by time=
> itself.
> IBM Assembler was my first favorite language (1971 or so), and I hauled =
> around card decks a tenth the size of my classmates; I was good at it. Bu=
> there's no way I'd go back to that, just to get more speed in trivial  
> calculations. Mathematica today is a hundred times faster (or more) than =
> Assembler in 1971, and it does a thousand times more FOR me.
> If I had spent 40 years writing Assembler code, I'd have very little to =
> show for it.
> I hope that doesn't become anyone's experience with OCaml.
> Bobby

  • Prev by Date: Re: Coding for Mathematica
  • Next by Date: Re: Coding for Mathematica
  • Previous by thread: Re: Re: Why is recursion so slow in Mathematica?
  • Next by thread: Re: Why is recursion so slow in Mathematica?