The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. Additions to the second ed

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of comp

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshop

Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by