fix more broken markdown links

Fixed stuff we broke by mistake, previously.

Ran `make www` to perform the above.

TODO: Fix stuff we broke by mistake doing the above.

TODO: Fix more broken markdown links.

2012/blakely/README.md

@@ -99,7 +99,8 @@ operation, then the results are undefined.
 For test-runs, use a resolution of 32. For simple expressions, the
 [GIF](https://en.wikipedia.org/wiki/GIF) generation should take only
 a few seconds with a modern processor and full optimization. Runtime scales as
-[O(N^3)](https://en.wikipedia.org/wiki/Big_O_notation) with resolution `N`,
+O^(N^3), (see [Big O notation](https://en.wikipedia.org/wiki/Big_O_notation) web page)
+with resolution `N`,
 and more complex expressions take longer to compute. For example, increasing the
 resolution of `ripple.gif`
 to 250 took ~35 minutes to render on an [i7

2012/blakely/index.html

@@ -453,7 +453,8 @@ operation, then the results are undefined.</p>
 <p>For test-runs, use a resolution of 32. For simple expressions, the
 <a href="https://en.wikipedia.org/wiki/GIF">GIF</a> generation should take only
 a few seconds with a modern processor and full optimization. Runtime scales as
-<a href="https://en.wikipedia.org/wiki/Big_O_notation">O(N^3)</a> with resolution <code>N</code>,
+O<sup>(N</sup>3), (see <a href="https://en.wikipedia.org/wiki/Big_O_notation">Big O notation</a> web page)
+with resolution <code>N</code>,
 and more complex expressions take longer to compute. For example, increasing the
 resolution of <code>ripple.gif</code>
 to 250 took ~35 minutes to render on an <a href="https://en.wikipedia.org/wiki/Intel_Core#Core_i7">i7

2012/endoh1/README.md

@@ -216,8 +216,8 @@ than 80 x 25.
 
 ```
 
-This program is a fluid simulator using the [Smoothed-particle hydrodynamics
-(SPH)](http://en.wikipedia.org/wiki/Smoothed-particle_hydrodynamics) method.
+This program is a fluid simulator using the SPH:
+[Smoothed-particle hydrodynamics](http://en.wikipedia.org/wiki/Smoothed-particle_hydrodynamics) method.
 
 The SPH particles represent the fluid flow.  Particles have information about
 the position, density, and velocity.  In every simulation step, they are

2012/endoh1/index.html

@@ -521,8 +521,8 @@ than 80 x 25.</p>
               `-&#39;`&#39;   `-&#39;`-&#39;  `-&#39;`-&#39;           `-&#39;`&#39;    `&#39;`&#39;  `&#39;`&#39; `&#39;`&#39;
 
 </code></pre>
-<p>This program is a fluid simulator using the <a href="http://en.wikipedia.org/wiki/Smoothed-particle_hydrodynamics">Smoothed-particle hydrodynamics
-(SPH)</a> method.</p>
+<p>This program is a fluid simulator using the SPH:
+<a href="http://en.wikipedia.org/wiki/Smoothed-particle_hydrodynamics">Smoothed-particle hydrodynamics</a> method.</p>
 <p>The SPH particles represent the fluid flow. Particles have information about
 the position, density, and velocity. In every simulation step, they are
 changed by pressure force, viscosity force, and external force (i.e., gravity).</p>

2012/endoh2/README.md

@@ -35,7 +35,7 @@ and:
 
 A
 [pi](https://en.wikipedia.org/wiki/Pi)/[e](https://en.wikipedia.org/wiki/E_(mathematical_constant))
-printing quasi-[quine](https://en.wikipedia.org/wiki/Quine_(computing) in [ASCII
+printing quasi-[quine](https://en.wikipedia.org/wiki/Quine_(computing)) in [ASCII
 art](https://en.wikipedia.org/wiki/ASCII_art) with a compressed font in it; what
 else to wish for in this program? [Virtual
 machine](https://en.wikipedia.org/wiki/Virtual_machine) emulation?

2012/endoh2/index.html

@@ -413,7 +413,7 @@ Location: <a href="../../location.html#JP">JP</a> - <em>Japan</em></li>
 <h2 id="judges-remarks">Judges’ remarks:</h2>
 <p>A
 <a href="https://en.wikipedia.org/wiki/Pi">pi</a>/<a href="https://en.wikipedia.org/wiki/E_(mathematical_constant)">e</a>
-printing quasi-[quine](https://en.wikipedia.org/wiki/Quine_(computing) in <a href="https://en.wikipedia.org/wiki/ASCII_art">ASCII
+printing quasi-<a href="https://en.wikipedia.org/wiki/Quine_(computing)">quine</a> in <a href="https://en.wikipedia.org/wiki/ASCII_art">ASCII
 art</a> with a compressed font in it; what
 else to wish for in this program? <a href="https://en.wikipedia.org/wiki/Virtual_machine">Virtual
 machine</a> emulation?</p>

2012/hou/README.md

@@ -132,7 +132,7 @@ As an extra tweak, the text message actually does something useful. Remove the
 
 [^1]: [Russ Cox, Regular Expression Matching: the Virtual Machine Approach](http://swtch.com/~rsc/regexp/regexp2.html)
 
-[^2]: [Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...)](http://swtch.com/~rsc/regexp/regexp1.html)
+[^2]: [Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...](http://swtch.com/~rsc/regexp/regexp1.html)
 
 
 <!--

2012/hou/hint.html

@@ -460,7 +460,7 @@ amount of spaghetti branches and virtual thread creations. Finally, the VM in
 “Make a contract with me” catch line and the program would cease to function.</p>
 <h3 id="references">References</h3>
 <p>[1] <a href="http://swtch.com/~rsc/regexp/regexp2.html">Russ Cox, Regular Expression Matching: the Virtual Machine Approach</a></p>
-<p>[2] <a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …)</a></p>
+<p>[2] <a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …</a></p>
 <hr style="width:10%;text-align:left;margin-left:0">
 <p>Jump to: <a href="#">top</a></p>
 <!--

2012/hou/hint.md

@@ -129,7 +129,7 @@ As an extra tweak, the text message actually does something useful. Remove the
 
 [1] [Russ Cox, Regular Expression Matching: the Virtual Machine Approach](http://swtch.com/~rsc/regexp/regexp2.html)
 
-[2] [Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...)](http://swtch.com/~rsc/regexp/regexp1.html)
+[2] [Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...](http://swtch.com/~rsc/regexp/regexp1.html)
 
 
 <hr style="width:10%;text-align:left;margin-left:0">

2012/hou/index.html

@@ -492,7 +492,7 @@ amount of spaghetti branches and virtual thread creations. Finally, the VM in
 <section id="footnotes" class="footnotes footnotes-end-of-document" role="doc-endnotes">
 <h5>Footnotes</h5>
 <ol>
-<li id="fn1"><p><a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …)</a><a href="#fnref1" class="footnote-back" role="doc-backlink">↩︎</a></p></li>
+<li id="fn1"><p><a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …</a><a href="#fnref1" class="footnote-back" role="doc-backlink">↩︎</a></p></li>
 <li id="fn2"><p><a href="http://swtch.com/~rsc/regexp/regexp2.html">Russ Cox, Regular Expression Matching: the Virtual Machine Approach</a><a href="#fnref2" class="footnote-back" role="doc-backlink">↩︎</a></p></li>
 <li id="fn3"><p><a href="http://swtch.com/~rsc/regexp/regexp2.html">Russ Cox, Regular Expression Matching: the Virtual Machine Approach</a><a href="#fnref3" class="footnote-back" role="doc-backlink">↩︎</a></p></li>
 </ol>

2012/tromp/README.md

@@ -51,8 +51,8 @@ are more obfuscated than the entry itself.
 ## Author's remarks:
 
 This program celebrates the close connection between obfuscation and conciseness,
-by implementing the most concise language known, [Binary Lambda Calculus
-(BLC)](https://tromp.github.io/cl/Binary_lambda_calculus.html).
+by implementing the most concise language known, BLC:
+[Binary Lambda Calculus](https://tromp.github.io/cl/Binary_lambda_calculus.html).
 
 [BLC](https://tromp.github.io/cl/Binary_lambda_calculus.html) was developed to
 make [Algorithmic Information

2012/tromp/index.html

@@ -418,8 +418,8 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
 are more obfuscated than the entry itself.</p>
 <h2 id="authors-remarks">Author’s remarks:</h2>
 <p>This program celebrates the close connection between obfuscation and conciseness,
-by implementing the most concise language known, <a href="https://tromp.github.io/cl/Binary_lambda_calculus.html">Binary Lambda Calculus
-(BLC)</a>.</p>
+by implementing the most concise language known, BLC:
+<a href="https://tromp.github.io/cl/Binary_lambda_calculus.html">Binary Lambda Calculus</a>.</p>
 <p><a href="https://tromp.github.io/cl/Binary_lambda_calculus.html">BLC</a> was developed to
 make <a href="https://en.wikipedia.org/wiki/Algorithmic_information_theory">Algorithmic Information
 Theory</a>, the