Re: Computing in finite fields: what programming langage to choose?
- From: "L7" <jesse.r.brown@xxxxxxxxx>
- Date: 5 Sep 2006 10:42:54 -0700
xarnaudx@xxxxxxxxx wrote:
hi,
i've some work to do concerning computing in finite fields and i would
like to know what programming language would fit the best.
I must be able to create fields and manipulate their elements:
ans = alpha^4 + alpha^7
ans = 01011 * 12012 (characteristic not always 2)
Also i must be able to play with polynomials:
F(X) = 01011 * X^2 + alpha^5 * X + 12121
...and also on a higher levels:
F(Z) = Sum(a:A) Product(b:B, b!=a) (G(a) * Z + H(b))
So now the question is: what programming language fits the best for
these type of calculus?
lambda calculus: http://en.wikipedia.org/wiki/Lambda_calculus
Haskell: http://www.haskell.org/haskellwiki/Haskell
OCaml (maybe): http://caml.inria.fr/ocaml/index.en.html
.
- References:
- Prev by Date: Re: A serious question about programmability of jokes
- Next by Date: Where do my packets go
- Previous by thread: Re: Computing in finite fields: what programming langage to choose?
- Next by thread: Re: Computing in finite fields: what programming langage to choose?
- Index(es):
Relevant Pages
|
