Search Results

Documents authored by Ambos-Spies, Klaus

Document
DOI: 10.4230/DagRep.7.2.89
Computability Theory (Dagstuhl Seminar 17081)

Authors: Klaus Ambos-Spies, Vasco Brattka, Rodney Downey, and Steffen Lempp

Published in: Dagstuhl Reports, Volume 7, Issue 2 (2017)

Abstract
Computability is one of the fundamental notions of mathematics and computer science, trying to capture the effective content of mathematics and its applications. Computability Theory explores the frontiers and limits of effectiveness and algorithmic methods. It has its origins in Gödel's Incompleteness Theorems and the formalization of computability by Turing and others, which later led to the emergence of computer science as we know it today. Computability Theory is strongly connected to other areas of mathematics and theoretical computer science. The core of this theory is the analysis of relative computability and the induced degrees of unsolvability; its applications are mainly to Kolmogorov complexity and randomness as well as mathematical logic, analysis and algebra. Current research in computability theory stresses these applications and focuses on algorithmic randomness, computable analysis, computable model theory, and reverse mathematics (proof theory). Recent advances in these research directions have revealed some deep interactions not only among these areas but also with the core parts of computability theory. The goal of this Dagstuhl Seminar is to bring together researchers from all parts of computability theory and related areas in order to discuss advances in the individual areas and the interactions among those.
Cite as

Klaus Ambos-Spies, Vasco Brattka, Rodney Downey, and Steffen Lempp. Computability Theory (Dagstuhl Seminar 17081). In Dagstuhl Reports, Volume 7, Issue 2, pp. 89-101, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{ambosspies_et_al:DagRep.7.2.89,
  author =	{Ambos-Spies, Klaus and Brattka, Vasco and Downey, Rodney and Lempp, Steffen},
  title =	{{Computability Theory (Dagstuhl Seminar 17081)}},
  pages =	{89--101},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{2},
  editor =	{Ambos-Spies, Klaus and Brattka, Vasco and Downey, Rodney and Lempp, Steffen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.2.89},
  URN =		{urn:nbn:de:0030-drops-73540},
  doi =		{10.4230/DagRep.7.2.89},
  annote =	{Keywords: algorithmic randomness, computability theory, computable algebra, computable analysis, generic case complexity, proof mining}
}
Document
DOI: 10.4230/DagSemRep.82
Structure and Complexity (Dagstuhl Seminar 9407)

Authors: Klaus Ambos-Spies, Steven Homer, and Uwe Schöning

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Klaus Ambos-Spies, Steven Homer, and Uwe Schöning. Structure and Complexity (Dagstuhl Seminar 9407). Dagstuhl Seminar Report 82, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)

Copy BibTex To Clipboard

@TechReport{ambosspies_et_al:DagSemRep.82,
  author =	{Ambos-Spies, Klaus and Homer, Steven and Sch\"{o}ning, Uwe},
  title =	{{Structure and Complexity (Dagstuhl Seminar 9407)}},
  pages =	{1--30},
  ISSN =	{1619-0203},
  year =	{1994},
  type = 	{Dagstuhl Seminar Report},
  number =	{82},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.82},
  URN =		{urn:nbn:de:0030-drops-149701},
  doi =		{10.4230/DagSemRep.82},
}
Document
DOI: 10.4230/DagSemRep.30
Structure and Complexity Theory (Dagstuhl Seminar 9206)

Authors: Klaus Ambos-Spies, Steven Homer, and Uwe Schöning

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Klaus Ambos-Spies, Steven Homer, and Uwe Schöning. Structure and Complexity Theory (Dagstuhl Seminar 9206). Dagstuhl Seminar Report 30, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)

Copy BibTex To Clipboard

@TechReport{ambosspies_et_al:DagSemRep.30,
  author =	{Ambos-Spies, Klaus and Homer, Steven and Sch\"{o}ning, Uwe},
  title =	{{Structure and Complexity Theory (Dagstuhl Seminar 9206)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{30},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.30},
  URN =		{urn:nbn:de:0030-drops-149183},
  doi =		{10.4230/DagSemRep.30},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact