scholarly journals Computing intercorrelations of tests on the adding machine.

1922 ◽  
Vol 6 (2) ◽  
pp. 172-184 ◽  
Author(s):  
H.A. Toops
Keyword(s):  
The Adding Machine

As the adding machine once said…

Wilmott ◽  
2005 ◽  
Vol 2005 (1) ◽  
pp. 2-2 ◽  
Author(s):  
Paul Wilmott
Keyword(s):  
The Adding Machine

Rice, Elmer: The Adding Machine

2020 ◽  
pp. 1-2
Author(s):  
Jerôme von Gebsattel ◽  
Nadja Gernalzick
Keyword(s):  
The Adding Machine

The Adding Machine: Selected Essays

1987 ◽  
Vol 61 (2) ◽  
pp. 288
Author(s):  
Michael Leddy ◽  
William S. Burroughs
Keyword(s):  
The Adding Machine

scholarly journals Remember the Adding Machine

2003 ◽  
Vol 125 (09) ◽  
pp. 50-52
Author(s):  
Jeffrey Winters
Keyword(s):  
Carbon Nanotubes ◽  
Molecular Level ◽  
Random Access ◽  
Random Access Memory ◽  
Floppy Disk ◽  
Single Atom ◽  
Development Work ◽  
Access Memory ◽  
Van Der Waals Attraction ◽  
The Adding Machine

This article illustrates research and development work in nanotechnology for manufacturing computers at the molecular level. Computers have gone from large and mechanical, like Babbage's Difference Engine, to molecular. Researchers have shown that carbon nanotubes can be strung across electrodes to make minute transistors. Beyond sheer density of data, the nanotube chips have another, perhaps even more important, potential advantage over their electronic rivals: the memory does not disappear when the power goes off. The tubes may be drawn to the electrode by an electrical attraction, but they are held there by van der Waals attraction, a sort of molecular-level suction. In that way, an electromechanical memory chip will have more in common with a computer hard drive or floppy disk than with random access memory. Physicist Paul McEuen and his colleagues at Cornell have fabricated a transistor that passes signals through a single atom.

AN ITERATED FUNCTION SYSTEM FOR THE CLOSURE OF THE ADDING MACHINE GROUP

Fractals ◽  
2015 ◽  
Vol 23 (03) ◽  
pp. 1550033 ◽  
Author(s):  
MUSTAFA SALTAN ◽  
BÜNYAMİN DEMİR
Keyword(s):  
Automorphism Group ◽  
Iterated Function System ◽  
Rooted Tree ◽  
Function System ◽  
Similar Group ◽  
Machine Group ◽  
Iterated Function ◽  
Self Similar ◽  
The Adding Machine

In this paper, first we equip the automorphism group of the p-ary rooted tree X* with a natural metric and define a family of contractions on Aut(X*). Then, we construct an iterated function system (IFS) whose attractor is the closure of the adding machine group on Aut(X*). Finally, we show that this group is a strong self-similar group in the sense of IFS.

Imagery and the Adding-Machine

1944 ◽  
Vol 6 (1) ◽  
pp. 6
Author(s):  
Rachel M. Hannon
Keyword(s):  
The Adding Machine
Sign in / Sign up

Export Citation Format

Share Document