集值非布尔切换函数的实现

[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic Pub Date : 1991-05-26 DOI:10.1109/ISMVL.1991.130723

C. Reischer, D. Simovici

{"title":"集值非布尔切换函数的实现","authors":"C. Reischer, D. Simovici","doi":"10.1109/ISMVL.1991.130723","DOIUrl":null,"url":null,"abstract":"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.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On the implementation of set-valued non-Boolean switching functions\",\"authors\":\"C. Reischer, D. Simovici\",\"doi\":\"10.1109/ISMVL.1991.130723\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.<<ETX>>\",\"PeriodicalId\":127974,\"journal\":{\"name\":\"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1991.130723\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1991.130723","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

研究了基于发动机与衬底相互作用的生物计算。给出了实现集值函数的生物电路的复杂度的上界。这个界是基于附在集值函数上的等价，使得定义定义域的商集的类对这样的等价符合极大集，在极大集上该函数可以通过计算布尔函数的值来求值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the implementation of set-valued non-Boolean switching functions

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量