A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Incomplete sets in P for logspace-reduction
[article]
2022
Preserved Fulltext
In this article, we investigate the behaviour of TMs with time limit and tape space limit. This problem is in P when the time limit is unary coded. If both limits go to infinity, it is undecidable which limit is exceeded first. Thus logspace-incomplete sets in P can be constructed. This implies L $\not=$ P.
doi:10.48550/arxiv.2201.08501
fatcat:b6qukhfsozhkzfmnufk6c63g7e