Máquina de Turing Reversível: Um Estudo de Caso
Published in IV WORKSHOP-ESCOLA DE INFORMÁTICA TEÓRICA, 2017
This paper presents the concept of a Reversible Turing Machine and a case study based on the model idealized by Charles Bennett in 1973. In order to exemplify such a theoretical computation model, a machine was elaborated according to the presented guidelines in the article “Logical Reversibility of Computation”. For this purpose the Java programming language was used. The machine presented in this article receives an input from a standard Turing Machine, and converts the transition functions so that they are reversible, so that any action taken can be undone.
Recommended citation: SANTANA, B. S.; DONATO, M. M. ; VIZZOTTO, J. K. . Máquina de Turing Reversível: Um Estudo de Caso. In: IV WORKSHOP-ESCOLA DE INFORMÁTICA TEÓRICA, 2017, Santa Maria. ANAIS WEIT 2017, 2017. v. 1. p. 227-234.