<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="forest.xsl"?>
<tree expanded="true" show-heading="true" show-metadata="true" toc="false" root="true"><frontmatter> <anchor>179</anchor> <rss>index.rss.xml</rss>  <addr>trail-0000</addr>  <route>index.xml</route> <date><year>2023</year> <month>8</month> <day>5</day></date> <authors><author><link href="masanoriogino.xml" type="local">Masanori Ogino</link></author> </authors> <title>Trail of Thought</title> </frontmatter> <mainmatter><p>You may think it must be <em>train of thought,</em> and you are correct, but
I feel I am lost in the flood of information and wandering aimlessly every day.
So, there are trails. They are forked, tangled, (un-)related, threads of ideas.
I had already lost many of them, so I decided to record the remaining ones.</p><p>After months of conception and few days of prototyping, <link href="quote-0001.xml" type="local" title="It worked">it worked</link> so far.</p><p>Let random ideas not garbage-collected. Even one gigabyte of storage is too
much for plain text written by a mere mortal, and it is surprisingly cheap in
2023. You can record every key stroke in your whole life using a microSD card
nowadays. Let them not garbage-collected.</p>    <tree expanded="true" show-heading="true" show-metadata="false" toc="true" root="false"><frontmatter> <anchor>180</anchor> <rss>trail-0001.rss.xml</rss>  <addr>trail-0001</addr>  <route>trail-0001.xml</route>  <authors><author><link href="masanoriogino.xml" type="local">Masanori Ogino</link></author> </authors> <title>About this website</title> <meta name="author">false</meta></frontmatter> <mainmatter><p>This website is a <link href="trail-0002.xml" type="local" title="Collection of ever-maintained notes">collection of ever-maintained notes</link>.
Unless otherwise noted, notes in this website are maintained
by <link href="masanoriogino.xml" type="local" title="Masanori Ogino">Masanori Ogino</link>.</p><p>This website is powered by <link href="https://sr.ht/~jonsterling/forester" type="external">Forester</link>.
The text is typeset with <link href="https://www.omnibus-type.com/fonts/manuale/" type="external">Manuale</link>, 
<link href="https://www.omnibus-type.com/fonts/saira/" type="external">Saira</link>, 
<link href="https://www.morisawa.co.jp/products/fonts/bizplus/lineup/" type="external">BIZ UD Mincho and BIZ UD Gothic</link> 
if supported by the browser.</p></mainmatter> </tree></mainmatter> <backmatter><contributions/> <context/> <related><tree expanded="false" show-heading="true" show-metadata="true" toc="false" root="false"><frontmatter> <anchor>181</anchor> <rss>quote-0001.rss.xml</rss> <taxon>Quote</taxon> <addr>quote-0001</addr>  <route>quote-0001.xml</route>  <authors><author><link href="matthiasfelleisen.xml" type="local">Matthias Felleisen</link></author> </authors> <title>Shortest Lie in Computing</title> </frontmatter> <mainmatter><blockquote><p>Q: What is the shortest lie in computing?</p><p>A: It works.</p></blockquote><p>Source: <link href="https://felleisen.org/matthias/" type="external">Matthias Felleisen</link></p></mainmatter> </tree></related> <backlinks/> <references/></backmatter></tree>