arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.1264cs.FL
收藏

有记忆可逆逻辑元及其普适性

Reversible Logic Elements with Memory and Their Universality

Kenichi Morita

摘要:

可逆计算是反映物理可逆性的计算范例,物理可逆性是自然界基本微观定律之一。在这篇综述中,我们讨论了可用于构建可逆计算系统的具有存储器的可逆逻辑元件(RLEM)及其通用性。由于可逆图灵机(RTM)的有限状态控制和磁带单元都形式化为RSM,因此任何RTM都可以由通用RLEM构造。本文研究了二态RLEMs,证明了除了四种例外,无穷多种非退化RLEMs都是普适的。这些特殊的RLEMs的非普遍性也有人认为。

英文摘要:

Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used to build reversible computing systems, and their universality. An RLEM is called universal, if any reversible sequential machine (RSM) can be realized as a circuit composed only of it. Since a finite-state control and a tape cell of a reversible Turing machine (RTM) are formalized as RSMs, any RTM can be constructed from a universal RLEM. Here, we investigate 2-state RLEMs, and show that infinitely many kinds of non-degenerate RLEMs are all universal besides only four exceptions. Non-universality of these exceptional RLEMs is also argued.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