Universal Boolean systems

DOI10.1016/J.ENTCS.2008.03.031MaRDI QIDQ2870310zbMATH OpenOpenAlexFDO

Authors Denis Béchet, Sylvain Lippi

Publication date 17 January 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.03.031

zbMATH Keywords

Boolean interaction systemcombinatorhard interaction systeminteraction netuniversal system

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Universal Hard Interaction for Clockless Computation
• scientific article; zbMATH DE number 1722695
• Membrane Computing
• Interaction combinators
• Hard combinators

Cites work

• Encoding left reduction in the λ-calculus with interaction nets
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 1722695 (Why is no real title available?)
• scientific article; zbMATH DE number 786495 (Why is no real title available?)
• scientific article; zbMATH DE number 860037 (Why is no real title available?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• Interaction combinators
• Interaction nets for linear logic
• Linear logic

Cited in

(4)

• scientific article; zbMATH DE number 1722695 (Why is no real title available?)
• Hard combinators
• Generation of universal series-parallel Boolean functions
• Universal Hard Interaction for Clockless Computation

This page was built for publication: Universal Boolean systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870310)