Incomplete sets in P for logspace-reduction
Computational Complexity
2022-01-24 v1
Abstract
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 P.
Cite
@article{arxiv.2201.08501,
title = {Incomplete sets in P for logspace-reduction},
author = {Reiner Czerwinski},
journal= {arXiv preprint arXiv:2201.08501},
year = {2022}
}