http://iospress.metapress.com/content/l5r8t7n6755286h1/
Universal Hard Interaction for Clockless Computation
Dem Glücklichen schlägt keine Stunde!
Sylvain Lippi
We give a self-contained presentation of Hard Interaction, a rewriting system on fixed graphs. We discuss the universality of natural subclasses of hard systems and highlight the main ideas that lead to a universal system with 7 rules called Hard Combinators.
Keywords: hard interaction nets, abstract machine, asynchronous computation, digital circuits, graph relabeling.
Universal Hard Interaction for Clockless Computation
Dem Glücklichen schlägt keine Stunde!
Sylvain Lippi
We give a self-contained presentation of Hard Interaction, a rewriting system on fixed graphs. We discuss the universality of natural subclasses of hard systems and highlight the main ideas that lead to a universal system with 7 rules called Hard Combinators.
Keywords: hard interaction nets, abstract machine, asynchronous computation, digital circuits, graph relabeling.
