Reachability for infinite time Turing machines with long tapes
| Type of Publication: | Journal article |
| Publication status: | Published |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-2-ytm4xcfbzcf43 |
| Author: | Carl, Merlin; Rin, Benjamin; Schlicht, Philipp |
| Year of publication: | 2020 |
| Published in: | Logical Methods in Computer Science ; 16 (2020), 2. - International Federation for Computational Logic (IFCoLog) ; TU Braunschweig. - eISSN 1860-5974 |
| ArXiv-ID: | arXiv:1802.05734 |
| URL of original publication: | https://lmcs.episciences.org/6429, Last access on Sep 16, 2020 |
| DOI (citable link): | https://dx.doi.org/10.23638/LMCS-16(2:2)2020 |
| Subject (DDC): | 510 Mathematics |
| Link to License: | In Copyright |
| Bibliography of Konstanz: | Yes |
| Refereed: | Yes |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
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)2020
@article{Carl2020Reach-50848, title={Reachability for infinite time Turing machines with long tapes}, url={https://lmcs.episciences.org/6429}, year={2020}, doi={10.23638/LMCS-16(2:2)2020}, number={2}, volume={16}, journal={Logical Methods in Computer Science}, author={Carl, Merlin and Rin, Benjamin and Schlicht, Philipp} }
<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/rdf/resource/123456789/50848"> <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"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-16T08:44:19Z</dcterms:available> <dc:language>eng</dc:language> <dcterms:title>Reachability for infinite time Turing machines with long tapes</dcterms:title> <dc:creator>Rin, Benjamin</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/50848"/> <dc:creator>Schlicht, Philipp</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Carl, Merlin</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/50848/1/Carl_2-ytm4xcfbzcf43.pdf"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:contributor>Rin, Benjamin</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:contributor>Schlicht, Philipp</dc:contributor> <dcterms:issued>2020</dcterms:issued> <dc:creator>Carl, Merlin</dc:creator> </rdf:Description> </rdf:RDF>
Downloads since Sep 16, 2020 (Information about access statistics)
| Carl_2-ytm4xcfbzcf43.pdf | 39 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
