omitir hasta el contenido
Addition machines Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Addition machines

Autor: Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
Editorial: Stanford, Calif. : Dept. of Computer Science, Stanford University, 1989.
Serie: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Edición/Formato:   Libro : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:
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.  Leer más

Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de documento: Libro/Texto
Todos autores / colaboradores: Robert W Floyd; Donald Ervin Knuth; Stanford University. Computer Science Department.
Número OCLC: 20244230
Notas: 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.
Descripción: 15 p. ; 28 cm.
Título de la serie: Report (Stanford University. Computer Science Department), no. STAN-CS-89-1254.
Responsabilidad: by Robert W. Floyd and Donald E. Knuth.

Resumen:

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.

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.

Materiales similares

Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.