In the paper we prove in a new and simple way that Interactionmachines are more powerful than Turing machines. To do thatwe extend the definition of Interaction machines to multiple interactivecomponents, where each component may perform simple computation.The emerging expressiveness is due to the power of interaction and allowsto accept languages not accepted by Turing machines. The mainresult that Interaction machines can accept arbitrary languages over agiven alphabet sheds a new light to the power of interaction. Despite ofthat we do not claim that Interaction machines are complete. We claimthat a complete theory of computer science cannot exist and especially,Turing machines or Interaction machines cannot be a complete model ofcomputation. However complete models of computation may and shouldbe approximated indefinitely and our contribution presents one of suchattempts.
Delays and states in dataflow models of computation
