Universal Boolean Systems | Zendy

Denis Béchet | Zendy; Sylvain Lippi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Universal Boolean Systems

Author(s) -

Denis Béchet,

Sylvain Lippi

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.03.031

Subject(s) - combinatory logic , boolean circuit , nand gate , computer science , boolean expression , theoretical computer science , set (abstract data type) , boolean network , state (computer science) , product term , task (project management) , boolean function , logic gate , two element boolean algebra , algorithm , mathematics , programming language , algebra over a field , pure mathematics , filtered algebra , management , economics

Boolean interaction systems and hard interaction systems define nets of interacting cells. They are based on the same local interaction principle between two cells as interaction nets but do not allow that the structure of nets may evolve. With boolean nets, it is not possible to create or destroy cells or links between existing cells. They are very similar to hardware circuits but based on an implicit rendez-vous information exchange mechanism.If we want to implement such systems using hardware circuits, it is important to define a set of universal combinators that reduces this task to the implementation of a fixed number of known agents. Here, we show how we can simulate every hard interaction system by a universal boolean interaction system composed of three combinators: a duplicator, a NAND gate and a three-state input/output channel

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research