Tag Archives: discrete mathematics

Sideband #58: Halt! (or not)

Hamlet 2B or Not 2B

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.

Continue reading


Beautiful Math

Take a moment to gaze at Euler’s Identity:

Eulers Identity

It has been called “exquisite” and likened to a “Shakespearean sonnet.” It has earned the titles “the most famous” and “the most beautiful” formula in all of mathematics, and, in a mere seven symbols, symbolizes much of its foundation.

Today we’re going to graze on it!

Continue reading