## An Invitation to Infinitary Computability

No Thumbnail Available
##### Files
There are no files associated with this item.
2016
##### Publication type
Contribution to a conference collection
Published
##### Published in
Special Issue : Joint 87th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM) and Deutsche Mathematiker-Vereinigung (DMV), Braunschweig 2016 / Bach, V.; Fassbender, H. (ed.). - Hoboken, NJ : Wiley, 2016. - (Proceedings in Applied Mathematics and Mechanics ; 16,1). - pp. 901-902. - eISSN 1617-7061
##### Abstract
In the last two decades, various machine models of computability have been generalized to work in the transfinite. I will give an overview of these models, some of the main results concerning them and some reasons why studying them is of interest outside of foundational considerations.
510 Mathematics
##### Conference
87th Joint Annual Meeting of GAMM and DMV, Mar 7, 2016 - Mar 11, 2016, Braunschweig
##### Cite This
ISO 690CARL, Merlin, 2016. An Invitation to Infinitary Computability. 87th Joint Annual Meeting of GAMM and DMV. Braunschweig, Mar 7, 2016 - Mar 11, 2016. In: BACH, V., ed., H. FASSBENDER, ed.. Special Issue : Joint 87th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM) and Deutsche Mathematiker-Vereinigung (DMV), Braunschweig 2016. Hoboken, NJ:Wiley, pp. 901-902. eISSN 1617-7061. Available under: doi: 10.1002/pamm.201610439
BibTex
@inproceedings{Carl2016-10-25Invit-41338,
year={2016},
doi={10.1002/pamm.201610439},
title={An Invitation to Infinitary Computability},
number={16,1},
publisher={Wiley},
series={Proceedings in Applied Mathematics and Mechanics},
booktitle={Special Issue : Joint 87th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM) and Deutsche Mathematiker-Vereinigung (DMV), Braunschweig 2016},
pages={901--902},
editor={Bach, V. and Fassbender, H.},
author={Carl, Merlin}
}

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#" >
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:issued>2016-10-25</dcterms:issued>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:abstract xml:lang="eng">In the last two decades, various machine models of computability have been generalized to work in the transfinite. I will give an overview of these models, some of the main results concerning them and some reasons why studying them is of interest outside of foundational considerations.</dcterms:abstract>
<dc:language>eng</dc:language>
<dc:creator>Carl, Merlin</dc:creator>
<dcterms:title>An Invitation to Infinitary Computability</dcterms:title>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-14T10:41:37Z</dc:date>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41338"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:contributor>Carl, Merlin</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-14T10:41:37Z</dcterms:available>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
</rdf:Description>
</rdf:RDF>

Yes