2009•Lecture notes in computer scienceRequires access
Is P = PSPACE for Infinite Time Turing Machines?
Joost de Winter
Open publisher page 5 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Joost de Winter
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Turing machine, Time hierarchy theorem, PSPACE, DTIME, Complexity class, Computation, Computer science, Time complexity