Implementing the Morita Gate in an Asynchronous Cellular Automaton
摘要
The Morita Gate is the simplest reversible logic element that can be used to realize all reversible sequential machines. In this paper, we show that this universal element can be efficiently implemented in an asynchronous cellular automaton, resulting in computational universality of the cellular automaton model.