Referenced Items are not available for this document.
Necessary and sufficient conditions that a Boolean function be universal, are established. It is demonstrated that most functions are in fact universal; thus, almost any function is a candidate for building the combinational logic of all computers.
Published in:
Electronic Computers, IEEE Transactions on
(Volume:EC-14
,
Issue:
5
)
Date of Publication: Oct. 1965
- Page(s):
- 720 - 721
- ISSN :
- 0367-7508
- Digital Object Identifier :
- 10.1109/PGEC.1965.264213
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 26 December 2006
- Issue Date :
- Oct. 1965
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
