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.

翻译：在本篇文章中, 我们用时间限制和磁带空间限制来调查 TMs 的行为。 问题在 P 中, 当时间限制为单数编码时 。 如果两个限制都达到无限度, 则无法确定其上限先超过多少。 因此可以构造 P 中的不完全的对数组。 这意味着 L$\not =$ P 。