web counter

Alan Turing On Computable Numbers


Alan Turing On Computable Numbers

So, I was at this retro gaming expo the other day, right? I mean, who doesn't love a bit of nostalgia with their pixels? Anyway, I stumbled upon this guy dressed as a '50s scientist, complete with the lab coat and the Einstein hair. He was standing by a old-style computer, and I thought, "Well, that's a bit extra, even for a con." Turns out, he was cosplaying as Alan Turing, the guy who basically invented computers as we know them. Now, I know what you're thinking, "But I thought Steve Jobs invented computers?" Well, let me take you on a little journey back in time, to when computers were the size of a room and had more vacuum tubes than a dentist's office.

Meet Alan, the Original Codebreaker

Imagine it's 1936, and you're a brilliant mathematician named Alan Turing. You're sitting in your office at the University of Cambridge, trying to make sense of a problem that's been bugging you for ages. It's about deciding whether a given mathematical statement is true or false. Sounds simple enough, right? Well, not quite. You realize that this problem is actually a lot more complex than it seems, and it's got you thinking about something else - can we create a machine that can solve any problem, given enough time?

Now, I know what you're thinking, "Isn't that what computers do now?" Well, yes and no. You see, Alan wasn't talking about the kind of computers we have today. He was thinking of a more abstract machine, something he called a universal machine. A machine that could do anything, given the right instructions. And that, my friends, is where the concept of computable numbers comes in.

What's a Computable Number, Anyway?

Alright, so you're probably wondering, "What on earth is a computable number?" Well, it's basically any number that can be calculated by a finite number of steps. Now, this might sound like every number out there, but it's not. You see, there are numbers that are just plain impossible to compute. Like, for example, the Chaitin's constant. It's a number that's defined by an infinite loop, which means it's literally impossible to compute.

But back to Alan. He was the first to prove that there are indeed numbers that are uncomputable. And not only that, but he also showed that there's no way to tell if a given number is computable or not. It's like trying to figure out if a particular star in the universe is habitable - you can't just look at it and know for sure. You need to do some serious investigating.

On Computable Numbers (Famous Publication) - On This Day
On Computable Numbers (Famous Publication) - On This Day

Turing Machines and the Birth of Computing

Now, here's where things get really interesting. Alan decided to create a theoretical model of a machine that could compute these computable numbers. He called it the Turing machine. It's basically a tape divided into cells, with a head that can read and write symbols, and move left or right. It's as simple as it gets, but it's also incredibly powerful.

You see, a Turing machine can simulate any algorithm, given enough time and space. It's like the ultimate Swiss Army knife of computing. And this, my friends, is where the concept of a universal machine comes in. A machine that can simulate any other machine, given the right instructions. And that's essentially what a computer is - a universal machine.

#OnThisDay May 28, 1936, Alan Turing submitted his paper “On Computable
#OnThisDay May 28, 1936, Alan Turing submitted his paper “On Computable

So, the next time you're playing Minecraft or checking your emails, remember that you're using a machine that's based on a concept that was first thought of by a brilliant mathematician, over 80 years ago. And that, my friends, is pretty darn amazing.

Now, if you'll excuse me, I've got some retro gaming to get back to. Until next time, keep exploring!

You may also like