2010/12/28 by Serban E. Vlad, Vlad, Serban E.
Computer Science · #06E30 #94C05 #94C10 #Cellular Automata and Applications #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #Other Computer Science (cs.OH) #Quantum Computing Algorithms and Architecture
paper · pdf · doi:10.48550/arxiv.1012.5842
openalex publication_date 2010/12/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Reversible computing is a concept reflecting physical reversibility. Until now several reversible systems have been investigated. In a series of papers Kenichi Morita defines the rotary element RE, that is a reversible logic element. By reversibility, he understands that 'every computation process can be traced backward uniquely from the end to the start. In other words, they are backward deterministic systems'. He shows that any reversible Turing machine can be realized as a circuit composed of RE's only. Our purpose in this paper is to use the asynchronous systems theory and the real time for the modeling of the ideal rotary element