1. Armando BM. A Turing machine formalism suitable for the characterization of determinism and reversibility. LIACC, Universidade do Porto, Rua do Campo Alegre 823, 4150 Porto, Portugal, (n.d.)
2. Peter G, Paul V (2010) Shannon information and kolmogorov complexity
3. Bennett CH (1973) Logical reversibility of computation, IBM J. Res. Develop. https://www.dna.caltech.edu/courses/cs191/paperscs191/bennett1973.pdf
4. Jia-Lee A, Rui-Long YA (2022) Kenichi morita design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. Theor Comput Sci, 460, pp 78–88. https://doi.org/10.1016/j.tcs.2012.07.027
5. Nicolas O (2018) On Aperiodic Reversible Turing Machines (invited talk), Reversible Computation 10th International Conference (RC 2018). Leicester, United Kingdom, pp 61–64