doorgaan naar inhoud
Addition machines Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Addition machines

Auteur: Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
Uitgever: Stanford, Calif. : Dept. of Computer Science, Stanford University, 1989.
Serie: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Editie/Formaat:   Boek : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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.  Meer lezen...

Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
OCLC-nummer: 20244230
Opmerkingen: 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"--P. 1.
Beschrijving: 15 p. ; 28 cm.
Serietitel: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Verantwoordelijkheid: by Robert W. Floyd and Donald E. Knuth.

Fragment:

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.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.

Vergelijkbare items

Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<http://www.worldcat.org/oclc/20244230>
library:oclcnum"20244230"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/20244230>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/872634>
rdf:typeschema:Intangible
schema:name"Computer storage devices"
schema:name"Computer storage devices."
schema:about
schema:about
schema:about
schema:author
schema:contributor
schema:contributor
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."
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}"
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."
schema:description"An addition machine is a computing device with a finite number of registers, limited to the following six types of operations."
schema:exampleOfWork<http://worldcat.org/entity/work/id/10588>
schema:inLanguage"en"
schema:name"Addition machines"
schema:numberOfPages"15"
schema:publisher
rdf:typeschema:Organization
schema:name"Dept. of Computer Science, Stanford University"

Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.