<blockquote>
  <p><sup>The algorithm designer who does not run experiments risks becoming lost in abstraction. <em>—Sedgewick</em></sup></p>
</blockquote>

<ul>
<li><a href="http://chat.stackexchange.com/rooms/9446/theory-salon">cstheory salon</a> &amp; <a href="http://chat.stackexchange.com/rooms/2710/computer-science">cs chat</a> / <a href="https://vzn1.wordpress.com/chat/" rel="nofollow">highlights</a></li>
<li><a href="http://vzn1.wordpress.com/2012/12/08/outline-for-a-np-vsppoly-proof-based-on-monotone-circuits-hypergraphs-and-factoring/" rel="nofollow">outline for a NP vs P/poly proof based on monotone circuits, hypergraphs, factoring, and slice functions</a></li>
<li><a href="http://vzn1.wordpress.com/code/collatz-conjecture-experiments/" rel="nofollow">Collatz conjecture experiments</a></li>
<li><a href="http://vzn1.wordpress.com/code/turing-machine-compiler/" rel="nofollow">Turing machine compiler in ruby</a></li>
<li><a href="http://vzn1.wordpress.com/volunteer/" rel="nofollow">volunteer/collaborate in open science</a></li>
</ul>

vzn