Skip to main content
SpringerLink
Log in

Computability in Symbolic Dynamics

  • Conference paper
  • First Online:
Book cover Pursuit of the Universal (CiE 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9709))

Included in the following conference series:

Abstract

We give an overview of the interplay between computability and symbolic dynamics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aubrun, N., Sablik, M.: An order on sets of tilings corresponding to an order on languages. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26–28 February 2009, Freiburg, Germany, pp. 99–110 (2009)

    Google Scholar 

  2. Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Applicandae Math. 126, 35–63 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berger, R.: The undecidability of the domino problem. Ph.D. thesis, Harvard University (1964)

    Google Scholar 

  4. Cenzer, D., Dashti, A., King, J.L.F.: Computable symbolic dynamics. Math. Log. Q. 54(5), 460–469 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cenzer, D., Remmel, J.B.: \({\Pi }_1^0\) classes in mathematics. In: Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics, vol. 139, Studies in Logic and the Foundations of Mathematics, pp. 623–821. Elsevier (1998). Chap. 13

    Google Scholar 

  6. Dashti, A.: Effective symbolic dynamics. Ph.D. thesis, University of Florida (2008)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Friedberg, R.M., Rogers, H.: Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 5, 117–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  9. Higman, G.: Subgroups of finitely presented groups. Proc. Roy. Soc. Lond. Ser. A Math. Phys. Sci. 262(1311), 455–475 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hochman, M.: On the dynamics and recursive properties of multidimensional symbolic systems. Invent. Math. 176(1), 2009 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Higman, G., Scott, E.: Existentially Closed Groups. Oxford University Press, New York (1988)

    MATH  Google Scholar 

  12. Hochman, M., Vanier, P.: On the turing degrees of minimal subshifts. arXiv:1408.6487

  13. Jockusch, C.G., Soare, R.I.: Degrees of members of \({\Pi }_1^0\) classes. Pac. J. Math. 40(3), 605–616 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jockusch Jr., C.G., Soare, R.I.: \(\prod \nolimits _{1}^{0}\) classes and degrees of theories. Trans. Am. Math. Soc. 173, 33–56 (1972)

    MathSciNet  Google Scholar 

  15. Jeandel, E., Vanier, P.: Turing degrees of multidimensional SFTs. Theoret. Comput. Sci. 505, 81–92 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Jeandel, E., Vanier, P.: Characterizations of periods of multidimensional shifts. Ergod. Theory Dyn. Syst. 35(2), 431–460 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kreisel, G.: A variant to Hilbert’s theory of the foundations of arithmetic. Br. J. Philos. Sci. 4(14), 107–129 (1953)

    Article  MathSciNet  Google Scholar 

  18. Kurka, P.: On topological dynamics of turing machines. Theoret. Comput. Sci. 174, 203–216 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lind, D.A.: Multi-dimensional symbolic dynamics. In: Williams, S.G. (ed.) Symbolic Dynamics and its Applications, Proceedings of Symposia in Applied Mathematics, vol. 60, pp. 61–79. American Mathematical Society, Providence (2004)

    Chapter  Google Scholar 

  20. Lind, D.A., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

  21. Miller, J.S.: Two notes on subshifts. Proc. Am. Math. Soc. 140(5), 1617–1622 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Moore, C.: Generalized one-sided shifts and maps of the interval. Nonlinearity 4(3), 727–745 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  23. Myers, D.: Non recursive tilings of the plane II. J. Symb. Log. 39(2), 286–294 (1974)

    Article  MATH  Google Scholar 

  24. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12(3), 177–209 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  25. Rumyantsev, A.Y., Ushakov, M.A.: Forbidden substrings, kolmogorov complexity and almost periodic sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 396–407. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Shoenfield, J.R.: Degrees of models. J. Symb. Log. 25(3), 233–237 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  27. Simpson, S.G.: Mass problems associated with effectively closed sets. Tohoku Math. J. 63(4), 489–517 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  28. Simpson, S.G.: Medvedev degrees of two-dimensional subshifts of finite type. Ergod. Theory Dyn. Syst. 34, 679–688 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lorraine, LORIA, UMR 7503, 54506, Vandoeuvre-lès-Nancy, France

    Emmanuel Jeandel

  2. CNRS, LORIA, UMR 7503, 54506, Vandoeuvre-lès-Nancy, France

    Emmanuel Jeandel

  3. Inria, 54600, Villers-lès-Nancy, France

    Emmanuel Jeandel

Authors
  1. Emmanuel Jeandel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuel Jeandel .

Editor information

Editors and Affiliations

  1. Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. Université Paris-Diderot - Paris 7, Paris, France

    Laurent Bienvenu

  3. University of South Florida, Tampa, Florida, USA

    Nataša Jonoska

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Jeandel, E. (2016). Computability in Symbolic Dynamics. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds) Pursuit of the Universal. CiE 2016. Lecture Notes in Computer Science(), vol 9709. Springer, Cham. https://doi.org/10.1007/978-3-319-40189-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40189-8_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40188-1

  • Online ISBN: 978-3-319-40189-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation