-
+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.
-
+9 +1
How Nature Solves Problems Through Computation
The evolutionary biologist Jessica Flack seeks the computational rules that groups of organisms use to solve problems. By Joshua Sokol.
-
+23 +1
Being a woman in programming in the Soviet Union
By Vicki Boykis’ mom.
-
+24 +1
New material helps record data with light
Russian physicists with their colleagues from Europe have learned to generate quasiparticles—excitons, which were fully controllable and able to record information at room temperature. These particles act as a transitional form between photons and electrons, so the researchers believe they can be used to create compact optoelectronic devices for rapid recording and processing of optical signals.
-
+28 +1
Sex as an Algorithm: The Theory of Evolution Under the Lens of Computation
Looking at the mysteries of evolution from a computer science point of view yields some unexpected insights. By Adi Livnat, Christos Papadimitriou.
-
+21 +1
There’s a way to turn almost any object into a computer – and it could cause shockwaves in AI
Could reservoir computing be a future alternative to silicon chips? By Mark Douthwaite and Matt Dale.
-
+2 +1
Limits of Logic: The Gödel Legacy
Douglas Hofstadter
-
+18 +1
Probability, Paradox, and the Reasonable Person Principle
“We’ve seen how to manage probability paradoxes. Just be explicit about what the problem says, and then methodical about defining the sample space, and finally be careful in counting the number of outcomes in the numerator and denominator. Easy as 1-2-3. But the bigger lesson is: treat those around you as reasonable people, and when they have different opinions, try to discover what problem they are solving.” By Peter Norvig.
Submit a link
Start a discussion