Developing a New Software Library for Super Calculations on Infinity Numbers while Providing Infinite Persistent Precision in the Technical Context of P versus NP whereas Programming on Artificial Intelligence

International Journal of Computer Science and Engineering

© 2023 by SSRG - IJCSE Journal

Volume 10 Issue 11

Year of Publication : 2023

Authors : Yassine Larbaoui

10.14445/23488387/IJCSE-V10I11P107

How to Cite?

Yassine Larbaoui, "Developing a New Software Library for Super Calculations on Infinity Numbers while Providing Infinite Persistent Precision in the Technical Context of P versus NP whereas Programming on Artificial Intelligence," SSRG International Journal of Computer Science and Engineering , vol. 10,  no. 11, pp. 49-62, 2023. Crossref, https://doi.org/10.14445/23488387/IJCSE-V10I11P107

Abstract:

This paper presents a new computation software library, which we developed for super arithmetic calculations and massive binary operations on infinity numbers that require more than 64 bits to be expressed by manifesting the possibility of expressing these numbers on infinite quantities of virtual bites reassembled in subgroups while providing infinite persistent precision. Then, we integrated this library into an application, which we named Super Infinity Calculator. We reinforced this software library with an Artificial Intelligence entity, which we programmed to manage the used hardware resources of processors and data storing memories during the executed calculations to handle infinity numbers while executing calculations on them in a short time. This Artificial Intelligence entity is incharge of forwarding computation on infinite subgroups of virtual bites in parallel and recursively when necessary while monitoring their results. The programmed functionalities of this Artificial Intelligence entity play a principal role in supporting the execution of computation calculations on super numbers with lengths exceeding Gigabytes and Terabytes while providing infinite persistent precision for each digit of them, including the ones after the floating point. As a result, these developed software resources allow us to shift various super calculations on infinity numbers from NP to P by executing them in the linear dimension of time instead of consuming exponential time.

Keywords:

Artificial Intelligence, Infinite persistent precision, Parallel computation, P Versus NP, Super computational calculations, Super infinity number.

References:

