Category: Computer Science

Posted on

Worldview Manager Hits Prime Time

The Optimizer ideas on Worldview Manager gets written up in Forbes.

The program will work by showing users a list of statements about a topic and then asking them how strongly they agree or disagree with each. At the end, the system will present users with a list of the statements they endorsed that contradict one another. It will also suggest that users reconsider those views and the assumptions behind them.
Similar teaching programs already exist for narrow fields, especially in technical areas of philosophy. Aaronson, though, is extremely ambitious for Worldview Manager and wants it to cover all the hot-button issues: gay marriage, the Middle East and more.
The program won’t take sides. In fact, two people with opposite ideas about, say, animal rights, could both get the equivalent of a passing score from the program, as long as their ideas were internally consistent.

For some reason this last line reminds me of a line from Emerson: “A foolish consistency is the hobgoblin of little minds.” Please rank: consistent and wrong, inconsistent and correct, consistent and right, or inconsistent and wrong. Of course you will yell that it is impossible to be inconsistent and correct, but I just watched a PBS special on quantum gravity (the one where the narrator talks really really slow. Does this really help people understand?), so for now I believe otherwise.

Posted on

ACM Classic Books

Via Michael Nielsen’s friendfeed, I am led to ACM Classic Books Series. If you’ve got ACM subscription access, some of the book are even in electronic form. Cool. I love the introduction to “The Computer and the Brain” by John von Neumann:

Since I am neither a neurologist nor a psychiatrist, but a mathematician, the work that follows requires some explanation and justification. It is an approach toward the understanding of the nervous system from the mathematician’s point of view. However, this statement must immediately be qualified in both of its essential parts.

I feel like I need to use an intro like this everytime I submit a paper to a computer science conference.

Posted on

Original McEliece Cracked

Shor’s algorithm is an algorithm for quantum computers which allows for efficiently factoring of numbers. This in turn allows Shor’s algorithm to break the RSA public key cryptosystem. Further variations on Shor’s algorithm break a plethora of other public key cryptosystems, including those based on elliptic curves. The McEliece cryptosystem is one of the few public key cryptosystems where variations on Shor’s algorithm do not break the cryptosystem. Thus it has been suggested that the McEliece cryptosystem might be a suitable cryptosystem in the “post quantum world”, i.e. for a world where a quantum computer is built (and if your a commenter who wishes to simply post the quantum computers are like string theory, please…save your keystrokes.)
Continue reading “Original McEliece Cracked”

Posted on

Majority Gate Reality

The universe doesn’t always operate the way we want it to. No, I’m not talking about the stock market (unless you’ve been short lately), I’m talking about the role of error in logical deterministic systems! When you zoom down far enough into any computing device you’ll see that its constituent components don’t behave in a completely digital manner and all sorts of crazy random crap (technical term) is going on. Yet, on a larger scale, digital logical can and does emerge.
Today heading to work in the early dawn I was pondering what all of this meant for our notion of reality.
Continue reading “Majority Gate Reality”

Posted on

DonorChoose Challenge: Pseudo Physicists Unite!

DonorChoose, an organization which matches teachers requests for funds with donors, is running their annual blogger challenge. Already Cosmic Variance is trying to harness their vast resources of physicists, The Optimizer is appealing to the base nerd in everyone, He of Uncertain Principles is offering up his dog’s services for donations (does the dog know?), and the moral Mathematician is offering solutions to math homework problems (err I mean blog posts on a chosen topic.) But I think you shouldn’t fall in this trap and support those blogs….
Because, of course instead you should support my “Pseudo Physicists Unite!” DonorsChoose challenge!

Okay so why should you choose my projects to donate to over all the others out there in the great vacuum of the blogosphere? Reasons: my favorite things to give!
Continue reading “DonorChoose Challenge: Pseudo Physicists Unite!”

Posted on

Holevo Additivity Falls? The Quantum Universe Gets Even Stranger

Major news from the quantum information front. Today I see posted on the arXiv a paper by M.B. Hastings: arXiv:0809.3972 “A Counterexample to Additivity of Minimum Output Entropy.” If correct this resolves one of the most famous open problems in quantum information theory, and, even more interestingly says that in a quantum world, transmitting classical information down quantum channel defies your classical intuition. Blessed be our quantum world, which just continues and continues to amaze.
Continue reading “Holevo Additivity Falls? The Quantum Universe Gets Even Stranger”

Posted on

Kitaev Wins MacArthur!

I just saw the news that Alexei Kitaev, a pioneer in quantum computing and an incredible physicst/computer scientist, has won a MacArthur “genius” award. Awesome!
Kitaev was my next door neighbor while I was a postdoc at Caltech, and among the many highlights of my short life I count listening to Kitaev’s amazing, confounding, brilliant and way over my head ideas. One event in particular I will always remember involved Alexei talking to theoretical computer scientists and, halfway through the talk, pointing out how Majorana fermions were essential to understanding what was going on in that particular computer science problem. Sure in retrospect I understood what he was saying, but how the hell did he make that connection?!?! Truly a genius and completely deserving of the MacArthur award. Congrats Alexei!
Update 8pm PST: Seems that news article has been taken down. Hmm.
Update 12:30am PST List of fellows now posted here. In a local note, David Montgomery who studies geomorphology has also been named a MacArthur fellow.

Posted on

NSF Expeditions Awarded

“Expeditions in Computing awards” are ten million dollar NSF grants from the Directorate for Computer and Information Science and Engineering to pursue long-term research agendas. My favorite kinds of projects: high risk, high reward, and long term. Today the first four award winners have been announced. The winning programs are

  • Open Programmable Mobile Internet 2020
  • The Molecular Programming Project
  • Understanding, Coping with and Benefiting from Intractibility
  • Computational Sustainability: Computational Methods for a Sustainable Environment, Economy and Society

Of note for the theoretical computer science crowd is the third of these, won by a Princeton area team (lead by Sanjeev Arora), which is going to establish a “Center for Intractability” at Princeton. Very cool. And now I know where to go if I ever need a traveling salesman.