Computability Theory
Klaus Ambos-Spies
Universität Heidelberg, GermanyRodney G. Downey
Victoria University, Wellington, New ZealandSteffen Lempp
University of Wisconsin, Madison, USAWolfgang Merkle
Universität Heidelberg, Germany
![Computability Theory cover](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserial-issues%2Fcover-owr-volume-9-issue-1.png&w=3840&q=90)
Abstract
Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science.
Cite this article
Klaus Ambos-Spies, Rodney G. Downey, Steffen Lempp, Wolfgang Merkle, Computability Theory. Oberwolfach Rep. 9 (2012), no. 1, pp. 397–455
DOI 10.4171/OWR/2012/08