Computability Theory

This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience, and is designed to be accessible to junior and senior students without a previous background in the subject. The book will pr [...]
Visa längre beskrivning

This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience, and is designed to be accessible to junior and senior students without a previous background in the subject. The book will prepare the students for further study in computational complexity, logic, theoretical computer science, as well as other topics. It focuses on computability theory, and excludes computer-science topics such as automata theory, and context-free languages.
Undergraduates can read and understand the material
Pointers to more advanced topics, and provides a base for further study of such topics
Covers a strong introductory set of material from a modern mathematical viewpoint