This is absolutely beautiful stuff.

It went up and down, and it really started to accelerate around 70,000 years ago.

And one hell of a big pile of dollars.

I'll end up with saying one thing.

It's an incredible story.

Let me say a little bit about that now.

Now the recurrence relation has this form..

That they are Piles of stars stripped away by tidal interactions of galaxies in the cluster.

We have a graph with 1 node, it's going to have 0 edges, by the way that this generation process happens.

Alright, so next we're going to look at some recursively generated graphs.

But in the end, we did somewhere between say N and 2N, primitive operations to compute this first partial product.

We used to do it just with ice cores, but in this case, we're going back 20 million years.

So, let's start off with a really simple example. So, here is some pseudo Python for generating a graph with n nodes.

N plus 1's are there?

We now know how deep. It's log n.

So we know there's an ice shelf overhead.

And they said scaling, which is the build up of minerals inside of pipes.

We're looking at the same basic setup as the last time.

An empty formality a piece of parchment.

I wonder which of the following formula do you think best capture as what we we're doing the sum Xi, 1 Nsum Xi, the product of Xi or 1 Nthe product of Xi.

But gradually, as the buildings are repaired, we will see the accretion of a limestone reef beneath the city.

Then we are going to add to that what?

And let's say there's a bunch of terms like this.

And again, it's this incredibly exciting animal.

Here's why.

Otherwise, we do it recursively.

So is there any easy way to write that?

We start off with a set of n nodes, then we create a graph on half of the nodes recursively.

So, question for you.

Again, in the case for n 1, it's just a single node.

Now, you get a different chain network for each different possible number of nodes.

This is pretty remarkable, and you might find this to be quite counter intuitive.

Now, in this slide the white is chalk, and this chalk was deposited in a warm ocean.

Let's look right now at the analysis of the algorithm.

We have many initiatives that we're working on, but some of them are very basic.

You know, we saw this in the core samples as they came up.

So we generate a graph on n 2 nodes call that G1.

What do they tell us?

It's something like this

And it was deposited by the great mother Earth, some three million years ago.

But if you break a gourd, you cannot simply throw it away, because every stroke of that stick that has built up that calcium, the measure of a man's life, has a thought behind it.

There's two degrees, or three degrees of climate change baked into the system.

In general, we're going to have 1 print statement plus 2 print statements plus 3 print statements plus etc, etc, all the way up to n 1 print statements, which equals n( n 1) 2.

Now, selection is the same.

Well, an excavation was begun immediately, and more and more little bits of skull started to be extracted from the sediment.