Referenced Items are not available for this document.
Biological computing based on the interactions between engines and substrate is addressed. An upper bound is given on the complexity of the bio-circuits that realize set-valued functions. This bound is based on an equivalence attached to a set-valued function such that the classes of the quotient set of the definition domain with respect to such an equivalence coincide with the maximal sets on which the function can be evaluated by computing a value of a Boolean function
Published in:
Multiple-Valued Logic, 1991., Proceedings of the Twenty-First International Symposium on
Date of Conference: 26-29 May 1991
- Page(s):
- 166 - 172
- Meeting Date :
- 26 May 1991-29 May 1991
- Print ISBN:
- 0-8186-2145-1
- INSPEC Accession Number:
- 4055286
- Conference Location :
- Victoria, BC
- Digital Object Identifier :
- 10.1109/ISMVL.1991.130723
- Product Type:
- Conference Publications
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.
