Re: [Maxima-discuss] ​Re: in case you find yourself in Portland

[Robert D. <rob...@gm...>]

On 2015-07-01, Marduk Bolaños <mar...@ma...> wrote:

> I think that the developers of Computer Algebra Systems have to start
> working on automating the process of implementing symbolic algorithms in
> a similar vein to FLAME (http://www.cs.utexas.edu/~flame/web/). That
> would allow implementing every algorithm in every CAS with a
> considerable reduction of effort. One of the most interesting outcomes
> of the FLAME project is the language-independent representation of
> algorithms in XML and the development of a source-to-source translator
> that generates code in any programming language.

Well, my own pet project for the automated reasoning (in the spirit of
Leibniz) is an implementation of decision networks, which are
declarative models comprising Bayesian belief networks for the belief
part and utility functions for the preference or value part. The general
idea is that one sets up a model that expresses how one believes the
world works, then to answer any question (inferential or decision) one
simply has to turn the crank -- "calculemus". The crank-turning
generically involves computing integrals and has all the usual problems
associated with that.

I'm a big fan of declarative models in general -- much easier to express
how things work and then ask an automated tool to derive inferences from
that.

For what it's worth,

Robert Dodier