Publikation: Towards a Church-Turing-Thesis for Infinitary Computations
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2013
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
9 th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1 - 5, 2013. 2013
Zusammenfassung
We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability and build a canonical model, called Idealized Agent Machines ($IAM$s) of this which will turn out to be equivalent in strength to the Ordinal Turing Machines defined by P. Koepke.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
CiE, 1. Juli 2013 - 5. Juli 2013, Milan, Italy
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
CARL, Merlin, 2013. Towards a Church-Turing-Thesis for Infinitary Computations. CiE. Milan, Italy, 1. Juli 2013 - 5. Juli 2013. In: 9 th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1 - 5, 2013. 2013BibTex
@inproceedings{Carl2013Towar-25587,
year={2013},
title={Towards a Church-Turing-Thesis for Infinitary Computations},
booktitle={9 th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1 - 5, 2013},
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#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/25587">
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:bibliographicCitation>Vortrag gehalten bei 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013</dcterms:bibliographicCitation>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:abstract xml:lang="eng">We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability and build a canonical model, called Idealized Agent Machines ($IAM$s) of this which will turn out to be equivalent in strength to the Ordinal Turing Machines defined by P. Koepke.</dcterms:abstract>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:issued>2013</dcterms:issued>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:language>eng</dc:language>
<dc:creator>Carl, Merlin</dc:creator>
<dc:rights>terms-of-use</dc:rights>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25587"/>
<dcterms:title>Towards a Church-Turing-Thesis for Infinitary Computations</dcterms:title>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-01-24T09:31:31Z</dcterms:available>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-01-24T09:31:31Z</dc:date>
<dc:contributor>Carl, Merlin</dc:contributor>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
