著者： Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department. Stanford, Calif. : Dept. of Computer Science, Stanford University, 1989. Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254. 打印图书 : 英语查看所有的版本和格式 An addition machine is a computing device with a finite number of registers, limited to the following six types of operations.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.  再读一些... (尚未评估) 0 附有评论 - 争取成为第一个。

## 详细书目

文档类型 图书 Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department. 查找更多有关下列内容的信息： Robert W Floyd Donald Ervin Knuth 20244230 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. 15 pages ; 28 cm. Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254. by Robert W. Floyd and Donald E. Knuth.

### 摘要：

An addition machine is a computing device with a finite number of registers, limited to the following six types of operations.

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.

## 链接数据

### Primary Entity

a schema:CreativeWork, schema:Book ;
library:oclcnum "20244230" ;
library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/10588#Place/stanford_calif> ; # Stanford, Calif.
schema:about <http://id.worldcat.org/fast/872634> ; # Computer storage devices
schema:about <http://id.worldcat.org/fast/1093238> ; # Registers (Computers)
schema:bookFormat bgn:PrintBook ;
schema:contributor <http://experiment.worldcat.org/entity/work/data/10588#Organization/stanford_university_computer_science_department> ; # Stanford University. Computer Science Department.
schema:contributor <http://viaf.org/viaf/7466303> ; # Donald Ervin Knuth
schema:creator <http://viaf.org/viaf/9939181> ; # Robert W. Floyd
schema:datePublished "1989" ;
schema:description "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."@en ;
schema:description "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}"@en ;
schema:description "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."@en ;
schema:description "An addition machine is a computing device with a finite number of registers, limited to the following six types of operations."@en ;
schema:exampleOfWork <http://worldcat.org/entity/work/id/10588> ;
schema:inLanguage "en" ;
schema:isPartOf <http://experiment.worldcat.org/entity/work/data/10588#Series/report_stanford_university_computer_science_department> ; # Report (Stanford University. Computer Science Department) ;
schema:isPartOf <http://experiment.worldcat.org/entity/work/data/10588#Series/report_stanford_university_computer_science_dept> ; # Report / Stanford University. Computer Science Dept. ;
schema:productID "20244230" ;
schema:publication <http://www.worldcat.org/title/-/oclc/20244230#PublicationEvent/stanford_calif_dept_of_computer_science_stanford_university_1989> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/10588#Agent/dept_of_computer_science_stanford_university> ; # Dept. of Computer Science, Stanford University
wdrs:describedby <http://www.worldcat.org/title/-/oclc/20244230> ;
.

### Related Entities

<http://experiment.worldcat.org/entity/work/data/10588#Agent/dept_of_computer_science_stanford_university> # Dept. of Computer Science, Stanford University
a bgn:Agent ;
schema:name "Dept. of Computer Science, Stanford University" ;
.

<http://experiment.worldcat.org/entity/work/data/10588#Organization/stanford_university_computer_science_department> # Stanford University. Computer Science Department.
a schema:Organization ;
schema:name "Stanford University. Computer Science Department." ;
.

<http://experiment.worldcat.org/entity/work/data/10588#Place/stanford_calif> # Stanford, Calif.
a schema:Place ;
schema:name "Stanford, Calif." ;
.

<http://experiment.worldcat.org/entity/work/data/10588#Series/report_stanford_university_computer_science_department> # Report (Stanford University. Computer Science Department) ;
a bgn:PublicationSeries ;
schema:hasPart <http://www.worldcat.org/oclc/20244230> ; # Addition machines
schema:name "Report (Stanford University. Computer Science Department) ;" ;
.

<http://experiment.worldcat.org/entity/work/data/10588#Series/report_stanford_university_computer_science_dept> # Report / Stanford University. Computer Science Dept. ;
a bgn:PublicationSeries ;
schema:hasPart <http://www.worldcat.org/oclc/20244230> ; # Addition machines
schema:name "Report / Stanford University. Computer Science Dept. ;" ;
.

<http://id.worldcat.org/fast/1093238> # Registers (Computers)
a schema:Intangible ;
schema:name "Registers (Computers)"@en ;
.

<http://id.worldcat.org/fast/872634> # Computer storage devices
a schema:Intangible ;
schema:name "Computer storage devices"@en ;
.

<http://viaf.org/viaf/7466303> # Donald Ervin Knuth
a schema:Person ;
schema:birthDate "1938" ;
schema:familyName "Knuth" ;
schema:givenName "Donald Ervin" ;
schema:name "Donald Ervin Knuth" ;
.

<http://viaf.org/viaf/9939181> # Robert W. Floyd
a schema:Person ;
schema:familyName "Floyd" ;
schema:givenName "Robert W." ;
schema:name "Robert W. Floyd" ;
.

Content-negotiable representations