Universal Hard Interaction for Clockless Computation Lucky ones do not count hours!
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.
hard interaction nets abstract machine asynchronous computation digital circuits graph relabeling