On Invariance and Convergence in Time Complexity theory
Computational Complexity
2007-05-23 v1
Abstract
This article introduces three invariance principles under which P is different from NP. In the second part a theorem of convergence is proven. This theorem states that for any language L there exists an infinite sequence of languages from O(n) that converges to L.
Cite
@article{arxiv.cs/0411033,
title = {On Invariance and Convergence in Time Complexity theory},
author = {Mircea Alexandru Popescu Moscu},
journal= {arXiv preprint arXiv:cs/0411033},
year = {2007}
}