Advertisement

Turing’s Three Pioneering Initiatives and Their Interplays

  • Jozef Kelemen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7762)

Abstract

The purpose of this article is to recall three fundamental contributions by A. M. Turing to three important fields of contemporary science and engineering (theory of computation, artificial intelligence, and biocomputing), and to emphasize the connections between them. The article recalls and formulates resp., also three hypotheses related to the three initiatives and discusses in short their mutual interrelatedness.

Keywords

Turing Machine Digital Computer Theoretical Computer Science Turing Test Computable Number 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burgin, M., Klinger, A.: Three aspects of super-recursive algorithms and hyper-computation or finding black swans. Theoretical Computer Science 317, 1–11 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Church, A.: A note on the Entscheidungsproblem. Journal of Symbolic Logic 1, 40–41 (1930)CrossRefGoogle Scholar
  3. 3.
    Church, A.: An unsolvable problem of elementary number theory. American Journal of Mathematics 58, 345–363 (1936)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Csuhaj-Varjú, E., et al.: Grammar Systems. Gordon and Breach, Yverdon (1994)zbMATHGoogle Scholar
  5. 5.
    Csuhaj-Varjú, E., Kelemenová, A.: Team behavior in eco-grammar systems. Theoretical Computer Science 209, 213–224 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)zbMATHGoogle Scholar
  7. 7.
    Kelemen, J.: May Embodiment Cause Hyper-Computation? In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds.) ECAL 2005. LNCS (LNAI), vol. 3630, pp. 31–36. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Matiyasevich, Y.: On recursive unsolvability of Hilbert’s tenth problem. In: Proc. 4th International Congress on Logic, Methodology and Philosophy of Science, pp. 89–110. North-Holland, Amsterdam (1973)Google Scholar
  9. 9.
    Păun, G.: Membrane computing: An introduction. Springer, Berlin (2002)zbMATHCrossRefGoogle Scholar
  10. 10.
    Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)zbMATHGoogle Scholar
  11. 11.
    Singh, A.: Elements of Computation Theory. Springer, London (2009)zbMATHCrossRefGoogle Scholar
  12. 12.
    Stannett, M.: Hypercomputational models. In: Teuscher, C. (ed.) Alan Turing - Life and Legacy of a Great Thinker, pp. 135–157. Springer (2004)Google Scholar
  13. 13.
    Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. of the London Mathematical Society, series 2 42, 230–265 (1936)Google Scholar
  14. 14.
    Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem, a correction. Proc. of the London Mathematical Society, series 2 43, 544–546 (1937)Google Scholar
  15. 15.
    Turing, A.M.: Computing machinery and intelligence. Mind 59, 433–460 (1950)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Turing, A.M.: The chemical basis of morphogenesis. Philosophical Transactions of the Royal Society B 237, 37–72 (1952)CrossRefGoogle Scholar
  17. 17.
    Wätjen, D.: Function-dependent teams in eco-grammar systems. Theoretical Computer Science 306, 39–53 (2003)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jozef Kelemen
    • 1
    • 2
  1. 1.Institute of Computer Science, and IT4I InstituteSilesian UniversityOpavaCzech Republic
  2. 2.School of ManagementBratislavaSlovak Republic

Personalised recommendations