An analysis by arithmetical methods of a calculating network with feedback

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An analysis by arithmetical methods of a calculating network with feedback

Full text

Pdf (288 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1952 ACM national meeting (Toronto) table of contents

Toronto, Ontario, Canada

Pages: 61 - 67

Year of Publication: 1952

Author

L. C. Robbins

Sponsors

University of Toronto : University of Toronto
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 4, Citation Count: 1

Additional Information:

abstract cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800259.808995 What is a DOI?

ABSTRACT

At the Wayne University meeting of this Association in the spring of 1951, George W. Patterson presented a paper on Reversing Digit Number Systems. Although these systems can be stated with respect to any base, we will be concerned only with the special case of base 2. The reversing representation for base 2 is also called the Gray code, symmetric binary code, and the reflected binary code. It any n, in going from n to n+1 in the reversing system, one and only one digit is changed. But this is not so for the normal (base 2) representation. Secondly, the changed digit differs in absolute value from the original by only one unit. This is automatically satisfied when the base is 2, but is an additional condition to be imposed when the base is greater than 2.

CITED BY

Richard C. Jeffrey, Arithmetical Analysis of Digital Computing Nets, Journal of the ACM (JACM), v.3 n.4, p.360-375, Oct. 1956

INDEX TERMS

Primary Classification:
G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS
G.2.2 Graph Theory
Subjects: Network problems