Computability and Complexity / Undergraduate Topics in Computer Science (PDF)

This textbook/reference offers a straightforward and thorough grounding in the theory of computability and computational complexity. Among topics covered are basic naive set theory, regular languages and automata, models of computation, partial recursive functions, undecidability proofs, classical computability theory including the arithmetical hierarchy and the priority method, the basics of computational complexity and hierarchy theorems.

Topics and features:

· Explores Conway's undecidability proof of the ``3x+1'' problem using reductions from Register Machines and "Fractran"

· Offers an accessible account of the undecidability of the exponential version of Hilbert's 10^th problem due to Jones and Matijacevic

· Provides basic material on computable structure, such as computable linear orderings

· Addresses parameterized complexity theory, including applications to algorithmic lower bounds and kernelization lower bounds

· Delivers a short account of generic-case complexity and of smoothed analysis

· Includes bonus material on structural complexity theory and priority arguments in computability theory

This comprehensive textbook will be ideal for advanced undergraduates or beginning graduates, preparing them well for more advanced studies or applications in science. Additionally, it could serve such needs for mathematicians or for scientists working in computational areas, such as biology.

Rodney Downey is an Emeritus Professor at Victoria University of Wellington, NZ. He is the co-author of the Springer books, Fundamentals of Parameterized Complexity, and Algorithmic Randomness and Complexity. He has won many prizes for his work, including (twice) the Shoenfield Prize for writing, as well as the Rutherford Medal, New Zealand's premier science award.