evaluate(2B || !2B)
Hamlet’s famous question, “To be or not to be?” is just one example of a question with a yes/no answer. It’s different from a question such as, “What’s your favorite color?” or, “How was your day?” What it boils down to is that the young Prince’s question requires only one bit to answer, and that bit is either yea or nay.
Computers can be very good at answering yes/no questions. We can write a computer program to compare two numbers and tell us — yea or nay — if the first one is bigger than the second one. Computers are also very good at calculations (they’re just big calculators, after all). For example, we can write a computer program that divides one number by another.
But there are questions computers can’t answer, and calculations they can’t make.
Be warned: these next Sideband posts are about Mathematics! Worse, they’re about the Theory of Mathematics!! But consider sticking around, at least for this one. It fulfills a promise I made in the Infinity is Funny post about how Georg Cantor proved there are (at least) two kinds of infinity: countable and uncountable. It also connects with the Smooth or Bumpy post, which considered differences between the discrete and the continuous.
This first one is pretty easy. The actual math involved is trivial, and I think it’s fascinating how the Yin/Yang of separate units versus a smooth continuum seems a fundamental aspect of reality. We can look around to see many places characterized by “bumpy” or “smooth” (including Star Trek). (The division lies at the heart of the conflict between Einstein’s Relativity and quantum physics.)
So let’s consider Cantor.