Turing Computability and Complexity

  • Max Garzon
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)


Ancient documents, like the Rhind Papyrus, dating as far back as 3600 B.C. attest to the fact that men have been performing computations for thousands of years, and for very practical reasons such as farming, land measurements (Egyptian geometry), or simply wishful thinking about the powers of human prediction (astrology). Years later, after Europe surmounted the laggish period of the Middle Ages, a reblooming in the arts during the Renaissance slowly led the way to the dawn of the scientific method, specifically, in the physical- mathematical sciences, with Galileo and the crowning work of Newton on celestial mechanics. In particular, from a modern perspective, their monumental work provides us with algorithms to establish facts about heavenly or earthly objects related to their position and/or their motion. Further research on electricity and magnetism by J.C. Maxwell, and on thermodynamics and heat theory by L. Boltzmann and other 19th century physicists may be regarded in a similar way.


Cellular Automaton Turing Machine Input Symbol Sequential Computation Input Tape 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B-D-G]
    J.L Balcázar, J. Díaz, J. Gabarró: Structural complexity. Springer-Verlag, Berlin, vols. I (1988, 2nd. ed. 1995), II (1990)MATHGoogle Scholar
  2. [B-C]
    D.P. Bovet, P. Crescenzi: Introduction to the theory of complexity. Prentice– Hall, Hertfordshire, 1994Google Scholar
  3. [C]
    S.A. Cook: The complexity of theorem proving procedures. In: Proc. 3rd Annual Symp. on the Theory of Computing STOC, Assoc. Comput. Mach. New York, 1971, pp. 151–158Google Scholar
  4. [G-J]
    M. Garey and D.S. Johnson: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco, CA, 1979MATHGoogle Scholar
  5. [H]
    D. Harel: Algorithmics (The spirit of computing). Addison-Wesley, Reading MA, 1992.MATHGoogle Scholar
  6. [L]
    F.T. Leighton: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo CA, 1992MATHGoogle Scholar
  7. [K]
    R.M. Karp: Reducibility among combinatorial problems. In: Complexity of computer computations. Plenum Press, New York 1972, pp. 86–103Google Scholar
  8. [P]
    C. Papadimitriou: Computational complexity. Addison-Wesley, Reading MA, 1994MATHGoogle Scholar
  9. [R]
    M. Rabin: Probabilistic algorithms. In: Algorithms in complexity, New directions and results. J. Traub (ed.), Academic Press, New York, 1976, pp. 151–158Google Scholar
  10. [S]
    W. Savitch: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4 (1970), 177–192MathSciNetMATHCrossRefGoogle Scholar
  11. [Sm]
    J. Smith: The design and analysis of parallel algorithms. Oxford University Press, Oxford, 1993MATHGoogle Scholar
  12. [S-S]
    R. Solovay and V. Strassen: A fast Monte-Carlo test for primality. SIAM J. of Computing 6 (1977) 84–85.MathSciNetMATHCrossRefGoogle Scholar
  13. R. Solovay and V. Strassen Erratum ibid 7 (1978), 118MathSciNetGoogle Scholar
  14. [T]
    A.M. Turing: On computable numbers, with an application to the Entschei- dungsproblem. Proc. London Math. Soc. 42 (1936) 230–265.CrossRefGoogle Scholar
  15. A.M. Turing A correction, ibid 43 (1936) 544–546Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Max Garzon
    • 1
  1. 1.Department of Mathematical SciencesThe University of MemphisMemphisUSA

Personalised recommendations