A New Bridge Links the Strange Math of Infinity to Computer Science

City: The study of computer science often asks how many steps algorithms need. For example, when solving the router problem, using just two colors can be slow. However, if you use three colors, there might be a much faster solution.

At a recent talk, Bernshteyn learned about different thresholds for solving problems. One threshold sounded a lot like a rule in descriptive set theory, which deals with coloring certain infinite graphs in specific ways. To him, this felt like more than a simple coincidence.

He thought that computer scientists and librarians share a similar approach. Just like librarians arrange books on shelves based on topics, computer scientists group problems depending on how well their algorithms work. The two fields may even be more related than they first seem.

Bernshteyn wanted to show this connection clearly. He aimed to demonstrate that every good local algorithm could be linked to a Lebesgue-measurable way of coloring an infinite graph with special properties. This means that some important ideas in computer science are similar to important ideas in set theory.

He focused on network problems where each algorithm looks at nearby nodes. To work well, every algorithm just labels nodes in a neighborhood with different numbers. This helps them keep track of nearby nodes and gives instructions about them. In a simple graph, this is easy—each node can get its own number.