Admissibles in Gaps
| dc.contributor.author | Carl, Merlin | |
| dc.contributor.author | Durand, Bruno | |
| dc.contributor.author | Lafitte, Grégory | |
| dc.contributor.author | Ouazzani, Sabrina | |
| dc.date.accessioned | 2018-02-23T10:03:50Z | |
| dc.date.available | 2018-02-23T10:03:50Z | |
| dc.date.issued | 2017-05-12 | eng |
| dc.description.abstract | We consider clockable ordinals for Infinite Time Turing Machines (ITTMs), i.e., halting times of ITTMs on the empty input. It is well-known that, in contrast to the writable ordinals, the set of clockable ordinals has ‘gaps’. In this paper, we show several results on gaps, mainly related to the admissible ordinals they may properly contain. We prove that any writable ordinal can occur as the order type of the sequence of admissible ordinals in such a gap. We give precise information on their ending points. We also investigate higher rank ordinals (recursively inaccessible, etc.). Moreover, we show that those gaps can have any reasonably effective length (in the sense of ITTMs) compared to their starting point. | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1007/978-3-319-58741-7_18 | eng |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/41574 | |
| dc.language.iso | eng | eng |
| dc.subject.ddc | 510 | eng |
| dc.title | Admissibles in Gaps | eng |
| dc.type | INPROCEEDINGS | eng |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @inproceedings{Carl2017-05-12Admis-41574,
year={2017},
doi={10.1007/978-3-319-58741-7_18},
title={Admissibles in Gaps},
number={10307},
isbn={978-3-319-58740-0},
issn={0302-9743},
publisher={Springer},
address={Cham},
series={Lecture Notes in Computer Science},
booktitle={Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings},
pages={175--186},
editor={Kari, Jarkko},
author={Carl, Merlin and Durand, Bruno and Lafitte, Grégory and Ouazzani, Sabrina}
} | |
| kops.citation.iso690 | CARL, Merlin, Bruno DURAND, Grégory LAFITTE, Sabrina OUAZZANI, 2017. Admissibles in Gaps. 13th Conference on Computability in Europe, CiE 2017. Turku, Finland, 12. Juni 2017 - 16. Juni 2017. In: KARI, Jarkko, ed. and others. Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Cham: Springer, 2017, pp. 175-186. Lecture Notes in Computer Science. 10307. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18 | deu |
| kops.citation.iso690 | CARL, Merlin, Bruno DURAND, Grégory LAFITTE, Sabrina OUAZZANI, 2017. Admissibles in Gaps. 13th Conference on Computability in Europe, CiE 2017. Turku, Finland, Jun 12, 2017 - Jun 16, 2017. In: KARI, Jarkko, ed. and others. Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Cham: Springer, 2017, pp. 175-186. Lecture Notes in Computer Science. 10307. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18 | 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/41574">
<dc:contributor>Durand, Bruno</dc:contributor>
<dc:contributor>Ouazzani, Sabrina</dc:contributor>
<dc:creator>Durand, Bruno</dc:creator>
<dc:contributor>Lafitte, Grégory</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-23T10:03:50Z</dcterms:available>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>Admissibles in Gaps</dcterms:title>
<dcterms:abstract xml:lang="eng">We consider clockable ordinals for Infinite Time Turing Machines (ITTMs), i.e., halting times of ITTMs on the empty input. It is well-known that, in contrast to the writable ordinals, the set of clockable ordinals has ‘gaps’. In this paper, we show several results on gaps, mainly related to the admissible ordinals they may properly contain. We prove that any writable ordinal can occur as the order type of the sequence of admissible ordinals in such a gap. We give precise information on their ending points. We also investigate higher rank ordinals (recursively inaccessible, etc.). Moreover, we show that those gaps can have any reasonably effective length (in the sense of ITTMs) compared to their starting point.</dcterms:abstract>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:creator>Lafitte, Grégory</dc:creator>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41574"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-23T10:03:50Z</dc:date>
<dc:language>eng</dc:language>
<dc:creator>Carl, Merlin</dc:creator>
<dcterms:issued>2017-05-12</dcterms:issued>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:contributor>Carl, Merlin</dc:contributor>
<dc:creator>Ouazzani, Sabrina</dc:creator>
</rdf:Description>
</rdf:RDF> | |
| kops.conferencefield | 13th Conference on Computability in Europe, CiE 2017, 12. Juni 2017 - 16. Juni 2017, Turku, Finland | deu |
| kops.date.conferenceEnd | 2017-06-16 | eng |
| kops.date.conferenceStart | 2017-06-12 | eng |
| kops.flag.knbibliography | true | |
| kops.location.conference | Turku, Finland | eng |
| kops.sourcefield | KARI, Jarkko, ed. and others. <i>Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings</i>. Cham: Springer, 2017, pp. 175-186. Lecture Notes in Computer Science. 10307. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18 | deu |
| kops.sourcefield.plain | KARI, Jarkko, ed. and others. Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Cham: Springer, 2017, pp. 175-186. Lecture Notes in Computer Science. 10307. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18 | deu |
| kops.sourcefield.plain | KARI, Jarkko, ed. and others. Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Cham: Springer, 2017, pp. 175-186. Lecture Notes in Computer Science. 10307. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18 | eng |
| kops.title.conference | 13th Conference on Computability in Europe, CiE 2017 | eng |
| relation.isAuthorOfPublication | 9fa2dd55-adfa-43d0-885c-3eee0ff14362 | |
| relation.isAuthorOfPublication.latestForDiscovery | 9fa2dd55-adfa-43d0-885c-3eee0ff14362 | |
| source.bibliographicInfo.fromPage | 175 | eng |
| source.bibliographicInfo.seriesNumber | 10307 | eng |
| source.bibliographicInfo.toPage | 186 | eng |
| source.contributor.editor | Kari, Jarkko | |
| source.flag.etalEditor | true | eng |
| source.identifier.eissn | 1611-3349 | eng |
| source.identifier.isbn | 978-3-319-58740-0 | eng |
| source.identifier.issn | 0302-9743 | eng |
| source.publisher | Springer | eng |
| source.publisher.location | Cham | eng |
| source.relation.ispartofseries | Lecture Notes in Computer Science | eng |
| source.title | Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings | eng |