Knuth
Donald Ervin
Donald Ervin Knuth
1938
Floyd
Robert W.
Robert W. Floyd
Report / Stanford University. Computer Science Dept. ;
en
20244230
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.
20244230
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}
Addition machines
1989
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.
An addition machine is a computing device with a finite number of registers, limited to the following six types of operations.
Arithmetik
Dept. of Computer Science, Stanford University
1989
Rechenwerk
Stanford University. Computer Science Department.
Stanford, Calif.
Registers (Computers)
Computer storage devices
cau
2016-05-10
Report (Stanford University. Computer Science Department) ;