The Golden Ticket Searching the Impossible Fractal Geometrical Parallels to solve the  Millennium, P vs. NP Open Problem

Authors

https://doi.org/10.48314/ceti.vi.51

Abstract

The two major unresolved issues in current mathematics and computer science addressed in this paper are fractal geometry and the P vs. NP problem. Benoît Mandelbrot's pioneering work in fractal geometry provides a mathematical basis for comprehending the complex, self-similar forms common in nature defined by non-integer dimensions. Its uses range from computer graphics to erratic systems across several spheres. On the other hand, the P versus A Millennium Prize Problem, NP problem answers the basic question of whether issues with quickly verifiable answers may also be effectively resolved. Emphasizing their status as important frontiers of knowledge, this article explores the basic ideas of both fields, their current knowledge, and the severe consequences their eventual resolution would have on scientific investigation and technology development.

Keywords:

Fractal geometry, the P vs. NP problem

References

  1. [1] Kyritsis, K. E. (2023). The simplest possible fully correct solution of the clay millennium problem about P vs. NP. A simple proof that P≠ NP= EXPTIME. Journal of computer and communications, 11(8), 181-194. https://hal.science/hal-04192246/
  2. [2] Vega, F. (2024). Note for the millennium prize problems. https://doi.org/10.33774/coe-2024-xjsk1-v7
  3. [3] Mageed, I. A. (2024). The fractal dimension theory of ismail’s third entropy with fractal applications to cubesat technologies and education. Complexity analysis and applications, 1(1), 66–78. https://doi.org/10.48314/caa.v1i1.31
  4. [4] Mageed, I. A. (2024). Fractal dimension of the generalized z-entropy of the rényian formalism of stable queue with some potential applications of fractal dimension to big data analytics. https://doi.org/10.20944/preprints202401.2038.v1
  5. [5] Mageed, I. A. (2024). Fractal dimension (Df) theory of ismail’s entropy (IE) with potential df applications to structural engineering. Journal of intelligent communication, 3(2), 111–123. https://doi.org/10.54963/jic.v3i2.258
  6. [6] Mageed, I. A., & Bhat, A. H. (2022). Generalized Z-entropy (GZE) and fractal dimensions. Applied mathematics, 16(5), 829–834. http://dx.doi.org/10.18576/amis/160517
  7. [7] Mageed, I. A., & Bhat, A. H. (2024). Fractal dimension of generalized renyian entropy with potential fractal dimension applications to smart cities. https://www.researchgate.net/publication/381995256%0D
  8. [8] Mageed, I. A. (2025). Fractal open problems in cancer research, medicine, biomedicine, clinical sciences, and dentistry. Journal of advances in medical and biomedical research, 4 (1), 01-09. https://www.researchgate.net/publication/388474056%0D
  9. [9] Mageed, I. A., & Mohamed, M. (2023). Chromatin can speak fractals: A review. https://www.researchgate.net/publication/374583965%0D
  10. [10] Linton. (2021). Fractals. eBook partnership. IEEE.
  11. [11] Mageed, I. A. (2023). Fractal dimension (DF) theory of Ismail’s second entropy (H Q I) with potential fractal applications to ChatGPT, distributed ledger technologies (DLTS) and image processing (IP). 2023 International conference on computer and applications (ICCA). ICCA (pp. 1–6). https://doi.org/10.1109/ICCA59364.2023.10401817
  12. [12] Strogatz, S. H. (2024). Nonlinear dynamics and chaos: With applications to physics, biology, chemistry, and engineering. Chapman and Hall/CRC. https://doi.org/10.1201/9780429398490
  13. [13] Bhat, A. H., & Mageed, I. A. (2023). Generalised Z-entropy (GZE) and fractal dimensions (FDs). In Fractal analysis-applications and updates. IntechOpen. https://doi.org/10.5772/intechopen.1001872
  14. [14] dos Anjos, P. H. R., Gomes-Filho, M. S., Alves, W. S., Azevedo, D. L., & Oliveira, F. A. (2021). The fractal geometry of growth: Fluctuation-dissipation theorem and hidden symmetry. Frontiers in physics, 9, 741590. https://doi.org/10.3389/fphy.2021.741590
  15. [15] Troscheit, S. (2022). Fractal geometry. Course notes. https://www.troscheit.eu/FractalGeometry.pdf
  16. [16] Germain, S., Montage, S., Wiles, A., & Applewhite, D. (2023). Picture credits. The millennium prize problems, 161. https://b2n.ir/yx4285
  17. [17] Oliveira, I. C. (2025). SIGACT news complexity theory column 124 meta-mathematics of computational complexity theory. ACM sigact news, 56(1), 41–68. https://doi.org/10.1145/3726856.3726862%0A
  18. [18] Lancini, E. (2019). TDIness and multicuts [Thesis]. https://theses.hal.science/tel-03237390/
  19. [19] Mageed, I. A. (2024). A theory of everything: When Information geometry meets the generalized brownian motion and the einsteinian relativity. https://b2n.ir/pp4111
  20. [20] Mageed, I. A. (2023). Fractal dimension (Df) of Ismail’s fourth entropy (HIV⁽q,a1, a2,..,ak⁾) with fractal applications to algorithms, haptics, and transportation. In 2023 international conference on computer and applications (ICCA) (pp. 1-6). IEEE. https://doi.org/10.1109/ICCA59364.2023.10401780
  21. [21] Fraser, J. M. (2025). Applications of dimension interpolation to orthogonal projections. Research in the mathematical sciences, 12(1), 10. https://doi.org/10.1007/s40687-025-00496-9
  22. [22] Husain, A., Nanda, M. N., Chowdary, M. S., & Sajid, M. (2022). Fractals: An eclectic survey, part-I. Fractal and fractional, 6(2), 89. https://doi.org/10.3390/fractalfract6020089
  23. [23] Adolfi, F., Wareham, T., & Van Rooij, I. (2022). Computational complexity of segmentation. https://doi.org/10.48550/arXiv.2201.13106
  24. [24] Chowdhury, M. M. H., & Quaddus, M. (2017). Supply chain resilience: Conceptualization and scale development using dynamic capability theory. International journal of production economics, 188, 185–204. https://doi.org/10.1016/j.ijpe.2017.03.020
  25. [25] Denning, P. J., & Tedre, M. (2021). Computational thinking: A disciplinary perspective. Informatics in education, 20(3), 361. https://www.infedu.vu.lt/journal/INFEDU/article/701/file/pdf
  26. [26] Okhmatovski, V., & Zheng, S. (2024). Theory and computation of electromagnetic fields in layered media. John Wiley & Sons. https://books.google.com/books?id=ZXMBEQAAQBAJ&printsec=frontcover#v=onepage&q&f=false
  27. [27] Cook, S. A. (2023). The complexity of theorem-proving procedures. In Logic, automata, and computational complexity: the works of Stephen A. cook (pp. 143–152). https://doi.org/10.1145/3588287.3588297
  28. [28] Hassan, S. M., Hussain, S., & Samad, A. (2024). Reducibility among NP-Hard graph problems and boundary classes. https://doi.org/10.48550/arXiv.2411.14553
  29. [29] Papadimitriou, C. H. (2003). Computational complexity. In Encyclopedia of computer science (pp. 260–265). https://dl.acm.org/doi/abs/10.5555/1074100.1074233
  30. [30] Anand, B. S. (2024). Why the classes P and NP are not well-defined finitarily. https://doi.org/10.48550/arXiv.2401.09478
  31. [31] Blum, L., & Blum, M. (2024). AI consciousness is inevitable: A theoretical computer science perspective. https://doi.org/10.48550/arXiv.2403.17101
  32. [32] Grabowska, A., & Gunia, A. (2024). On quantum computing for artificial superintelligence. European journal for philosophy of science, 14(2), 25. https://doi.org/10.1007/s13194-024-00584-7
  33. [33] Goldwasser, S., Micali, S., & Rivest, R. L. (2019). A "Paradoxical" solution to the signature problem. In Providing sound foundations for cryptography: On the work of shafi goldwasser and silvio micali (pp. 265–284). https://doi.org/10.1145/3335741.3335753
  34. [34] Facco, E., & Fracas, F. (2022). De rerum (incerta) natura: A tentative approach to the concept of “Quantum-like”. Symmetry, 14(3), 480. https://doi.org/10.3390/sym14030480
  35. [35] Bossaerts, P., Yadav, N., & Murawski, C. (2019). Uncertainty and computational complexity. Philosophical transactions of the royal society B, 374(1766), 20180138. https://doi.org/10.1098/rstb.2018.0138
  36. [36] Sherry, Y., & Thompson, N. C. (2021). How fast do algorithms improve? Proceedings of the IEEE, 109(11), 1768-1777. https://doi.org/10.1109/JPROC.2021.3107219

Downloads

Published

2025-04-27

Issue

Vol. 2 No. 2 (2025): Computational Engineering and Technology Innovations

Section

Articles

How to Cite

Mageed, I. A., & Li, H. (2025). The Golden Ticket Searching the Impossible Fractal Geometrical Parallels to solve the  Millennium, P vs. NP Open Problem. Computational Engineering and Technology Innovations, 2(2), 81-87. https://doi.org/10.48314/ceti.vi.51