Space and Time Complexity for Infinite Time Turing Machines

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Carl, Merlin
Format: Preprint
Publié: 2019
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917506643394560
author Carl, Merlin
author_facet Carl, Merlin
contents We consider notions of space complexity for Infinite Time Turing Machines (ITTMs) that were introduced by B. Löwe and studied further by J. Winter. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$ and P$_{++}=$PSPACE$_{++}$ holds for ITTMs (all three are false). We also show various separation results between space complexity classes for ITTMs. This considerably expands our earlier observations on the topic in section 7.2.2 of \cite{Ca2}, which appear here as Lemma $6$ up to Corollary $9$.
format Preprint
id arxiv_https___arxiv_org_abs_1905_06832
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Space and Time Complexity for Infinite Time Turing Machines
Carl, Merlin
Logic
We consider notions of space complexity for Infinite Time Turing Machines (ITTMs) that were introduced by B. Löwe and studied further by J. Winter. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$ and P$_{++}=$PSPACE$_{++}$ holds for ITTMs (all three are false). We also show various separation results between space complexity classes for ITTMs. This considerably expands our earlier observations on the topic in section 7.2.2 of \cite{Ca2}, which appear here as Lemma $6$ up to Corollary $9$.
title Space and Time Complexity for Infinite Time Turing Machines
topic Logic
url https://arxiv.org/abs/1905.06832