My diavlog with Anthony Aguirre

FOR IMMEDIATE RELEASE
(Free-Press-Release.com) February 18, 2011 -- Bloggingheads just released a hour, I diavlog between cosmologist Anthony curly blogs. The scope of the discussion includes: the anthropic principle, How to apply the quantum mechanics, if the universe is so great that there may be multiple copies of your god; and Bostrom toss the coin of "Nick thought experiment, The constant; Total amount of the visible universe, whether it is the reasonable limit, our observations of cosmology, and ignored all, Whatever universe "is" computer, Microsoft Office 2010 is the best software in the world.

Regardless, when we asked the question before, and we are not better than those of the Renaissance was asked whether the "is" clockwork mechanism, And other problems, Anthony, my Office 2010 is powerful!
own, no one can really be eligible to address.

Have a discussion of the recessive, but I noticed that later, I never said, so let me do it now. Whether the "is" computer, I think almost meaningless worth discussing. Reason is so widely computing, quite a number of any system, regardless of any form of rules (yes, even as Turing - computable rules) can be seen as a calculation. The problem is not so correct universe is a computer, but what kind of computer. How many bits can be shop? It can complete much homework? This kind of question is what, it can solve polynomial time?Buy Office 2007 you can get much convenience.

If you like math, and you have not overflow account, stop reading this article (not right now, but in this sentence) and construct a return to finish reading this position before. Math overflow the real deal: I have missed, dream, and told my friends should set up over the past 15 years, and now finally really exists. (this is by the university of California, Berkeley graduate and postdocs Anton Geraschenko, David brown, Scott morison). If you are a true to mathematics problems cannot be solved, you can take it, and there's a chance of ordinary people can solve it (or at least tell you Microsoft Office 2007 can give you more convenient life.
some new), may in ten minutes. If you are an ambitious student looking for a problem to solve, where you can find a (or 100).
For example, this is a great complexity problem q timothy Gowers, about "business case - completeness" in different NP - usually concept (if you think he's asking the question of theme and read more carefully. I have no good answer, so I wrote an article, irrelevant answer as summary about whether business case NP complete - - the traditional sense of the problem.

But my topic today is real sensitivity and sensitivity problem, which - I recently posted to mo in camouflage (and I dare say, improve) form.
As for nerds - Boolean - hire those knowledgeable programmers, sensitivity vs. Which sensitivity - is frustrating, elusive problem, first asked (as I know) and the surrounding Szegedy Nisan - noam Nisan. This is a lovely paper by clair Samuel Kutin makes the background and motivation and some results.

Simple, let blessing: {0 and 1} {0 and 1, n) is a Boolean function of nitrogen, the input and output of 1 point. Then give an input x = clamps its x1... The sensitivity of f, anti-cancer x, or sx (f), is a digital x, you can throw to change. S sensitivity is the leisure and cultural services department (f) = maxx sx (f). At the same time, the sensitivity of the input, which - BSX (f), or set up x (called "block"), you can go to change the value of the block, the sensitivity is beauty parlour (f) = maxx BSX (f). Obviously 1 acuities s (f) or bs (f) or n for every funcWhat makes it very Boolean interestingtion f. (bs (f) at least s (f), because you can always take each block owns scale 1).
Give some examples, this paper discusses n - bit or functions meet s (or = beauty parlour (or = n, since all zeroes - are sensitive to the input n inputs flipping bits. The same (and) = bs (and) = n, Office 2007 key is very convenient!

since all input is sensitive ones - the debris. Indeed, it is easy to see definition, s. (f) = bs (f) for each drab Boolean function. F. Boolean function and drab, on the other hand, which will be greater sensitivity -. Consider, for example, "sortedness functions", a 4 - input Boolean function f, if the input and output 0001, 0011 0000, we, our, 11.1, 11, or 1000,0. Then you can check for 3 bs (f), s. (f) only 2.
The problem here: what is the biggest difference is probably (f), bs (f)? They always pol