přejít na obsah
Addition machines Náhled dokumentu
ZavřítNáhled dokumentu
Probíhá kontrola...

Addition machines

Autor Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
Vydavatel: Stanford, Calif. : Dept. of Computer Science, Stanford University, 1989.
Edice: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Vydání/formát:   Kniha : EnglishZobrazit všechny vydání a formáty
Databáze:WorldCat
Shrnutí:
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.  Přečíst více...

Hodnocení:

(ještě nehodnoceno) 0 zobrazit recenze - Buďte první.

Předmětová hesla:
Více podobných

 

Vyhledat exemplář v knihovně

&AllPage.SpinnerRetrieving; Vyhledávání knihoven, které vlastní tento dokument...

Detaily

Typ dokumentu: Book
Všichni autoři/tvůrci: Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
OCLC číslo: 20244230
Poznámky: 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.
Popis: 15 p. ; 28 cm.
Název edice: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Odpovědnost: by Robert W. Floyd and Donald E. Knuth.

Anotace:

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.

Recenze

Recenze vložené uživatelem
Nahrávání recenzí GoodReads...
Přebírání recenzí DOGO books...

Štítky

Buďte první.

Podobné dokumenty

Potvrdit tento požadavek

Tento dokument jste si již vyžádali. Prosím vyberte Ok pokud chcete přesto v žádance pokračovat.

Propojená data


<http://www.worldcat.org/oclc/20244230>
library:oclcnum"20244230"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/20244230>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/872634>
rdf:typeschema:Intangible
schema:name"Computer storage devices"@en
schema:name"Computer storage devices."@en
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:creator
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:name"Addition machines"@en
schema:numberOfPages"15"
schema:publisher
schema:url

Content-negotiable representations

Zavřít okno

Prosím přihlaste se do WorldCat 

Nemáte účet? Můžete si jednoduše vytvořit bezplatný účet.