## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department. |

OCLC Number: | 20244230 |

Notes: | Cover title. "April 1989." "This research was supported in part by the National Science Foundation under grant CCR-86-10181, and by Office of Naval Research contract N00014-87-K-0502"--Page 1. |

Description: | 15 pages ; 28 cm. |

Series Title: | Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254. |

Responsibility: | by Robert W. Floyd and Donald E. Knuth. |

### Abstract:

Read x {input to register x} x <-- y {copy register y to register x} x <-- x + y {add register y to register x} x <-- x - y {subtract register y from register x} if x>= y {compare register x to register y} write x {output from register x}

The register contents are assumed to belong to a given set A, which is an additive subgroup of the real numbers. If A is the set of all integers, we say the device is an integer addition machine; if A is the set of all real numbers, we say the device is a real addition machine.

We will consider how efficiently an integer addition machine can do operations such multiplication, division, greatest common divisor, exponentiation, and sorting. We will also show that any addition machine with at least six registers can compute the ternary operation x[y/z] with reasonable efficiency, given x, y, z in A with z not equal to 0.

## Reviews

*User-contributed reviews*