Reachability for infinite time Turing machines with long tapes
Reachability for infinite time Turing machines with long tapes
Loading...
Date
2020
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Journal article
Publication status
Published
Published in
Logical Methods in Computer Science ; 16 (2020), 2. - International Federation for Computational Logic (IFCoLog) ; TU Braunschweig. - eISSN 1860-5974
Abstract
Summary in another language
Subject (DDC)
510 Mathematics
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
CARL, Merlin, Benjamin RIN, Philipp SCHLICHT, 2020. Reachability for infinite time Turing machines with long tapes. In: Logical Methods in Computer Science. International Federation for Computational Logic (IFCoLog) ; TU Braunschweig. 16(2). eISSN 1860-5974. Available under: doi: 10.23638/LMCS-16(2:2)2020BibTex
@article{Carl2020Reach-50848, year={2020}, doi={10.23638/LMCS-16(2:2)2020}, title={Reachability for infinite time Turing machines with long tapes}, url={https://lmcs.episciences.org/6429}, number={2}, volume={16}, journal={Logical Methods in Computer Science}, author={Carl, Merlin and Rin, Benjamin and Schlicht, Philipp} }
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/50848"> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Rin, Benjamin</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/50848"/> <dc:creator>Carl, Merlin</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>Attribution 4.0 International</dc:rights> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-16T08:44:19Z</dcterms:available> <dcterms:title>Reachability for infinite time Turing machines with long tapes</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-16T08:44:19Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/50848/1/Carl_2-ytm4xcfbzcf43.pdf"/> <dc:creator>Rin, Benjamin</dc:creator> <dc:creator>Schlicht, Philipp</dc:creator> <dc:contributor>Schlicht, Philipp</dc:contributor> <dcterms:issued>2020</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/50848/1/Carl_2-ytm4xcfbzcf43.pdf"/> <dc:contributor>Carl, Merlin</dc:contributor> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
URL of original publication
Test date of URL
2020-09-16
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Yes