[1] M. Friedewald, “The First Computers-History and Architectures [Review],” IEEE Annals of the History of Computing, vol. 23, no. 2, pp. 75-76, 2001.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Akira Maruoka, Concise Guide to Computation Theory, Springer, London, pp. 205–421, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[3] J. Hartmanis, and R.E. Stearns, “On the Computational Complexity of Algorithms,” Transactions of the American Mathematical Society, vol. 117, no. 1, pp. 285-285, 1965.
[Google Scholar] [Publisher Link]
[4] Yaroslav D. Sergeyev, and Garro Alfredo, “Observability of Turing Machines: A Refinement of the Theory of Computation,” Informatica, vol. 21, no. 3, pp. 425–454, 2010.
[Google Scholar] [Publisher Link]
[5] Sven Ove Hansson, “Technology and Mathematics,” Philosophy & Technology, Springer, vol. 33, pp. 117–13, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Yaroslav D. Sergeyev, Arithmetic of Infinity, Edizioni Orizzonti Meridionali, vol. 103, pp.51-57, 2003.
[Publisher Link]
[7] Yaroslav D. Sergeyev, “A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities,” Informatica, vol. 19, no. 4, pp. 567–59, 2008.
[Google Scholar] [Publisher Link]
[8] Yaroslav D. Sergeyev, “Methodology of Numerical Computations with Infinities and Infinitesimals,” Rendiconti del Seminario Matematico dell’Universit e del Politecnico di Torino, vol. 68, no. 2, pp. 95–113, 2010.
[Google Scholar] [Publisher Link]
[9] Yaroslav D. Sergeyev, “Computer System for Storing Infinite, Infinitesimal, and finite Quantities and Executing Arithmetical Operations with Them,” EU patent 1728149, issued 03.06.2009; RF patent 2395111, issued 20.07.2010; USA patent 7,860,914 issued 28.12.2010.
[Google Scholar] [Publisher Link]
[10] Yaroslav D. Sergeyev, “Numerical Point of View on Calculus for Functions Assuming Finite, Infinite and Infinitesimal Values Over Finite, Infinite, and Infinitesimal Domains,” Nonlinear Analysis Series A: Theory, Methods & Applications, vol. 71, no. 12, pp. 1688– 1707, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Gabriele Lolli, “Infinitesimals and Infinites in the History of Mathematics: A Brief Survey,” Applied Mathematics and Computation, vol. 218, no. 16, pp. 7979–7988, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[12] M. Margenstern, “Using Grossone to Count the Number of Elements of Infinite Sets and the Connection with Bijections,” P-Adic Numbers, Ultrametric Analysis and Applications, vol. 3, no. 2, pp. 196–204, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Louis D’Alotto, “Cellular Automata Using Infinite Computations,” Applied Mathematics and Computation, vol. 218, no. 16, pp. 8077– 8082, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Sonia De Cosmis, and Renato De Leone, “The Use of Grossone in Mathematical Programming and Operations Research,” Applied Mathematics and Computation, vol. 218, no. 16, pp. 8029–8038, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[15] D.I. Iudin, Ya. D. Sergeyev, and M. Hayakawa, “Interpretation of Percolation in Terms of Infinity Computations,” Applied Mathematics and Computation, vol. 218, no. 16, pp. 8099–8111, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Yaroslav D. Sergeyev, and Alfredo Garro, “The Grossone Methodology Perspective on Turing Machines,” Automata, Universality, Computation, vol. 12, pp. 139-169, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Yaroslav D. Sergeyev, “Numerical Computations and Mathematical Modelling with Infinite and Infinitesimal Numbers,” Applied Mathematics and Computation, vol. 29, pp. 177–195, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Anatoly Zhigljavsky, “Computing Sums of Conditionally Convergent and Divergent Series Using the Concept of Grossone,” Applied Mathematics and Computation, vol. 218, no. 16, pp. 8064–8076, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Jean-Michel Muller et al., Handbook of Floating-Point Arithmetic, Birkhäuser Boston, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Yaroslav D. Sergeyev, “Mathematical Foundations of the Infinity Computer,” Annales UMCS Informatica AI, vol. 4, pp. 20-33, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Manish Agrawal, and Grandon Gill, “Infinity Computer Solutions: Ramping Up,” Journal of Information Technology Education Discussion Cases, vol. 1, no. 1, pp. 1-22, 2012.
[Google Scholar] [Publisher Link]
[22] R. Gioiosa, Resilience for Extreme Scale Computing, Rugged Embedded Systems, pp. 123-148, 2017.
[Google Scholar]
[23] Andrej Dujella, Number Theory, University of Zagreb textbooks, 2019.
[Google Scholar] [Publisher Link]
[24] David Sager, “Quantum Mechanics Model,” Quantum Mechanics and Nanoptics, 2019.
[Google Scholar]
[25] George Panagiotopoulos et al., “The Underground Atlas Project: Can We Really Crowdsource the Underground Space?,” Procedia Engineering, vol. 165, pp. 233-241, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[26] Stephen Bonner et al., “Exploring the Evolution of Big Data Technologies,” Software Architecture for Big Data and the Cloud, pp. 253- 283, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[27] D. Ramesh et al., “Python Based Implementation towards Cloud and Big Data Analytics for high Performance Applications,” Materials Today: Proceeding, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[28] Krish Krishnan, Building Big Data Applications, Academic Press, 2020.
[Google Scholar] [Publisher Link]
[29] Philipp Neumann, and Julian Kunkel, “High-Performance Techniques for Big Data Processing,” Knowledge Discovery in Big Data from Astronomy and Earth Observation, pp. 137-158, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[30] Burt Kaliski, “Exponential Time,” Encyclopedia of Cryptography and Security, Springer, Boston, pp. 434, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[31] Vincent T’kindt, Lei Shang, and Federico Della Croce, “Exponential Time Algorithms for Just-in-Time Scheduling Problems with Common due Date and Symmetric Weights,” Journal of Combinatorial Optimization, vol. 39, pp. 764–775, 2020.
[CrossRef] [Google Scholar] [Publisher Link]