<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-18T02:34:34Z</responseDate>
  <request identifier="24896" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:24896</identifier>
        <datestamp>2026-02-09T12:30:31Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Weihrauch Complexity: Structuring the Realm of Non-Computability (Dagstuhl Seminar 25131)</dc:title>
          <dc:creator>Brattka, Vasco</dc:creator>
          <dc:creator>Marcone, Alberto</dc:creator>
          <dc:creator>Pauly, Arno</dc:creator>
          <dc:creator>Westrick, Linda</dc:creator>
          <dc:creator>Gill, Kenneth</dc:creator>
          <dc:subject>combinatorial problems</dc:subject>
          <dc:subject>computability and complexity</dc:subject>
          <dc:subject>computable analysis</dc:subject>
          <dc:subject>reverse and constructive mathematics</dc:subject>
          <dc:subject>Weihrauch reducibility and related reducibilities</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 25131 "Weihrauch Complexity: Structuring the Realm of Non-Computability". It includes an abstract of every talk given during the seminar, as well as summaries of all presentations from the sessions on open problems and new research directions. At the end is the latest version of a bibliography on Weihrauch complexity which was originally started a decade ago at the first Dagstuhl Seminar on the topic (https://doi.org/10.4230/DagRep.5.9.77).</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Vasco Brattka and Alberto Marcone and Arno Pauly and Linda Westrick and Kenneth Gill</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 15, Issue 3 (2025)</dc:relation>
          <dc:type>Article</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagRep.15.3.125</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-248965</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.3.125</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
