The paper Interaction Combinators is available by anonymous ftp.
The paper shows that a very simple system of interaction combinators, with only 3 symbols and 6 rules, is a universal model of parallel computation. This paper is the continuation of the author's work on interaction nets, inspired by Girard's proof nets for linear logic, but no preliminary knowledge of these topics is required for its reading.