Modulo n arithmetics

wchsieh@beethoven.lcs.mit.edu (Wilson Hsieh)
Wed, 11 Nov 1992 17:58:14 GMT

          From comp.compilers
Related articles
Modulo n arithmetics fabre@gr.osf.org (Christian Fabre) (1992-11-06)
Re: Modulo n arithmetics pardo@cs.washington.edu (1992-11-10)
Re: Modulo n arithmetics drclark@daisy.uwaterloo.ca (David R. Clark) (1992-11-11)
Re: Modulo n arithmetics dneedham@oucsace.cs.ohiou.edu (1992-11-11)
Modulo n arithmetics wchsieh@beethoven.lcs.mit.edu (1992-11-11)
Re: Modulo n arithmetics wendt@CS.ColoState.EDU (1992-11-15)
Re: Modulo n arithmetics johnr@ee.uts.edu.au (1992-11-17)
Re: Modulo n arithmetics chris@gargoyle.uchicago.edu (1992-11-19)
Re: Modulo n arithmetics tve@crackle.CS.Berkeley.EDU (1992-11-20)
Re: Modulo n arithmetics pcg@aber.ac.uk (1992-11-29)
| List of all articles for this month |
Newsgroups: comp.compilers
From: wchsieh@beethoven.lcs.mit.edu (Wilson Hsieh)
Organization: Compilers Central
Date: Wed, 11 Nov 1992 17:58:14 GMT
Keywords: arithmetic
References: 92-11-029

fabre@gr.osf.org (Christian Fabre) writes:
|> I am wondering if any languages or application heavily rely on
|> modulo arithmetics:


Discrete Fourier transforms do not need to be computed using the
commutative ring of the complex numbers; one can use a commutative
ring of integers modulo some constant.


  - Wilson
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.