-
+3 +1
Dijkstra's in Disguise
A weighted graph is a data structure consisting of some vertices and edges, and each edge has an associated cost of traversal. Let's suppose we want to compute the shortest distance from vertex u to every other vertex v in the graph... By Eric Jang.
-
+13 +1
What Does Compactness Really Mean?
It took me a long time to understand the mysterious mathematical property of compactness. By Evelyn Lamb.
-
+27 +1
The Physicist Who Sees Crime Networks
A lone Japanese scientist is discovering the shady ties that connect companies engaged in illegal trade. By Mark Harris.
-
+5 +1
“Let us Calculate!”: Leibniz, Llull, and the Computational Imagination
Three hundred years after the death of Gottfried Wilhelm Leibniz and seven hundred years after the birth of Ramon Llull, Jonathan Gray looks at how their early visions of computation and the “combinatorial art” speak to our own age of data, algorithms, and artificial intelligence.
-
+14 +1
Two-hundred-terabyte maths proof is largest ever
A computer cracks the Boolean Pythagorean triples problem — but is it really maths? By Michael Greshko. (May 26, ’16)
-
+25 +1
Researchers find the tipping point between resilience and collapse in complex systems
Honeybees have been dying in record numbers, threatening the continued production of nutritious foods such as apples, nuts, blueberries, broccoli, and onions. Without bees to pollinate these crops, the environmental ecosystem—and our health—stands in the balance. Have we reached the tipping point, where the plant-pollinator system is due to collapse?
-
+22 +1
Landmark Algorithm Breaks 30-Year Impasse
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. By Erica Klarreich. (Dec. 14)
-
+22 +1
Theorists Draw Closer to Perfect Coloring
A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. By Natalie Wolchover.
Submit a link
Start a discussion