Universal Hard Interaction for Clockless Computation

DOI10.3233/FI-2009-0048MaRDI QIDQ3634004zbMATH OpenOpenAlexFDO

Authors Sylvain Lippi

Publication date 23 June 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-0048

zbMATH Keywords

abstract machineasynchronous computationdigital circuitsgraph relabelinghard interaction nets

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Recommendations

• Hard combinators
• Interaction combinators
• Universal Boolean systems
• scientific article; zbMATH DE number 1722695
• Small universal devices

Cited in

(4)

• Interaction combinators
• scientific article; zbMATH DE number 1722695 (Why is no real title available?)
• Universal Boolean systems
• Hard combinators

This page was built for publication: Universal Hard Interaction for Clockless Computation

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