Theoretical computer science is typically offered in two blocks at German universities. The author takes this into account and provides a systematic and comprehensive introduction to this field in two volumes. The present second volume discusses the theory of "simple" automata and the formal languages closely associated with them in an understandable and application-oriented manner, the theoretical computability of functions, the concept of practical computability, the theory of NP-completeness, as well as fundamental topics in cryptography. One of the greatest challenges of our time is the exploration of information in relation to its generation, extraction, and processing. Therefore, the second part of the book is dedicated to an introduction to information and learning theory. Both classical and algorithmic information theory are discussed.