Discussion
if anyone else ever gets a quantum computing grifter in their face saying things like "sigh no, of course it doesn't just try every possibility in parallel" as if that were a childish and exasperating misconception, as if it pained their massive world-weary genious psyche to fend off the rabble each day......
......please feel free to tell them the most evil people in the entire world made up a roko's basilisk for the discrete log problem
quantum computing was actually the second wave
https://en.wikipedia.org/wiki/Quantum_Turing_machine
In 1980 and 1982, physicist Paul Benioff published articles[5][6] that first described a quantum-mechanical model of Turing machines. A 1985 article written by Oxford University physicist David Deutsch further developed the idea of quantum computers by suggesting that quantum gates could function in a similar fashion to traditional digital computing binary logic gates.[4]
https://en.wikipedia.org/wiki/Quantum_computing
In 1980, Paul Benioff introduced the quantum Turing machine, which used quantum theory to describe a simplified computer.[9]
the first wave was much closer to the matrix multiplication circejerk that is now in force today
https://sci-hub.red/storage/moscow/1854/aa5e8e92676bc6e1f7c540b1861796a5/gill1977.pdf
COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES *
what's the asterisk this time?
Received by the editors June 1, 1976, and in revised form February 18, 1977.
backdating. it's for backdating
4. An example of probabilistic speedup.
the terminology is completely unchanged. "quantum advantage. quantum supremacy"
A probabilistic machine recognizes a language if the machine computes the characteristic function of the language.
here you can see precisely how chomsky's "formal languages" grift was always intended to serve the rankest "AI" propaganda
(i) PP is the class of languages recognized by polynomial
bounded PTMs.
the prime number boys are obsessed with their own penis
(ii) BPP is the class of languages recognized by polynomial bounded PTMs with bounded error probability.
i think this one was actually the most shrewd, because it took a concept like "bounded error" which has meaning in REAL ACTUAL SCIENCE BY SCIENTISTS and moved into the asymptotic realm which has meaning in REAL ACTUAL MATHEMATICS DONE BY MATHEMATICIANS. unfortunately very clever of them
(iii) ZPP is the class of languages recognized by PTMs with polynomial bounded average run time and zero error probability.
they never mention this again except to say
We can suggest no language in ZPP
before, again, mentioning prime number factorization shit
literally who does this
@hipsterelectron No-one serious. Have they heard of big {}? Evidently not.
they have "probabilistic tape" now too which sounds like a willy wonka secret candy invention. nope! it's all fascism all the way down
Install bonfire.cafe
Get the full app experience
