Advertisement

The Group of Reversible Turing Machines

  • Sebastián Barbieri
  • Jarkko Kari
  • Ville Salo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9664)

Abstract

We consider Turing machines as actions over configurations in \(\varSigma ^{\mathbb {Z}^d}\) which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines and the group of reversible Turing machines. We also study two natural subgroups, namely the group of finite-state automata, which generalizes the topological full groups studied in the theory of orbit-equivalence, and the group of oblivious Turing machines whose movement is independent of tape contents, which generalizes lamplighter groups and has connections to the study of universal reversible logical gates. Our main results are that the group of Turing machines in one dimension is neither amenable nor residually finite, but is locally embeddable in finite groups, and that the torsion problem is decidable for finite-state automata in dimension one, but not in dimension two.

Keywords

Cellular Automaton Turing Machine Local Rule Torsion Problem Sofic Shift 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

The third author was supported by FONDECYT grant 3150552.

References

  1. 1.
    Ollinger, N., Gajardo, A., Torres-Avilés, R.: The transitivity problem of turing machines (2015)Google Scholar
  2. 2.
    Aaronson, S., Grier, D., Schaeffer, L.: The classification of reversible bit operations. ArXiv e-prints, April 2015Google Scholar
  3. 3.
    Aubrun, N., Barbieri, S., Sablik, M.: A notion of effectiveness for subshifts on finitely generated groups. ArXiv e-prints, December 2014Google Scholar
  4. 4.
    Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Applicandae Math. 126(1), 35–63 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Belk, J., Bleak, C.: Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V. ArXiv e-prints, May 2014Google Scholar
  6. 6.
    Belk, J., Matucci, F.: Conjugacy and dynamics in Thompson’s groups. Geom. Dedicata 169(1), 239–261 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ceccherini-Silberstein, T., Coornaert, M.: Cellular Automata and Groups. Springer Monographs in Mathematics. Springer, Heidelberg (2010)CrossRefzbMATHGoogle Scholar
  8. 8.
    Czeizler, E., Kari, J.: A tight linear bound on the synchronization delay of bijective automata. Theor. Comput. Sci. 380(12), 23–36 (2007). Automata, Languages and ProgrammingMathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Durand, B., Romashchenko, A., Shen, A.: Effective closed subshifts in 1D can be implemented in 2D. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 208–226. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Elek, G., Monod, N.: On the topological full group of a minimal Cantor Z\(^2\)-system. ArXiv e-prints, December 2012Google Scholar
  11. 11.
    Gajardo, A., Guillon, P.: Zigzags in turing machines. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 109–119. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Gajardo, A., Mazoyer, J.: One head machines from a symbolic approach. Theor. Comput. Sci. 370(13), 34–47 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Giordano, T., Putnam, I., Skau, C.: Full groups of cantor minimal systems. Isr. J. Math. 111(1), 285–320 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Grigorchuk, R., Medynets, K.: On algebraic properties of topological full groups. ArXiv e-prints, May 2011Google Scholar
  15. 15.
    Kůrka, P., Delvenne, J., Blondel, V.: Decidability and universality in symbolic dynamical systems. Fund. Inform. 74(4), 463–490 (2006)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Jeandel, E.: Computability of the entropy of one-tape Turing machines. arXiv preprint (2013). arXiv:1302.1170
  17. 17.
    Juschenko, K., Monod, N.: Cantor systems, piecewise translations and simple amenable groups. Ann. Math. (2012)Google Scholar
  18. 18.
    Kari, J.: Representation of reversible cellular automata with block permutations. Theor. Comput. Syst. 29, 47–61 (1996). doi: 10.1007/BF01201813 MathSciNetzbMATHGoogle Scholar
  19. 19.
    Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419–430. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  20. 20.
    Kůrka, P.: On topological dynamics of turing machines. Theor. Comput. Sci. 174(1–2), 203–216 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Kůrka, P.: Erratum to: entropy of turing machines with moving head. Theor. Comput. Sci. 411(31–33), 2999–3000 (2010)CrossRefzbMATHGoogle Scholar
  22. 22.
    Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)CrossRefzbMATHGoogle Scholar
  23. 23.
    Lind, D., Boyle, M., Rudolph, D.: The automorphism group of a shift of finite type. Trans. Am. Math. Soc. 306(1), 71–114 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Matui, H.: Topological full groups of one-sided shifts of finite type. ArXiv e-prints, October 2012Google Scholar
  25. 25.
    Salo, V., Schraudner, M.: in preparationGoogle Scholar
  26. 26.
    Salo, V., Törmä, I.: Group-walking automata. In: Kari, J. (ed.) AUTOMATA 2015. LNCS, vol. 9099, pp. 224–237. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  27. 27.
    Salo, V., Törmä, I.: Plane-walking automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 135–148. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  28. 28.
    Cassaigne, J., Blondel, V., Nichitiu, C.: On the presence of periodic configurations in turing machines and in counter machines. Theor. Comput. Sci. 289(1), 573–590 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Vershik, A., Gordon, E.: Groups that are locally embeddable in the class of finite groups. Algebra i Analiz 9(1), 71–97 (1997)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Weiss, B.: Sofic groups and dynamical systems. Sankhyā Indian J. Stat. Ser. A 62, 350–359 (2000)MathSciNetzbMATHGoogle Scholar
  31. 31.
    Ziman, M., et al.: On finite approximations of groups and algebras. Ill. J. Math. 46(3), 837–839 (2002)MathSciNetzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  1. 1.LIP, ENS de Lyon – CNRS – INRIA – UCBL – Université de LyonLyonFrance
  2. 2.University of TurkuTurkuFinland
  3. 3.Center for Mathematical ModelingUniversity of ChileSantiagoChile

Personalised recommendations