Check-in Day 4

May 24, 2017


A question that’s been on my mind is whether thinking algorithmically in group was hard because not many people in academia have both a group theory and algorithms background and are working at the intersection of the two, or it’s also intrinsically hard to design group algorithms.

If it’s the a background problem, then in this instance it could be relieved by formulating the question differently.

By giving the question in terms of collapsing gems of different colors (more on this later as a blog post) to talented CS people, I realized that something as fundamental as freely reducing in linear time requires a non-trivial amount of thought.

Question answered!


Check-in Day 4 - May 24, 2017 - Hang Lu Su