An involutory function, also called involution, is a function that is its own inverse, i.e., holds whenever is defined. This paper presents a computational model of involution as a variant of Turing machines, called an involutory Turing machine. The computational model is shown to be complete in the sense that not only does an involutory Turing machine always compute an involution but also every involutory computable function can be computed by an involutory Turing machine. As any involution is injective (hence reversible), any involutory Turing machine forms a standard reversible Turing machine that is backward deterministic. Furthermore, the existence of a universal involutory Turing machine is shown under an appropriate redefinition of universality given by Axelsen and Glück for reversible Turing machines. This work is motivated by characterizing bidirectional transformation languages.
CITATION STYLE
Nakano, K. (2020). Involutory Turing Machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12227 LNCS, pp. 54–70). Springer. https://doi.org/10.1007/978-3-030-52482-1_3
Mendeley helps you to discover research relevant for your work.