How we did it:
For any feedback, any questions, any notes or just for chat - feel free to follow us on social networks
Richard L. Epstein, Walter Alexandr Carnielli
An introduction to recursion theory and particularly to the theory of computing, including fourteen readings by Hilbert, Godel, Turing, Post, Church, and others along with a discussion of issues such as self-reference and infinite sets. Annotation copyrighted by Book News, Inc., Portland, OR
Susanna S. Epp
Susanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.