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.
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.
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
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.
Series Advisory Board
- Samson Abramsky (Oxford, UK)
- Eric Allender (Rutgers, New Jersey, USA)
- Klaus Ambos-Spies (Heidelberg, Germany)
- Giorgio Ausiello (Rome, Italy)
- Jeremy Avigad (Carnegie Mellon, Pittsburgh, USA)
- Samuel R. Buss (California, San Diego, USA)
- Rodney G. Downey (Wellington, New Zealand)
- Sergei S. Goncharov (Novosibirsk, Russia)
- Peter Jeavons (Oxford, UK)
- Nataša Jonoska (South Florida, Tampa, USA)
- Ulrich Kohlenbach (Darmstadt, Germany)
- Ming Li (Waterloo, Canada)
- Wolfgang Maass (Graz, Austria)
- Prakash Panangaden (McGill, Montreal, Canada)
- Grzegorz Rozenberg (Leiden, The Netherlands and Colorado, USA)
- Alan Selman (Buffalo, New York, USA)
- Wilfried Sieg (Carnegie Mellon, Pittsburgh, USA)
- Jan van Leeuwen (Utrecht, The Netherlands)
- Klaus Weihrauch (Hagen, Germany)
- Philip Welch (Bristol, UK)
Formal or informal book proposals can be
sent directly to members of the editorial board
(contact details are on the linked web pages above).