For over three decades, I followed an original and challenging path to develop a radically new computational theory; Relative Quaternary Fractal Computation Theory or RQF Computation Theory for short (a.k.a. Fractal Hyper Computation Theory). RQF Computation Theory is, as far as I am aware, a brand new area of science and mathematics.
This book shows how my Fractal Computers, Patent Pending, are used to process vision. For more details about RQF computation theory please refer to my book "The Fractal Hyper Computer" as well as my patent at: http://www.freepatentsonline.com/20160004958.pdf
The Traveling Salesman Problem or TSP is frequently quoted as *the* problem that a quantum computer could solve astronomically faster than a classical computer; the quantum computer experts say it takes a classical computer longer than the age of the universe to solve a 30 city TSP. Is this true? Not so...there is published scientific research, including from major respected universities, showing that an optimization algorithm based on ant colony principles, running on a slow classical computer in emulation mode, can solve a 170 city TSP in around 1 minute and a 783 city TSP in 20 minutes? The age of the universe compared to less than a minute is a pretty large difference. What is going on here; a classical computer is running enormously faster than it should, according to the quantum computer experts? The answer lies in the algorithm...it is an RQF computation algorithm. This class of algorithm is created by and runs natively on a fractal computer. It perfectly matches the fractal computer's algorithm mechanisms and framework. A solution (definition thread with lowest energy) is evolved in a lattice by the use of relativity and concurrence to pair nodes together. Quantum entanglement or "spooky action at a distance" is not needed by the ants, the ant colony simulations or the fractal computer.
Even the latest 'quantum computer' headlines appear sensationalized. "Quantum computers are now proven to work" they proclaim. How can they claim to have proved anything of the sort when in fact the magical ‘quantum speedup’ still remains purely in the realm of science fiction (on their own admission but buried in the small print) and *not* science fact as their news headlines would have you believe. Additionally, when they performed their test slightly differently, the extremely specialized, narrow and carefully picked problem that the 'quantum computer' is known to excel at, actually ran *slower* on the 'quantum computer' when bench-marked against a basic single CPU regular PC running the best known algorithms currently available. And this happened *every* time the test was run. Yes you read that right...in a head to head with a quantum computer, the humble PC wins every time. That was indeed a watershed announcement. This is the clearest proof yet that quantum computers don't work! The claimed magic of the magical quantum computer appears to have more to do with smoke and mirror tactics than with anything tangible. The magical quantum computer that uses magical qubits that can be both on and off at the same time to produce the supremely magical 'quantum speedup' effect is fast becoming a farce of epic proportions. Quantum computer theory is imploding right in front of our eyes and everyone knows it.
It would appear that the polynomial time computational speedup, that is often given as *the* big selling point for quantum computers, is actually achievable without using quantum effects at all. Polynomial time speedup appears to be an intrinsic and natural part of the massively parallel fractal computer.
So what then could nature's native method of computation actually be based on? Perhaps probabilistic Spooky-action Qubit Magic (SQM), or maybe deterministic Relative Quaternary Fractals (RQF) or perhaps something else entirely?
Please note, I have no plans at present to release any further books or editions.
Thank you for reading
This book shows how my Fractal Computers, Patent Pending, are used to process vision. For more details about RQF computation theory please refer to my book "The Fractal Hyper Computer" as well as my patent at: http://www.freepatentsonline.com/20160004958.pdf
The Traveling Salesman Problem or TSP is frequently quoted as *the* problem that a quantum computer could solve astronomically faster than a classical computer; the quantum computer experts say it takes a classical computer longer than the age of the universe to solve a 30 city TSP. Is this true? Not so...there is published scientific research, including from major respected universities, showing that an optimization algorithm based on ant colony principles, running on a slow classical computer in emulation mode, can solve a 170 city TSP in around 1 minute and a 783 city TSP in 20 minutes? The age of the universe compared to less than a minute is a pretty large difference. What is going on here; a classical computer is running enormously faster than it should, according to the quantum computer experts? The answer lies in the algorithm...it is an RQF computation algorithm. This class of algorithm is created by and runs natively on a fractal computer. It perfectly matches the fractal computer's algorithm mechanisms and framework. A solution (definition thread with lowest energy) is evolved in a lattice by the use of relativity and concurrence to pair nodes together. Quantum entanglement or "spooky action at a distance" is not needed by the ants, the ant colony simulations or the fractal computer.
Even the latest 'quantum computer' headlines appear sensationalized. "Quantum computers are now proven to work" they proclaim. How can they claim to have proved anything of the sort when in fact the magical ‘quantum speedup’ still remains purely in the realm of science fiction (on their own admission but buried in the small print) and *not* science fact as their news headlines would have you believe. Additionally, when they performed their test slightly differently, the extremely specialized, narrow and carefully picked problem that the 'quantum computer' is known to excel at, actually ran *slower* on the 'quantum computer' when bench-marked against a basic single CPU regular PC running the best known algorithms currently available. And this happened *every* time the test was run. Yes you read that right...in a head to head with a quantum computer, the humble PC wins every time. That was indeed a watershed announcement. This is the clearest proof yet that quantum computers don't work! The claimed magic of the magical quantum computer appears to have more to do with smoke and mirror tactics than with anything tangible. The magical quantum computer that uses magical qubits that can be both on and off at the same time to produce the supremely magical 'quantum speedup' effect is fast becoming a farce of epic proportions. Quantum computer theory is imploding right in front of our eyes and everyone knows it.
It would appear that the polynomial time computational speedup, that is often given as *the* big selling point for quantum computers, is actually achievable without using quantum effects at all. Polynomial time speedup appears to be an intrinsic and natural part of the massively parallel fractal computer.
So what then could nature's native method of computation actually be based on? Perhaps probabilistic Spooky-action Qubit Magic (SQM), or maybe deterministic Relative Quaternary Fractals (RQF) or perhaps something else entirely?
Please note, I have no plans at present to release any further books or editions.
Thank you for reading
