A connection between descriptive set theory and computer science has been discovered, allowing problems in one field to be rewritten and solved in the other by Anton Bernshteyn.
Problems in descriptive set theory (measuring infinite graph colorings) are mathematically equivalent to problems in distributed algorithms (efficient network coloring).
Problems in descriptive set theory (measuring infinite graph colorings) are mathematically equivalent to problems in distributed algorithms (efficient network coloring).
A new paper by SFI Professor David Wolpert introduces a mathematically precise framework for the simulation hypothesis, challenging several long-standing claims and opening up new questions about simulated universes.
Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms.
