<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" 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:identifier>doi:10.1007/s00224-015-9620-x</dc:identifier><dc:language>eng</dc:language><dc:creator>Mayordomo, Elvira</dc:creator><dc:creator>Merkle, Wolfgang</dc:creator><dc:title>Editorial</dc:title><dc:identifier>ART-2015-90777</dc:identifier><dc:description>The annual meeting Computability, Complexity and Randomness is worldwide the central conference on algorithmic randomness, an area which in turn has been one of the most central and most fruitful subareas of computability theory for almost two decades now...</dc:description><dc:date>2015</dc:date><dc:source>http://zaguan.unizar.es/record/131290</dc:source><dc:doi>10.1007/s00224-015-9620-x</dc:doi><dc:identifier>http://zaguan.unizar.es/record/131290</dc:identifier><dc:identifier>oai:zaguan.unizar.es:131290</dc:identifier><dc:identifier.citation>THEORY OF COMPUTING SYSTEMS 56 (2015), 437-438</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>