Logic hacking - "Writing shorter and shorter computer programs for which it's unknowable whether these programs run forever, or stop... the winner of the Busy Beaver Game for N-state Turing machines becomes unknowable using ordinary math - somewhere between N = 5 and N = 1919." [more inside]
Norbert Wiener: The Eccentric Genius Whose Time May Have Finally Come (Again) - "The most direct reason for Wiener's fall to relative obscurity was the breakthrough of a young mathematician and engineer named Claude Shannon." [more inside]
Arthur C. Clarke, Benoit Mandelbrot, Stephen Hawking, David Gilmour and many more trip the fuck out about Fractals, the Colors of Infinity.
Network Theory Overview - "The idea: nature and the world of human technology are full of networks! People like to draw diagrams of networks. Mathematical physicists know that in principle these diagrams can be understood using category theory. But why should physicists have all the fun? This is the century of understanding living systems and adapting to life on a finite planet. Math isn't the main thing we need, but it's got to be part of the solution... so one thing we should do is develop a unified and powerful theory of networks." (via ;)
Open warfare erupts in the world of mathematical biology, as Lior Pachter of UC-Berkeley writes three blog posts attacking two papers in Nature Bioscience, accusing one of them of being "dishonest and fraudulent": The Network Nonsense of Albert-Laszlo Barabasi, The Network Nonsense of Manolo Kellis, and Why I Read the Network Nonsense Papers. Kellis (MIT) and his co-authors respond (.pdf.)
Closing in on the twin prime conjecture (Quanta) - "Just months after Zhang announced his result, Maynard has presented an independent proof that pushes the gap down to 600. A new Polymath project is in the planning stages, to try to combine the collaboration's techniques with Maynard's approach to push this bound even lower." [more inside]
The Nature of Computation - Intellects Vast and Warm and Sympathetic: "I hand you a network or graph, and ask whether there is a path through the network that crosses each edge exactly once, returning to its starting point. (That is, I ask whether there is a 'Eulerian' cycle.) Then I hand you another network, and ask whether there is a path which visits each node exactly once. (That is, I ask whether there is a 'Hamiltonian' cycle.) How hard is it to answer me?" (via) [more inside]
Morton and Vicary on the Categorified Heisenberg Algebra - "In quantum mechanics, position times momentum does not equal momentum times position! This sounds weird, but it's connected to a very simple fact. Suppose you have a box with some balls in it, and you have the magical ability to create and annihilate balls. Then there's one more way to create a ball and then annihilate one, than to annihilate one and then create one. Huh? Yes: if there are, say, 3 balls in the box to start with, there are 4 balls you can choose to annihilate after you've created one but only 3 before you create one..." [more inside]
A talk with Benoît Mandelbrot, entitled Fractals in Science, Engineering and Finance (Roughness and Beauty) [video, 80mins, realplayer] about fractals as A Theory of Roughness.