Remarks on simulation of Boolean functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Remarks on simulation of Boolean functions

Full text

Pdf (127 KB)

Source

Communications of the ACM archive
Volume 8 , Issue 8 (August 1965) table of contents

Page: 517

Year of Publication: 1965

ISSN:0001-0782

Author

George G. Dodd

General Motors Corp., Warren, MI

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references index terms collaborative colleagues

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/365474.365539 What is a DOI?

ABSTRACT

Recently M. Morris Mano presented a method for performing Boolean OR, AND and NOT operations by means of arithmetic and conditional transfer operations in a decimal computer lacking builtin logical instructions [1]. When A, B, C are variables whose defined value is 0 or 1 and a, b, c are the corresponding integer variables with values 0 or 1, his Boolean OR was defined by: “The result of an OR operation of Boolean variables is the same as the arithmetic addition of the a, b, c integer variables after which the following test is made: (a) If the sum is equal to zero, the result is correct; (b) If the sum is larger than zero, the answer is 1.”

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.