Symbolic Collapse Intractability Hypothesis: P ≠ NP

Authors

  • Justin Kornhaus

Symbolic Collapse Intractability Hypothesis and leverages symbolic entropy

Abstract

The following proof focuses on the Symbolic Collapse Intractability Hypothesis and leverages symbolic entropy recursive tractability and structural complexity to argue that NPcomplete problems with high entropy are intractable in polynomial time implying P NP

Downloads

How to Cite

Symbolic Collapse Intractability Hypothesis: P ≠ NP. (2025). Global Journal of Science Frontier Research, 25(F1), 1-5. https://journalofscience.org/index.php/GJSFR/article/view/103027

 

References

Symbolic Collapse Intractability Hypothesis: P ≠ NP

Published

2025-09-03

Issue

Vol. 25 No. F1 (2025): GJSFR-F Mathematics & Decision: Volume 25 Issue F1

Section

Articles

License

Copyright (c) 2025 Authors and Global Journals Private Limited

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Symbolic Collapse Intractability Hypothesis: P ≠ NP. (2025). Global Journal of Science Frontier Research, 25(F1), 1-5. https://journalofscience.org/index.php/GJSFR/article/view/103027