associative operation

A Dictionary of Computing | 2004 | 700+ words | Copyright

associative operation Any dyadic operation ◦ that satisfies the law x ◦ (y ◦ z) = (x ◦ y) ◦ z

for all x, y, and z in the domain of ◦. The law is known as the associative law. An expression involving several adjacent instances of an associative operation can be interpreted unambiguously; the order in which the operations are performed is irrelevant since the effects of different evaluations are identical, though the work involved may differ. Consequently parentheses are unnecessary, even in more complex expressions.

The arithmetic operations of addition and multiplication are associative, though subtraction is not. On a computer the associative law of addition of real numbers fails to hold because of the inherent inaccuracy in the way real numbers are usually represented (see floating-point notation), and the addition of integers fails to hold because of the possibility of overflow.

Cite this article
Pick a style below, and copy the text for your bibliography.

MLA
Chicago
APA

JOHN DAINTITH. "associative operation." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "associative operation." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-associativeoperation.html

JOHN DAINTITH. "associative operation." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-associativeoperation.html

Learn more about citation styles