Theory and Applications of Computability
a book series in cooperation with the Association Computability in Europe

Series Overview

The book series Theory and Applications of Computability is published by Springer in cooperation with the Association Computability in Europe.

Books published in this series will be of interest to the research community and graduate students, with a unique focus on issues of computability. The perspective of the series is multidisciplinary, recapturing the spirit of Turing by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, and the philosophy of science.

The series includes research monographs, advanced and graduate texts, and books that offer an original and informative view of computability and computational paradigms.

Volume 4

Robert I. Soare

Turing Computability
Theory and Applications

1st Edition., 2016, XXXVI, 263 p. 4 illus.
Hardcover, ISBN 978-3-642-31932-7

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject.

Volume 3

Dag Normann, John Longley

Higher Order Computability

1st Edition., 2015, X, 575 p. 2 illus.
Hardcover, ISBN 978-3-662-47991-9

This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages.

Volume 2

Douglas S. Bridges, Luminiţa Simona Vîţă

Apartness and Uniformity
A Constructive Development

1st Edition., 2011, XIV, 198 p. 3 illus.
Hardcover, ISBN 978-3-642-22414-0

Largely an exposition of the authors' own research, this is the first book dealing with the apartness approach to constructive topology, and is a valuable addition to the literature on constructive mathematics and on topology in computer science. It is aimed at graduate students and advanced researchers in theoretical computer science, mathematics, and logic who are interested in constructive/algorithmic aspects of topology.

Volume 1

Rodney G. Downey, Denis R. Hirschfeldt

Algorithmic Randomness and Complexity

1st Edition., 2010, XXVIII, 855 p. 8 illus.
Hardcover, ISBN 978-0-387-95567-4

This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.

Editorial Board

Founding Editors: P. Bonizzoni, V. Brattka, S.B. Cooper, E. Mayordomo

Series Advisory Board



Formal or informal book proposals can be sent directly to members of the editorial board (contact details are on the linked web pages above).

Planned Volumes

© 2009- Association Computability in Europe (maintained by Vasco Brattka)