Incomplete sets in P for logspace-reduction
share
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.
READ FULL TEXT