This is **big**.

â€śPersonally, Iâ€™m not a mathematician. I donâ€™t understand the original formulation of the Connes embedding conjecture well,â€ť said Natarajan.

I wish I could be smart enough to not understand it well.

Anyway, I thought it interesting this idea of computational complexity, which sounds like big O notation to me. I wonder if ID theorists have tried to determine the computational complexity of â€śirreducibly complexâ€ť structures.

You got it, *Big O* is a measure of computational time, and is used in the definition of Complexity Classes (P, NP, NPC, NP-Hard, etc.).

MIP* is a Complexity Class I didnâ€™t even know existed until today, and I just learned it was defined in 2003.

Iâ€™m going to stop thinking about Complexity Theory now before my brain explodes.

That explains my ignorance. I taught a lot of O-notation in my Analysis of Algorithms classes but that ended in â€¦ uhâ€¦ 1984. So Iâ€™d never heard of MIP.

Mind-blowing stuff.

Thatâ€™ll be because the Men In Pink wiped your mindâ€¦

That explains my ignorance. I taught a lot of O-notation in my Analysis of Algorithms classes but that ended in â€¦ uhâ€¦ 1984. So Iâ€™d never heard of MIP.

Thatâ€™s about the time I was first introduced to the topic too.

Mind-blowing stuff.

Ya!

Thatâ€™ll be because the Men In Pink wiped your mindâ€¦