P.O. Box 98199
Washington, DC 20090-8199
Cool, but it’s a bit silly that there has to be a lot more processing power in the computer that runs the thing than in the Turing machine itself.
That’s the nature of computational universality! Even a linear overhead is embarrassing when you look at it carefully enough.
Those things are cool!!! The possibilities with technology are endless.
It’s like making a 32-qubit quantum computer and using it to simulating the flipping of a coin.
Intermediate in silliness, there was that Russian computer science guy, decades ago, who determined that the optimum base for computer arithmetic was e. Since e is closer to 3 than to 2, he suggested that flip-flap-flop circuits would be better than flip-flop circuits. So an institute built a fundemantally trinary computer. Then the software team mapped 3^3 = 27 into 10 digits plus some punctuation, and did everything very inefficiently in decimal arithmetic.
This blog has moved. The new location is http://dabacon.org/pontiff.
So long and thanks for all the…
Yep, it’s that time again. Paper dance time!
Making Classical Ground State Spin Computing Fault-Tolerant
Oh, damn, I missed Bacon Camp. Well I’ll just have to go camping myself …
Congrats to Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous for being selected a best…
I grew up in the small town of Yreka, CA (“Yreka Bakery” backwards is…) that sits…