Admissibles in Gaps


Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

CARL, Merlin, Bruno DURAND, Grégory LAFITTE, Sabrina OUAZZANI, 2017. Admissibles in Gaps. 13th Conference on Computability in Europe, CiE 2017. Turku, Finland, 12. Jun 2017 - 16. Jun 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, pp. 175-186. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-58740-0. Available under: doi: 10.1007/978-3-319-58741-7_18

@inproceedings{Carl2017-05-12Admis-41574, title={Admissibles in Gaps}, year={2017}, doi={10.1007/978-3-319-58741-7_18}, number={10307}, isbn={978-3-319-58740-0}, issn={0302-9743}, address={Cham}, publisher={Springer}, 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} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:contributor>Ouazzani, Sabrina</dc:contributor> <dcterms:issued>2017-05-12</dcterms:issued> <dc:contributor>Carl, Merlin</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dc:date rdf:datatype="">2018-02-23T10:03:50Z</dc:date> <bibo:uri rdf:resource=""/> <dcterms:title>Admissibles in Gaps</dcterms:title> <dc:creator>Durand, Bruno</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dc:creator>Lafitte, Grégory</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Lafitte, Grégory</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="">2018-02-23T10:03:50Z</dcterms:available> <dc:creator>Carl, Merlin</dc:creator> <dc:creator>Ouazzani, Sabrina</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <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> <dc:contributor>Durand, Bruno</dc:contributor> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto