Symbolic computing systems are generally very high-level programming environments in their own right. Mathematica, for example, is a functional language, with imperative features mixed in.
Because of the need to be interactive, these languages are interpreted rather than compiled. But in many cases they are not compilable since they contain features that can only be evaluated at run-time.
Since they are interpreted, they will not be as efficient for extremely large problems (involving lots of data).
What algorithms lie under the surface of a symbolic computing system?
CS1104 Main Page
Last Updated 04/16/2000
© L.Heath, 2000, upgraded by J.A.N. Lee.