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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Implementing the Morita Gate in an Asynchronous Cellular Automaton

  • Binmao Liu,
  • Jia Lee

摘要

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.