Generating prime numbers

 Generating prime numbers

 
It is known that over the centuries, some people have been involved in discovering algorithms for generating prime numbers. One would not say that it is a difficult thing, as long as you evaluate such an algorithm mainly in terms of its usefulness.
 
An algorithm must be evaluated in terms of its application goals and also over time in terms of the applications for which it has proven itself suitable. Thus, the complexity of an algorithm cannot be a criterion for its evaluation.
 
For example, with regard to the generation of prime numbers, one could, first and foremost and rightly, refer to the Sieve of Eratosthenes or the model: y = 6 * x ± 1 where x = 1, 2, 3, 4, 5, 6, 7, ... and possibly some other algorithms.
 
But let's look at a new proposal of mine for a prime number generation algorithm, which is obviously easy to program, but also seems to have potential in practical applications of quantum mechanics and quantum computing, where, as we know, what we actually perceive (via classical physics) that is, with bits being counted as "0" or "1," and only one of the four possible states can exist at any time in space, in a quantum superposition state, all four of the possible states can co-exist in time and space simultaneously.
 
So, there is an algorithm that can generate prime numbers, essentially as the integer part of decimals resulting from an iterative inversion process, starting with the irrational decimal 0.43233208718590286890... and then all the products of this inversion process. See in the picture what I mean...