T Lin - arXiv preprint arXiv:2308.09549, 2023 - arxiv.org
In this paper, we extend the techniques used in our previous work to show that there exists a probabilistic Turing machine running within time $ O (n^ k) $ for all $ k\in\mathbb {N} _1 …
IV Latkin - arXiv preprint arXiv:2311.01184, 2023 - arxiv.org
We investigate the correspondence between the time and space recognition complexity of languages; for this purpose, we will code the long-continued computations of deterministic …
Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook …
Northeastern University On Approximating by Polynomials and Several Related Models A dissertation submitted in partial satisfact Page 1 Northeastern University On Approximating by …
Using the simple fact described in the title, we prove the existence of a computational problem with implications to Machine Learning, Quantum Mechanics and Complexity …
In this paper I present probably the simplest possible abstract formal proof that P≠ NP, and NP= EXPTIME, in the context of the Zermelo-Frankel set theory and deterministic Turing …
In this paper I present probably the simplest possible abstract formal proof that P≠ NP, and NP= EXPTIME, in the context of the Zermelo-Frankel set theory and deterministic Turing …
Доказательство. Для многоленточной машины Тьюринга M, пусть σ (M)∈{0, 1}∗—её запись в виде строки. В доказательстве будет использоваться искусственно …