Pc scientists wish to know what number of steps a given algorithm requires. For instance, any native algorithm that may remedy the router downside with solely two colours should be extremely inefficient, however it’s potential to discover a very environment friendly native algorithm should you’re allowed to make use of three.
On the discuss Bernshteyn was attending, the speaker mentioned these thresholds for various sorts of issues. One of many thresholds, he realized, sounded so much like a threshold that existed on this planet of descriptive set concept—concerning the variety of colours required to paint sure infinite graphs in a measurable method.
To Bernshteyn, it felt like greater than a coincidence. It wasn’t simply that pc scientists are like librarians too, shelving issues based mostly on how effectively their algorithms work. It wasn’t simply that these issues is also written by way of graphs and colorings.
Maybe, he thought, the 2 bookshelves had extra in widespread than that. Maybe the connection between these two fields went a lot, a lot deeper.
Maybe all of the books, and their cabinets, had been equivalent, simply written in several languages—and in want of a translator.
Opening the Door
Bernshteyn got down to make this connection specific. He needed to indicate that each environment friendly native algorithm might be changed into a Lebesgue-measurable method of coloring an infinite graph (that satisfies some further essential properties). That’s, considered one of pc science’s most essential cabinets is equal to considered one of set concept’s most essential cabinets (excessive up within the hierarchy).
He started with the category of community issues from the pc science lecture, specializing in their overarching rule—that any given node’s algorithm makes use of details about simply its native neighborhood, whether or not the graph has a thousand nodes or a billion.
To run correctly, all of the algorithm has to do is label every node in a given neighborhood with a novel quantity, in order that it could possibly log details about close by nodes and provides directions about them. That’s straightforward sufficient to do in a finite graph: Simply give each node within the graph a distinct quantity.
