Michael Levin

Is a frog-a-lottle gonna have legs, right?

Can you predict that from understanding the physics of transcription and all of that?

Anyway, so we made some, so you see this is like an intersection of biology, physics, cognition.

So we made chimeric algorithms.

And we said, okay, half the digits randomly, we assign them randomly.

So half the digits are randomly doing bubble sort, half the digits are randomly doing, I don't know, selection sort or something.

It's sticking.

We haven't done the thing where they can swap between, no, but they're sticking to it, right?

You label them and they're sticking to it.

The first thing we learned is that

The first thing we learned is that distributed sorting still works.

It's amazing.

You don't need a central planner when every number is doing its whole thing, still gets sorted.

That's cool.

The second thing we found is that when you make a chimeric algorithm where actually the algorithms are not even matching, that works too.

The thing still gets sorted.

That's cool.

But the most amazing thing is when we looked at something that had nothing to do with sorting, and that is we asked the following question.

We defined, Adam Goldstein actually named this property, and I think it's well-named.

We define the algotype of a single cell.