Migrate to Hugo.

This is a big and somewhat complicated decision, but the crux of it is this:

The _mkdocs_ tool embeds a ton of "I am writing a manual" assumptions about document structure.

These assumptions include that there is a single, sitewide TOC, that a top nav bar is broadly an appropriate way to skip around in the document, and numerous others. They serve that use case well, but that's not really what this site _is_, or how I intend it to be approached. I'm trying for something more blog-esque (and deliberately a bit haphazard).

Hugo is an experiment. This commit migrates most pages to it, but it does drop a few; this is a convenient excuse to forget items I'd prefer not to continue publishing.

1 files changed, 42 insertions, 0 deletions

diff --git a/content/papers/index.md b/content/papers/index.md
new file mode 100644
index 0000000..0dd962f
--- /dev/null
+++ b/content/papers/index.md
@@ -0,0 +1,42 @@
+---
+title: Papers of Note
+date: 2023-11-01T01:02:40-0400
+---
+
+Computer science and development-adjacent papers and academic works I encourage people to read.
+
+<!--more-->
+
+* Perlman, Radia (1985). “[An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN][1]”. ACM SIGCOMM Computer Communication Review. 15 (4): 44–53. doi:10.1145/318951.319004.
+
+* [The related Algorhyme][2], also by Perlman.
+
+* Richard Barbrook, Andy Cameron. "[The Californian Ideology][11]" (1995). An important read to understand how the current internet came to be what it is, and about the beliefs of the people who made it that way.
+
+* Guy Lewis Steele, Jr.. “[Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO][3]”. MIT AI Lab. AI Lab Memo AIM-443. October 1977.
+
+* [What Every Computer Scientist Should Know About Floating-Point Arithmetic][4], by David Goldberg, published in the March, 1991 issue of Computing Surveys. Copyright 1991, Association for Computing Machinery, Inc.
+
+* [RFC 1925][5].
+
+* [Regular Expression Matching Can Be Simple And Fast][10], Russ Cox's empirical research into degenerate cases in common regular expression implementations and a proposed implementation based on Thomson's NFA construction.
+
+* [The above-cited Thomson NFA paper][6] on regular expressions.
+
+* [The Eight Fallacies of Distributed Computing][7].
+
+* [HAKMEM][8] is another good one. It's _dense_ but rewarding.
+
+* Kahan, William (January 1965), “[Further remarks on reducing truncation errors][9]”, Communications of the ACM, 8 (1): 40, doi:10.1145/363707.363723
+
+[1]: https://www.researchgate.net/publication/238778689_An_Algorithm_for_Distributed_computation_of_a_Spanning_Tree_in_an_Extended_LAN
+[2]: http://etherealmind.com/algorhyme-radia-perlman/
+[3]: https://dspace.mit.edu/bitstream/handle/1721.1/5753/AIM-443.pdf
+[4]: https://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html
+[5]: https://www.ietf.org/rfc/rfc1925.txt
+[6]: https://www.fing.edu.uy/inco/cursos/intropln/material/p419-thompson.pdf
+[7]: http://wiki.c2.com/?EightFallaciesOfDistributedComputing
+[8]: http://w3.pppl.gov/~hammett/work/2009/AIM-239-ocr.pdf
+[9]: https://dl.acm.org/citation.cfm?id=363723
+[10]: https://swtch.com/~rsc/regexp/regexp1.html
+[11]: https://www.alamut.com/subj/ideologies/pessimism/califIdeo_I.html