# Tag Archives: Alan Turing

## Structure vs Function

As a result of lurking on various online discussions, I’ve been thinking about computationalism in the context of structure versus function. It’s another way to frame the Yin-Yang tension between a simulation of a system’s functionality and that system’s physical structure.

In the end, I think it does boil down the two opposing propositions I discussed in my Real vs Simulated post: [1] An arbitrarily precise numerical simulation of a system’s function; [2] Simulated X isn’t Y.

It all depends on exactly what consciousness is. What can structure provide that could not be functionally simulated?

## BB #64: Systems Bubble

For the last two weeks I’ve written a number of posts contrasting physical systems with numeric systems.

(The latter are, of course, also physical, but see many previous posts for details on significant differences. Essentially, the latter involve largely arbitrary maps between real world magnitude values and internal numeric representations of those values.)

I’ve focused on the nature of causality in those two kinds of systems, but part of the program is about clearly distinguishing the two in response to views that conflate them.

## The Imitation Game

I finally watched The Imitation Game last night. I have a great deal of regard for Alan Turing, and I’ve always enjoyed codes and cryptography (the story of breaking the Enigma machine is especially fascinating), so I was really looking forward to finally seeing it.

And… I didn’t like it. A lot. Turns out it reflects everything I see as wrong with movies — and with society — in these social media-driven, over-amped, uncritical modern era days.

Watching the movie to get away from politics, it dragged me right back for having the same lack of authenticity, made up conflict, and disregard for history.

## Turing’s Machine

No, sorry, I don’t mean the Bletchey Bombe machine that cracked the Enigma cipher. I mean his theoretical machine; the one I’ve been referring to repeatedly the past few weeks. (It wasn’t mentioned at the time, but it’s the secret star of the Halt! (or not) post.)

The Turing Machine (TM) is one of our fundamental definitions of calculation. The Church-Turing thesis says that all algorithms have a TM that implements them. On this view, any two actual programs implementing the same algorithm do the same thing.

Essentially, a Turing Machine is an algorithm!

## Secret Code

When I was a high school kid, my dad and I sometimes played a game where one of us would make up a secret code, write a message in that code, and the other would try to decipher the message. We generally used simple substitution ciphers, so it was an exercise in letter frequency analysis and word guessing.

There’s a cute secret code I found in a book back then that really stuck with me because of the neat way it looks. It also stuck with me because it’s so simple that once you learn it, you really can’t forget it.

So for some Saturday fun, I thought I’d share it with you.

## Coded Math

Is that you, HAL?

Last time, in Calculated Math, I described how information — data — can have special characteristics that allow it to be interpreted as code, as instructions in some special language known to some “engine” that executes — runs — the code.

In some cases the code language has characteristics that make it Turing Complete (TC). One cornerstone of computer science is the Church-Turing thesis, which says that all TC languages are equivalent. What one can do, so can all the others.

That is where we pick up this time…

## Calculated Math

The previous post, Halt! (or not), described the Turing Halting Problem, a fundamental limit on what computers can do, on what can be calculated by a program. Kurt Gödel showed that a very similar limit exists for any (sufficiently powerful) mathematical system.

This raises some obvious questions: What is calculation, exactly? What do we mean when we talk about a program or algorithm? (And how does all of this connect with the world of mathematics?)

Today we’re going to start exploring that.

## Sideband #58: Halt! (or not)

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.