Towards a Church-Turing-Thesis for Infinitary Computations

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

CARL, Merlin, 2013. Towards a Church-Turing-Thesis for Infinitary Computations. CiE. Milan, Italy, 1. Jul 2013 - 5. Jul 2013. In: 9 th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1 - 5, 2013. CiE. Milan, Italy, 1. Jul 2013 - 5. Jul 2013

@inproceedings{Carl2013Towar-25587, title={Towards a Church-Turing-Thesis for Infinitary Computations}, year={2013}, booktitle={9 th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1 - 5, 2013}, author={Carl, Merlin} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/25587"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-01-24T09:31:31Z</dcterms:available> <dcterms:title>Towards a Church-Turing-Thesis for Infinitary Computations</dcterms:title> <dcterms:bibliographicCitation>Vortrag gehalten bei 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013</dcterms:bibliographicCitation> <dc:contributor>Carl, Merlin</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25587"/> <dc:creator>Carl, Merlin</dc:creator> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-01-24T09:31:31Z</dc:date> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:issued>2013</dcterms:issued> <dc:rights>deposit-license</dc:rights> <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> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto