Randomness and Degree Theory for Infinite Time Register Machines
| dc.contributor.author | Carl, Merlin | |
| dc.date.accessioned | 2017-02-14T10:50:12Z | |
| dc.date.available | 2017-02-14T10:50:12Z | |
| dc.date.issued | 2016 | eng |
| dc.description.abstract | A concept of randomness for infinite time register machines (ITRMs) is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of van Lambalgen's theorem holds. This is then applied to obtain results on the structure of ITRM-degrees. Finally, we consider autoreducibility for ITRMs and show that randomness implies non-autoreducibility. | eng |
| dc.description.version | published | eng |
| dc.identifier.arxiv | 1508.04618 | eng |
| dc.identifier.doi | 10.3233/COM-160055 | eng |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/32737 | |
| dc.language.iso | eng | eng |
| dc.subject.ddc | 510 | eng |
| dc.title | Randomness and Degree Theory for Infinite Time Register Machines | eng |
| dc.type | JOURNAL_ARTICLE | eng |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @article{Carl2016Rando-32737,
year={2016},
doi={10.3233/COM-160055},
title={Randomness and Degree Theory for Infinite Time Register Machines},
number={2},
volume={5},
issn={2211-3568},
journal={Computability},
pages={181--196},
author={Carl, Merlin}
} | |
| kops.citation.iso690 | CARL, Merlin, 2016. Randomness and Degree Theory for Infinite Time Register Machines. In: Computability. 2016, 5(2), pp. 181-196. ISSN 2211-3568. eISSN 2211-3576. Available under: doi: 10.3233/COM-160055 | deu |
| kops.citation.iso690 | CARL, Merlin, 2016. Randomness and Degree Theory for Infinite Time Register Machines. In: Computability. 2016, 5(2), pp. 181-196. ISSN 2211-3568. eISSN 2211-3576. Available under: doi: 10.3233/COM-160055 | eng |
| kops.citation.rdf | <rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/32737">
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:issued>2016</dcterms:issued>
<dcterms:abstract xml:lang="eng">A concept of randomness for infinite time register machines (ITRMs) is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of van Lambalgen's theorem holds. This is then applied to obtain results on the structure of ITRM-degrees. Finally, we consider autoreducibility for ITRMs and show that randomness implies non-autoreducibility.</dcterms:abstract>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-14T10:50:12Z</dcterms:available>
<dcterms:title>Randomness and Degree Theory for Infinite Time Register Machines</dcterms:title>
<dc:language>eng</dc:language>
<dc:contributor>Carl, Merlin</dc:contributor>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-14T10:50:12Z</dc:date>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:creator>Carl, Merlin</dc:creator>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/32737"/>
</rdf:Description>
</rdf:RDF> | |
| kops.flag.knbibliography | true | |
| kops.sourcefield | Computability. 2016, <b>5</b>(2), pp. 181-196. ISSN 2211-3568. eISSN 2211-3576. Available under: doi: 10.3233/COM-160055 | deu |
| kops.sourcefield.plain | Computability. 2016, 5(2), pp. 181-196. ISSN 2211-3568. eISSN 2211-3576. Available under: doi: 10.3233/COM-160055 | deu |
| kops.sourcefield.plain | Computability. 2016, 5(2), pp. 181-196. ISSN 2211-3568. eISSN 2211-3576. Available under: doi: 10.3233/COM-160055 | eng |
| relation.isAuthorOfPublication | 9fa2dd55-adfa-43d0-885c-3eee0ff14362 | |
| relation.isAuthorOfPublication.latestForDiscovery | 9fa2dd55-adfa-43d0-885c-3eee0ff14362 | |
| source.bibliographicInfo.fromPage | 181 | eng |
| source.bibliographicInfo.issue | 2 | eng |
| source.bibliographicInfo.toPage | 196 | eng |
| source.bibliographicInfo.volume | 5 | eng |
| source.identifier.eissn | 2211-3576 | eng |
| source.identifier.issn | 2211-3568 | eng |
| source.periodicalTitle | Computability | eng |