How to Submit
Browse
Events
Communities
About

General Statement towards “P versus NP” Theorem Disproof

24 September 2026, Version 1
Working Paper
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

In this work, we are to present our general statement towards recent disproof of “P versus NP” theorem on artificial virtual machine with parallelized computations, we are also to justify our disproof accordingly and make general assumptions regarding the outcome of the previously exhibited fact that none of the competing complexity tasks on our experimental virtual machine achieve the equivalence due to the reasonable effect which is provided in this short work as well as other valuable considerations

Keywords

theorem
P versus NP
disproof
statement
philosophy

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.

Version History

Sep 24, 2026 Version 1

Metrics

99
9
0
Views
Downloads
Citations

License

CC logo
CC
BY logo
BY
The content is available under CC BY 4.0 [opens in a new tab]

DOI

10.33774/coe-2026-1f8h3
D O I: 10.33774/coe-2026-1f8h3 [opens in a new tab]

Author’s competing interest statement

The author(s) have declared they have no conflict of interest with regard to this content

Ethics

The author(s) declare that they have sought and gained approval from the relevant ethics committee/IRB for this research and its publication.

Share