<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Patrick Stevens</title><link>/</link><description>Recent content on Patrick Stevens</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Sat, 18 Apr 2026 09:41:00 +0100</lastBuildDate><atom:link href="/index.xml" rel="self" type="application/rss+xml"/><item><title>Claude knows who you are</title><link>/posts/2026-04-18-claude-knows-you/</link><pubDate>Sat, 18 Apr 2026 09:41:00 +0100</pubDate><guid>/posts/2026-04-18-claude-knows-you/</guid><description>Claude Opus 4.7 is solidly superhuman at stylometric identification of authors.</description></item><item><title>Another trip to Tromsø</title><link>/posts/2026-04-05-northern-lights-redux/</link><pubDate>Sun, 05 Apr 2026 11:42:00 +0000</pubDate><guid>/posts/2026-04-05-northern-lights-redux/</guid><description>Travelogue of another trip to Norway.</description></item><item><title>Fun LLM prompt: where are my mental models defective?</title><link>/posts/2026-03-02-mental-model-failures/</link><pubDate>Mon, 02 Mar 2026 22:05:00 +0000</pubDate><guid>/posts/2026-03-02-mental-model-failures/</guid><description>A fun prompt to use with a powerful LLM, to learn about something in great detail.</description></item><item><title>LLM arithmetic</title><link>/posts/2025-12-13-llm-arithmetic/</link><pubDate>Sat, 13 Dec 2025 09:41:00 +0000</pubDate><guid>/posts/2025-12-13-llm-arithmetic/</guid><description>I keep seeing people going on about the 3.9 - 3.11 = 0.79 thing, but we already know why they do that and how to avoid it!</description></item><item><title>Robocop: automated code review</title><link>/posts/2025-11-10-robocop/</link><pubDate>Mon, 10 Nov 2025 17:25:00 +0000</pubDate><guid>/posts/2025-11-10-robocop/</guid><description>I wrote a basic LLM-based code review tool that&amp;rsquo;s distressingly effective.</description></item><item><title>LLMs sanding off the edges</title><link>/posts/2025-10-06-llm-concerns/</link><pubDate>Mon, 06 Oct 2025 22:59:00 +0100</pubDate><guid>/posts/2025-10-06-llm-concerns/</guid><description>I&amp;rsquo;m a bit concerned about a failure mode that is increasingly arising with LLMs: the divorce between how something looks, and its quality.</description></item><item><title>Boolean blindness</title><link>/posts/2025-08-29-boolean-blindness/</link><pubDate>Fri, 29 Aug 2025 10:23:00 +0100</pubDate><guid>/posts/2025-08-29-boolean-blindness/</guid><description>Why booleans are an advanced technique that should be used with care.</description></item><item><title>Some Python surprises</title><link>/posts/2025-06-21-python-pitfalls/</link><pubDate>Sat, 21 Jun 2025 00:00:00 +0100</pubDate><guid>/posts/2025-06-21-python-pitfalls/</guid><description>I am forever astonished that people describe Python as a simple language. Here are some of the things I found very surprising about it.</description></item><item><title>Things I've learned about the .NET runtime</title><link>/posts/2025-06-20-dotnet-runtime-learnings/</link><pubDate>Fri, 20 Jun 2025 00:00:00 +0100</pubDate><guid>/posts/2025-06-20-dotnet-runtime-learnings/</guid><description>While writing an MSIL interpreter, I discovered a bunch of unexpected things about the .NET runtime.</description></item><item><title>Announcing WoofWare.Expect</title><link>/posts/2025-06-17-woofware-expect/</link><pubDate>Tue, 17 Jun 2025 00:00:00 +0100</pubDate><guid>/posts/2025-06-17-woofware-expect/</guid><description>A basic but functional expect-testing framework for F#.</description></item><item><title>LLM effect on my programming (2025 edition)</title><link>/posts/2025-06-16-llms-redux/</link><pubDate>Mon, 16 Jun 2025 09:28:00 +0100</pubDate><guid>/posts/2025-06-16-llms-redux/</guid><description>Since my last post about this in 2024-03, LLMs have become a distinctly positive addition to my ability.</description></item><item><title>A Bitcoin analogy for Multiple Drafts theory of consciousness</title><link>/posts/2025-03-08-consciousness/</link><pubDate>Sat, 08 Mar 2025 13:30:00 +0000</pubDate><guid>/posts/2025-03-08-consciousness/</guid><description>I&amp;rsquo;ve never actually seen anyone write down precisely the way I think about consciousness, so here it is: it&amp;rsquo;s (gasp!) like a blockchain.</description></item><item><title>NativeAOT in .NET 9 and Nixpkgs/darwin</title><link>/posts/2024-11-28-net9-aot/</link><pubDate>Thu, 28 Nov 2024 20:10:00 +0000</pubDate><guid>/posts/2024-11-28-net9-aot/</guid><description>How to get a NativeAOT build using nixpkgs</description></item><item><title>Mary's Room</title><link>/posts/2024-10-25-marys-room/</link><pubDate>Fri, 25 Oct 2024 23:30:00 +0100</pubDate><guid>/posts/2024-10-25-marys-room/</guid><description>Last weekend I was in a discussion ostensibly about whether the mind is nonphysical. Much of the discussion ended up as a rather polite shouting match about Mary&amp;rsquo;s Room. Here is what I actually believe about it.</description></item><item><title>My reading list</title><link>/reading-list/</link><pubDate>Fri, 27 Sep 2024 19:31:58 +0100</pubDate><guid>/reading-list/</guid><description>&lt;p&gt;For a film list, see &lt;a href="/films"&gt;films&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;This page holds a list of the books I am reading, and a list of books I have read (starting from the 8th July 2013, which is when the list started). I start with high hopes of keeping the list updated in real time, but of course this plan may go off the rails. There is also a list of things I very strongly recommend reading - they changed my thought patterns extensively, and/or are amazing books.&lt;/p&gt;</description></item><item><title>Unhinged rant about software</title><link>/posts/2024-09-27-software-rant/</link><pubDate>Fri, 27 Sep 2024 18:14:00 +0100</pubDate><guid>/posts/2024-09-27-software-rant/</guid><description>Modern software practices and their sadness.</description></item><item><title>Lessons from a massage course</title><link>/posts/2024-09-07-massage/</link><pubDate>Sat, 07 Sep 2024 11:47:00 +0100</pubDate><guid>/posts/2024-09-07-massage/</guid><description>I went to a one-day intro to massage taster course, and it was fun and interesting!</description></item><item><title>WoofWare.Myriad.Plugins learns to parse args</title><link>/posts/2024-08-26-woofware-arg-parser/</link><pubDate>Mon, 26 Aug 2024 12:26:00 +0100</pubDate><guid>/posts/2024-08-26-woofware-arg-parser/</guid><description>My F# source generators have some new features, including an argument parser.</description></item><item><title>New GitHub workflows</title><link>/posts/2024-08-15-github-workflows/</link><pubDate>Thu, 15 Aug 2024 17:51:00 +0100</pubDate><guid>/posts/2024-08-15-github-workflows/</guid><description>I&amp;rsquo;ve made a GitHub workflow to assert that all required GitHub checks are complete, and one to publish and attest NuGet packages.</description></item><item><title>Learning plan for "Program Equilibrium in the Prisoner's Dilemma"</title><link>/posts/2024-07-25-lob-theorem/</link><pubDate>Thu, 25 Jul 2024 19:48:00 +0100</pubDate><guid>/posts/2024-07-25-lob-theorem/</guid><description>The questions whose answers I don&amp;rsquo;t know, and the things I intend to learn, on the way to understanding a paper.</description></item><item><title>Code having "the right philosophy"</title><link>/posts/2024-07-24-philosophy-of-code/</link><pubDate>Wed, 24 Jul 2024 17:38:00 +0100</pubDate><guid>/posts/2024-07-24-philosophy-of-code/</guid><description>Those who would give up essential safety, to purchase a little temporary simplicity, deserve (and will get) neither safety nor simplicity.</description></item><item><title>The phrase "I Notice That I Am Confused"</title><link>/posts/2024-05-01-i-notice-that-i-am-confused/</link><pubDate>Wed, 01 May 2024 11:38:00 +0100</pubDate><guid>/posts/2024-05-01-i-notice-that-i-am-confused/</guid><description>To me it&amp;rsquo;s got a specific meaning, but I&amp;rsquo;ve seen it used much more generally, and I think its meaning should not be polluted.</description></item><item><title>Games</title><link>/games/</link><pubDate>Sun, 28 Apr 2024 20:51:00 +0100</pubDate><guid>/games/</guid><description>&lt;p&gt;This page holds an incomplete list of games I have played.&lt;/p&gt;
&lt;h1 id="video-games"&gt;Video games&lt;/h1&gt;
&lt;h2 id="in-progress"&gt;In progress&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;ibb and obb. Fun two-player co-op, neat and slightly mind-bending physics.&lt;/li&gt;
&lt;li&gt;It Takes Two. Amusing but not worth the price, I think. This is more like a constant stream of &amp;ldquo;oh, what funny one-off mechanic have they implemented next&amp;rdquo;.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="not-in-progress"&gt;Not in progress&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Chants of Sennaar. An extremely impressive 81% of players have the Steam achievement for leaving the first game area, which I think tells you how gripping this game is. It&amp;rsquo;s basically a particular kind of IQ test, but it&amp;rsquo;s really fun. Reminiscent of &lt;em&gt;Return of the Obra Dinn&lt;/em&gt;. I could have done with a little more variation in the languages; there are a few neat bits, but there was a broad language design space they mostly didn&amp;rsquo;t touch.&lt;/li&gt;
&lt;li&gt;Baldur&amp;rsquo;s Gate 3 (hundreds of hours). Glorious game, aesthetically beautiful, absolutely gigantic amount of content, and sometimes succeeds at making you empathise with the characters. Having played this, I wouldn&amp;rsquo;t really want to go back to playing a DnD-style RPG any other way: all the bookkeeping happens in the background.&lt;/li&gt;
&lt;li&gt;Factorio, and Dyson Sphere Program (both hundreds of hours). Grouped together because they are basically the same game. I have banned myself from playing this genre of game (I gave myself RSI from it for a while). Between the two, DSP is much prettier and somewhat more forgiving, but also it has the annoying mechanic of laying your factory out on spheres. &amp;ldquo;Cannot place blueprint across tropic lines&amp;rdquo; just feels bad; you really want your factory layout not to depend on where it is situated.&lt;/li&gt;
&lt;li&gt;Outer Wilds (about half an hour). Everyone raves about this game, but it makes me travel-sick very fast. No further comment.&lt;/li&gt;
&lt;li&gt;Human Resource Corporation, and 7 Billion Humans (25 hours total). As I&amp;rsquo;ve got older, games which are purely programming have become less appealing (that is, after all, my day job). These ones are visually pretty, but I have no idea how they&amp;rsquo;ll play for someone who is not a programmer.&lt;/li&gt;
&lt;li&gt;Among Us (70 hours). I love this game (multiplayer social deduction), and am quite sad that everyone stopped playing it after the pandemic. Your first few games will be extremely hard if you&amp;rsquo;re an impostor, because your plausibility relies on being able to make up what you were doing where (which means you need to know the maps), but once you&amp;rsquo;ve got over that it&amp;rsquo;s just really fun.&lt;/li&gt;
&lt;li&gt;Antichamber (2 hours). This makes me motion-sick really quickly, and I have only played it in ten-minute bursts. I imagine this would be very interesting if I could play it.&lt;/li&gt;
&lt;li&gt;Baba Is You (68 hours). Cute puzzle game, with some extremely difficult puzzles. Mind-blowingly beautiful mechanics as you get towards the end. Tier 1. I played this with my housemates on a big screen and it was a great way to play!&lt;/li&gt;
&lt;li&gt;Braid (9 hours). Lovely puzzle game, innovative, coherent; a classic Jonathan Blow game. See &lt;a href="https://qntm.org/braid"&gt;qntm&amp;rsquo;s write-up&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;Classic Sudoku (135 hours) and Killer Sudoku (107 hours), by the Cracking the Cryptic team. A bunch of these puzzles are just really neat! A few are slogs, but many of them are cute, and I got the impression at the time that it might be quite a good introduction to advanced Sudoku techniques. The over-100-hours is because I have done each puzzle twice.&lt;/li&gt;
&lt;li&gt;Death and Taxes (2 hours). Meh. Three years after playing it I can&amp;rsquo;t really remember it at all.&lt;/li&gt;
&lt;li&gt;Disco Elysium (17 hours). Some of this game is pretty funny. I haven&amp;rsquo;t completed it, because it was getting to be a bit of a slog.&lt;/li&gt;
&lt;li&gt;Dota 2 (thousands of hours). Deeply addictive. You will spend the first thousand hours or so &lt;em&gt;completely sucking&lt;/em&gt; at this game, and improvement comes from recognising that you suck (thanks Purge for the framing on this). I stopped playing this game many years ago when I discovered that I didn&amp;rsquo;t actually enjoy it. My mechanical skill was pretty mediocre, so my specialist skill, inasmuch as I had one, was to bind together a team and keep morale up. A team of five coherent players will beat a team of five individuals any day of the week, and a team of five players will beat a team of four players plus a griefer, so an extremely valuable role is &amp;ldquo;keep your team feeling like a unit&amp;rdquo;. But it grinds away at the soul, and eventually I realised it isn&amp;rsquo;t fun.&lt;/li&gt;
&lt;li&gt;Elsinore (7 hours). Intriguing and cute puzzle game: you&amp;rsquo;re playing Ophelia, caught in a time loop for several critical days in the setting of Hamlet. You gradually learn what happens when, and how you can act to change what happens. I haven&amp;rsquo;t finished this because it had a bit too much of the &lt;a href="https://www.joelonsoftware.com/2001/12/11/back-to-basics/"&gt;Shlemiel the Painter&lt;/a&gt; about it: as you solve milestones, you keep revealing more, but have to keep retracing the same steps anyway.&lt;/li&gt;
&lt;li&gt;The Zachtronics games (Exapunks, TIS-100, Shenzhen I/O, Opus Magnum, MOLEK-SYNTEZ; excluding Infinifactory; a couple of hours). Again, like Human Resource Corporation, these games are purely programming, and I&amp;rsquo;m getting too old for that sort of thing to be a fun way to relax.&lt;/li&gt;
&lt;li&gt;The House of da Vinci (and 2 and 3; 20 hours). These are all a bit too point-and-click linear for my liking.&lt;/li&gt;
&lt;li&gt;Inscryption (15 hours). Interesting card game mechanic; intriguing metagame.&lt;/li&gt;
&lt;li&gt;Islands of Insight (55 hours). Loads and &lt;em&gt;loads&lt;/em&gt; of small puzzles, many of them Nikoli-like. Some are just quite annoying (&amp;ldquo;go to this place and hunt around&amp;rdquo;). Some are deeply absorbing. Very pretty aesthetics.&lt;/li&gt;
&lt;li&gt;The Witness (55 hours). Good lord is this game amazing. It&amp;rsquo;s a superstimulus for the sense of discovering an insight. The game mechanics are all taught entirely without words, which is a brilliant trick if you can manage it.&lt;/li&gt;
&lt;li&gt;The Looker (2 hours). Parody of The Witness. Some of it laugh-out-loud funny.&lt;/li&gt;
&lt;li&gt;Loop Hero (25 hours, not all of which was me). Very playable roguelike.&lt;/li&gt;
&lt;li&gt;Obduction (7 hours). I distinctly remember that when I was much younger I enjoyed Myst and friends. This was back in the days when I had the patience to read &lt;em&gt;The Lord of the Rings&lt;/em&gt;, for example. Nowadays I suspect I just don&amp;rsquo;t have the attention span and/or patience. Obduction in particular requires a &lt;em&gt;lot&lt;/em&gt; of walking around.&lt;/li&gt;
&lt;li&gt;Offworld Trading Company (30 hours). I am &lt;em&gt;terrible&lt;/em&gt; at this game, and find it deeply stressful, but it&amp;rsquo;s extremely compelling. The market mechanic is either very innovative or very innovatively phrased.&lt;/li&gt;
&lt;li&gt;Oxygen Not Included (8 hours). I feel like I&amp;rsquo;m missing some fundamental part of this game. It feels like it should be some massive Factorio-like infinite world automation thing, but in practice I ended up doing an awful lot of micromanagement. Probably a skill issue.&lt;/li&gt;
&lt;li&gt;Patrick&amp;rsquo;s Parabox (10 hours). Cute puzzle game. Mind-bending, innovative. Really good.&lt;/li&gt;
&lt;li&gt;Portal (and 2, and the Reloaded mod; 35 hours in total). Classics, of course.&lt;/li&gt;
&lt;li&gt;Return of the Obra Dinn (12 hours). Aesthetically beautiful game. When the main mechanic was introduced, I sat back in awe. You gradually get to have quite a good mental map of what&amp;rsquo;s going on here. Highly recommended.&lt;/li&gt;
&lt;li&gt;Slay the Spire (hundreds of hours). Deep gameplay (&lt;em&gt;extremely&lt;/em&gt; deep - check out Jorbs&amp;rsquo;s streams!). One of those games where it takes a while to realise just how bad at it you are; all your losses feel like luck, but actually this game is at least 80% skill.&lt;/li&gt;
&lt;li&gt;Roguebook (23 hours). A variant of Slay the Spire. Aesthetically quite pleasing, but I didn&amp;rsquo;t find it as gripping as StS.&lt;/li&gt;
&lt;li&gt;Subnautica (26 hours). Personally I am a wimp and found quite a bit of this game primally terrifying; so much so that I ended up watching a stream of the game past a certain point. I don&amp;rsquo;t much like the choice to phrase the story in terms of time pressure, when everything is actually triggered by reaching certain milestones. It&amp;rsquo;s pretty, though, and if I weren&amp;rsquo;t a wuss I&amp;rsquo;d definitely have played it to the end.&lt;/li&gt;
&lt;li&gt;SUPERHOT (3 hours). This is the first-person shooter for the person like me who is terrible at first-person shooters! It&amp;rsquo;s more like a puzzle game than a shooter, but for the first time it made me feel like I had a game in the shooter genre that I could play!&lt;/li&gt;
&lt;li&gt;Taiji (12 hours). This is a puzzle game much like The Witness but a bit worse (but still a great game!).&lt;/li&gt;
&lt;li&gt;The Talos Principle (and 2; 35 hours total). Puzzle games with a skin of basic philosophy. Aesthetically beautiful; some very hard puzzles.&lt;/li&gt;
&lt;li&gt;Torment: Tides of Numenera (40 hours, because I&amp;rsquo;ve played it twice). If you&amp;rsquo;re going to play an RPG, play Baldur&amp;rsquo;s Gate 3 instead. Torment is much less pretty and considerably smaller, but I did have fun playing it.&lt;/li&gt;
&lt;li&gt;Understand (3 hours). Tiny puzzle game. Almost precisely an IQ test. Great fun.&lt;/li&gt;
&lt;li&gt;We Were Here (and Too, and Together; a few hours total). Two-player co-op games. The in-game chat is really janky, so we just used Discord. I feel like these were nearly great games, but something just felt missing. A Baldur&amp;rsquo;s Gate 3 campaign completely supplanted this.&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="board-games"&gt;Board games&lt;/h1&gt;
&lt;p&gt;(This section is basically a placeholder for now.)&lt;/p&gt;</description></item><item><title>The Yoneda lemma</title><link>/posts/2024-04-13-yoneda/</link><pubDate>Sat, 13 Apr 2024 16:58:00 +0100</pubDate><guid>/posts/2024-04-13-yoneda/</guid><description>Another attempt to explain that the Yoneda lemma is actually intuitive.</description></item><item><title>ChatGPT's effect on my programming</title><link>/posts/2024-03-27-chatgpt-and-programming/</link><pubDate>Wed, 27 Mar 2024 12:01:00 +0000</pubDate><guid>/posts/2024-03-27-chatgpt-and-programming/</guid><description>After a decent while programming with ChatGPT, I&amp;rsquo;m not sure it&amp;rsquo;s even a net positive on my ability.</description></item><item><title>YAML is not a superset of JSON</title><link>/posts/2024-03-14-yaml-superset-json/</link><pubDate>Thu, 14 Mar 2024 00:12:00 +0000</pubDate><guid>/posts/2024-03-14-yaml-superset-json/</guid><description>All the reasons I know for why YAML is not a superset of JSON.</description></item><item><title>Trip to Tromsø</title><link>/posts/2024-03-13-northern-lights-trip/</link><pubDate>Wed, 13 Mar 2024 12:18:00 +0000</pubDate><guid>/posts/2024-03-13-northern-lights-trip/</guid><description>Travelogue of my trip to Norway.</description></item><item><title>Why does no-confusion use equality rather than a recursive call?</title><link>/posts/2024-03-01-no-confusion/</link><pubDate>Fri, 01 Mar 2024 13:51:00 +0000</pubDate><guid>/posts/2024-03-01-no-confusion/</guid><description>A question about the definition of a no-confusion type.</description></item><item><title>Starting a suspended process</title><link>/posts/2024-01-19-starting-suspended-process/</link><pubDate>Fri, 19 Jan 2024 18:51:00 +0000</pubDate><guid>/posts/2024-01-19-starting-suspended-process/</guid><description>How to start a process into a suspended state on Linux</description></item><item><title>Announcing WoofWare.Myriad.Plugins</title><link>/posts/2023-12-31-woofware-myriad-plugins/</link><pubDate>Sun, 31 Dec 2023 13:42:00 +0000</pubDate><guid>/posts/2023-12-31-woofware-myriad-plugins/</guid><description>Some F# source generators to solve common problems I have.</description></item><item><title>iOS interface</title><link>/posts/2023-12-31-ios-interface/</link><pubDate>Sun, 31 Dec 2023 12:49:00 +0000</pubDate><guid>/posts/2023-12-31-ios-interface/</guid><description>A bunch of ways the iOS user interface is bad, and some undiscoverable features.</description></item><item><title>Squashed stacked PRs workflow</title><link>/posts/2023-10-18-squash-stacked-prs/</link><pubDate>Wed, 18 Oct 2023 20:36:00 +0100</pubDate><guid>/posts/2023-10-18-squash-stacked-prs/</guid><description>How to handle stacked pull requests in a repository which requires squashing all history on merge.</description></item><item><title>Raymond Smullyan chess problem walkthrough</title><link>/posts/2023-10-06-smullyan-chess/</link><pubDate>Fri, 06 Oct 2023 20:53:00 +0100</pubDate><guid>/posts/2023-10-06-smullyan-chess/</guid><description>The thought process behind solving a particular Raymond Smullyan chess retrograde analysis puzzle.</description></item><item><title>Nix fireside chat outline</title><link>/posts/2023-10-05-nix-fireside-chat/</link><pubDate>Thu, 05 Oct 2023 20:00:00 +0100</pubDate><guid>/posts/2023-10-05-nix-fireside-chat/</guid><description>A talk I gave at work about the Nix build system.</description></item><item><title>Property-based testing introduction</title><link>/posts/2023-10-01-property-based-test-talk/</link><pubDate>Sun, 01 Oct 2023 20:53:00 +0100</pubDate><guid>/posts/2023-10-01-property-based-test-talk/</guid><description>A talk I gave at work introducing property-based testing and then giving some more advanced techniques.</description></item><item><title>The tiny proof that primes 1 mod 4 are sums of two squares</title><link>/posts/2023-09-28-sum-of-two-squares/</link><pubDate>Thu, 28 Sep 2023 00:15:00 +0000</pubDate><guid>/posts/2023-09-28-sum-of-two-squares/</guid><description>Exploding the incredibly terse proof into a bunch of exposition.</description></item><item><title>Imre Leader Appreciation Society</title><link>/ILAS/</link><pubDate>Sat, 09 Sep 2023 23:30:00 +0100</pubDate><guid>/ILAS/</guid><description>&lt;p&gt;I used to maintain an archive of the Imre Leader Appreciation Society for posterity through WebCitation, but WebCitation itself is now dead, so here I simply link to [Konrad Dąbrowski&amp;rsquo;s capture][https://www.konraddabrowski.co.uk/ilas/index.html).&lt;/p&gt;</description></item><item><title>Anki decks</title><link>/anki-decks/</link><pubDate>Fri, 08 Sep 2023 19:22:27 +0100</pubDate><guid>/anki-decks/</guid><description>&lt;p&gt;I have deleted almost all of the Anki decks on this page, because I think they would do more harm than good.
They were made during a time when I didn&amp;rsquo;t really know how to use Anki appropriately.
Any remaining decks here are CC-BY-SA.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="/AnkiDecks/CapitalsOfTheWorld.apkg"&gt;Geography&lt;/a&gt; (the deck has a misleading name; it&amp;rsquo;s actually a general Geography deck). You can filter out the &lt;code&gt;london-tube&lt;/code&gt; tag if you like, or &lt;code&gt;world-capitals&lt;/code&gt;, or &lt;code&gt;american-geography&lt;/code&gt;.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;a href="http://creativecommons.org/licenses/by-sa/3.0/deed.en_GB"&gt;&lt;img src="https://licensebuttons.net/l/by-sa/3.0/88x31.png" alt="Creative Commons Licence"&gt;&lt;/a&gt;
This work by &lt;a href="/anki-decks/"&gt;Patrick Stevens&lt;/a&gt; is licensed under a &lt;a href="http://creativecommons.org/licenses/by-sa/3.0/deed.en_GB"&gt;Creative Commons Attribution-ShareAlike 3.0 Unported License&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Notes for a Git fireside chat</title><link>/posts/2023-09-06-git-showcase/</link><pubDate>Wed, 06 Sep 2023 13:51:00 +0000</pubDate><guid>/posts/2023-09-06-git-showcase/</guid><description>A syllabus for a fireside chat to give at work, on Git</description></item><item><title>Films</title><link>/films/</link><pubDate>Sat, 02 Sep 2023 13:30:00 +0100</pubDate><guid>/films/</guid><description>&lt;p&gt;This page holds a list of films I have watched, spoiler-free, starting from 9th January 2015.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;
&lt;p&gt;&lt;a href="https://www.imdb.com/title/tt12042730/"&gt;Project Hail Mary&lt;/a&gt;: Great film. Visually beautiful; tense where appropriate; I was absolutely surrounded by people crying. Strongly recommended; I saw this on the BFI IMAX screen, which I think was a good choice.&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;a href="https://www.imdb.com/title/tt2906216/"&gt;Dungeons and Dragons: Honour Among Thieves&lt;/a&gt;: Really rather good! As they say, &amp;ldquo;Consider this fan serviced&amp;rdquo;. Light-hearted, plenty of flashy callouts.&lt;/p&gt;</description></item><item><title>Questions I had about transformers</title><link>/posts/2023-07-12-transformer-questions/</link><pubDate>Wed, 12 Jul 2023 00:00:00 +0000</pubDate><guid>/posts/2023-07-12-transformer-questions/</guid><description>Some basic questions I had about transformers, and their possible answers.</description></item><item><title>Lifehacks</title><link>/lifehacks/</link><pubDate>Sat, 31 Dec 2022 23:21:44 +0000</pubDate><guid>/lifehacks/</guid><description>&lt;p&gt;If I ever become rich and famous, I&amp;rsquo;m sure I&amp;rsquo;ll be besieged with requests for &amp;ldquo;how to do better in life&amp;rdquo;. I hereby head such requests off at the pass, by providing a list of &lt;a href="https://en.wikipedia.org/wiki/Life_hack"&gt;lifehacks&lt;/a&gt; I am either using or considering the use of.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;For learning smallish but numerous facts (such as a list of theorems), I use &lt;a href="http://ankisrs.net/"&gt;Anki&lt;/a&gt;, which is a &lt;a href="https://en.wikipedia.org/wiki/Spaced_repetition"&gt;spaced-repetition&lt;/a&gt; learning system, allowing you to enter flashcards and have them shown to you regularly. The time between repetitions of a certain flashcard changes, depending on how well you&amp;rsquo;ve been doing on that flashcard - so marking your performance on a particular card as &amp;ldquo;easy&amp;rdquo; rather than &amp;ldquo;hard&amp;rdquo; tells Anki that you don&amp;rsquo;t want to see that card for a while. It&amp;rsquo;s a bit like the antithesis of cramming, where you see the material exactly once and use it a short time later; Anki is designed for reviewing the material many times (at an optimal spacing) for recall whenever you need it. The idea is to make use of the &lt;a href="https://en.wikipedia.org/wiki/Spacing_effect"&gt;spacing effect&lt;/a&gt; - an extremely powerful memory technique that is currently ignored by almost all methods of formal teaching (&lt;a href="https://www.memrise.com/"&gt;Memrise&lt;/a&gt; is a notable exception; I used Memrise until I used Anki).&lt;/li&gt;
&lt;li&gt;A surprisingly good way of making myself work when I&amp;rsquo;m feeling unmotivated is to gather a few like-minded friends and to work in absolute silence with them (possibly on completely unrelated topics). Oddly, I&amp;rsquo;d not thought of it until reading &lt;a href="http://lesswrong.com/lw/gwo/coworking_collaboration_to_combat_akrasia/"&gt;a LessWrong post on the subject&lt;/a&gt;. There&amp;rsquo;s a kind of &amp;ldquo;all in this together&amp;rdquo; feeling, as well as the public commitment effect.&lt;/li&gt;
&lt;li&gt;I use &lt;a href="https://justgetflux.com/"&gt;f.lux&lt;/a&gt;, an application which dims and tints red the computer screen after dusk. I have no idea whether or not it has any effect on wakefulness at night (that is, whether or not being bathed in a standard blue glow keeps me awake), but it certainly feels nicer on the eye.&lt;/li&gt;
&lt;li&gt;I am currently in the middle of learning &lt;a href="https://en.wikipedia.org/wiki/Dvorak_Simplified_Keyboard"&gt;Dvorak&lt;/a&gt;, which is a keyboard layout (QWERTY is the usual one) that is supposedly easier on the hands than QWERTY. It puts vowels all together in easy-to-reach places, and the most common consonants in easy places such that words tend to be made of letters which lie in different hands. (In QWERTY, for example, the word &amp;ldquo;the&amp;rdquo; is oddly hard to type, for such a common word - all the characters are away from the home row - but in Dvorak it&amp;rsquo;s just a simple flourish from right to left on the home row.) A friend tells me that &lt;a href="http://colemak.com/"&gt;Colemak&lt;/a&gt; is better than Dvorak, but I&amp;rsquo;d already half-learnt Dvorak by the time ey told me this, and Dvorak interfered heavily with my attempts to learn Colemak. It appears to be much of a muchness, anyway - both are considerably better than QWERTY.&lt;/li&gt;
&lt;li&gt;I don&amp;rsquo;t know if it qualifies as a lifehack - more of a biohack or something - but &lt;a href="https://en.wikipedia.org/wiki/Lucid_dream"&gt;lucid dreaming&lt;/a&gt; is really cool, and it doesn&amp;rsquo;t take an enormous amount of commitment to learn to do (it just requires the setting up of a few habits throughout the day).&lt;/li&gt;
&lt;li&gt;Something I&amp;rsquo;m strongly considering when it&amp;rsquo;s set up and running properly is &lt;a href="https://soylent.com"&gt;Soylent&lt;/a&gt;, a food substitute being developed by an engineer, which is nutritionally complete and satisfying. As of this writing, the creator has been on it for three and a half months without ill effects (once he&amp;rsquo;d sorted out the balance, anyway - he discovered a sulphur deficiency at the start of the third month, which is a very hard deficiency to give someone normally!) Currently, someone I know is using &lt;a href="https://www.exantediet.com/" title="Exante diet"&gt;the Exante diet&lt;/a&gt; (the presence of a link is not necessarily an endorsement), which consists of similar but very low-calorie meal replacements; this person has been a very interesting source of information on replacing meals in this way. Their main objection to the diet seems to be the monotony, but supposedly Soylent is bland enough not to suffer from this (I could eat bread until the cows came home, for instance, but not chocolate). The Soylent Corp. says that Soylent will get cheaper as the company is set up and grows. (The creator wrote a response, but the link is now dead.)&lt;/li&gt;
&lt;li&gt;How to get up in the morning: because it&amp;rsquo;s really quite hard to motivate yourself to move, I count down from 10 to 1, with the resolution that on the count of 1 I will get up. It&amp;rsquo;s much easier to motivate yourself to count down from 10 than it is to move your entire body somewhere uncomfortable, and once I&amp;rsquo;m counting, consistency pressure is enough to make me follow through. I&amp;rsquo;m careful with this technique - I never use it on anything I&amp;rsquo;m not absolutely certain to do. It might pollute the technique irreparably if I had an excuse that &amp;ldquo;oh, once I did this and it didn&amp;rsquo;t work!&amp;rdquo;.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;More to come.&lt;/p&gt;</description></item><item><title>About me</title><link>/about/</link><pubDate>Sat, 20 Aug 2022 14:18:00 +0100</pubDate><guid>/about/</guid><description>&lt;p&gt;I am Patrick Stevens, a software engineer based in London, England.&lt;/p&gt;

&lt;img src="/images/AboutMe/northern-lights.png" alt="Photo of me under the Northern Lights" style="max-width: 500px;"&gt;

&lt;p&gt;I completed my BA+MMath at the University of Cambridge.&lt;/p&gt;
&lt;p&gt;Social media accounts:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/Smaug123/" title="Patrick Stevens Github account"&gt;Github&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;&lt;a href="https://news.ycombinator.com/user?id=Smaug123"&gt;Hacker News&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;&lt;a href="mailto:patrick&amp;#43;sidebar@patrickstevens.co.uk"&gt;Email&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.linkedin.com/in/patrick-stevens-2846017b/"&gt;LinkedIn&lt;/a&gt; (used almost never).&lt;/li&gt;
&lt;li&gt;&lt;a href="https://twitter.com/smaug12345" title="My Twitter account"&gt;Twitter&lt;/a&gt; (used almost never). My handle is @smaug12345.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;I am very interested in maths and puzzle-solving.
For instance:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;I have one of the &lt;a href="https://math.stackexchange.com/questions/1681993/why-is-1-frac11-frac11-ldots-not-real/1682008#1682008"&gt;top twenty answers on the Maths StackExchange&lt;/a&gt; by upvotes.&lt;/li&gt;
&lt;li&gt;On &lt;a href="http://www.hacker.org" title="Hacker.org"&gt;Hacker.org&lt;/a&gt;, I am &lt;a href="http://www.hacker.org/forum/profile.php?mode=viewprofile&amp;amp;#38;u=13437" title="My Hacker.org profile"&gt;laz0r&lt;/a&gt;, one of the top 50 users, although I have run out of low-hanging fruit on that site and I haven&amp;rsquo;t returned to it for a while.&lt;/li&gt;
&lt;li&gt;For three years running, I have participated in-person in the &lt;a href="https://en.wikipedia.org/wiki/MIT_Mystery_Hunt"&gt;MIT Mystery Hunt&lt;/a&gt;, solving with Team Palindrome; if interested, see &lt;a href="https://www.ericberlin.com/2019/01/23/mystery-hunt-2019/"&gt;captain&amp;rsquo;s write-up from 2019&lt;/a&gt; and &lt;a href="https://www.ericberlin.com/2020/01/22/a-really-absurdly-long-post-about-the-mit-mystery-hunt/"&gt;from 2020&lt;/a&gt;. In 2021, &lt;a href="https://www.ericberlin.com/2021/01/19/my-mystery-hunt-2021-wrapup/"&gt;we won&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;I have solved &lt;span class="sidenote"&gt;
 &lt;label class="sidenote-label" for="project-euler"&gt; a number&lt;/label&gt;
 &lt;input class="sidenote-checkbox" type="checkbox" id="project-euler" /&gt;
 &lt;span class="sidenote-content sidenote-right"&gt;
 &lt;img src="/images/AboutMe/project_euler.png" alt="Badge indicating at least 185 problems solved on Project Euler"/&gt;
 &lt;/span&gt;
&lt;/span&gt; of &lt;a href="https://projecteuler.net/"&gt;Project Euler&lt;/a&gt; problems.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Languages:&lt;/p&gt;</description></item><item><title>About this website</title><link>/about-this-site/</link><pubDate>Sun, 31 Jul 2022 20:16:44 +0100</pubDate><guid>/about-this-site/</guid><description>&lt;p&gt;This website has been around in one form or another since June 26th, 2013.&lt;/p&gt;
&lt;p&gt;The website is hosted on &lt;a href="https://www.digitalocean.com"&gt;DigitalOcean&lt;/a&gt; and is served statically by &lt;a href="https://www.nginx.com/"&gt;NGINX&lt;/a&gt;.
&lt;a href="https://www.cloudflare.com"&gt;Cloudflare&lt;/a&gt; is sitting between my DigitalOcean droplet and you.
Your HTTPS connection is secure to Cloudflare, and secure from Cloudflare to the droplet.&lt;/p&gt;
&lt;p&gt;The rendering engines are &lt;a href="https://gohugo.io/"&gt;Hugo&lt;/a&gt; for the site, &lt;a href="https://www.tug.org/applications/pdftex/"&gt;pdftex&lt;/a&gt; for PDFs, and &lt;a href="https://imagemagick.org/index.php"&gt;ImageMagick&lt;/a&gt; to create image thumbnails.
The Hugo theme is &lt;a href="https://themes.gohugo.io/anatole/"&gt;Anatole&lt;/a&gt; with a variety of modifications, most notably to remove most uses of JavaScript and to incorporate &lt;a href="https://danilafe.com/blog/sidenotes/"&gt;Danila Fedore&amp;rsquo;s sidenotes&lt;/a&gt; (&lt;a href="https://web.archive.org/web/20210116232126/https://danilafe.com/blog/sidenotes/"&gt;archive&lt;/a&gt;).
Mathematical notation in HTML is rendered by &lt;a href="https://katex.org/"&gt;KaTeX&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>The water filtration industry has played us for absolute fools</title><link>/posts/2022-05-15-water-filtration/</link><pubDate>Sun, 15 May 2022 00:00:00 +0000</pubDate><guid>/posts/2022-05-15-water-filtration/</guid><description>My Brita water filter does not in fact purify.</description></item><item><title>Don't supply `-f` to `rm` unless you know you need it</title><link>/posts/2021-10-25-avoid-rm-rf/</link><pubDate>Mon, 25 Oct 2021 00:00:00 +0000</pubDate><guid>/posts/2021-10-25-avoid-rm-rf/</guid><description>A vignette on the theme of &amp;lsquo;do not allow yourself to get into the habit of supplying the &lt;code&gt;-f&lt;/code&gt; flag to &lt;code&gt;rm&lt;/code&gt;&amp;rsquo;.</description></item><item><title>Argument in a high-trust environment</title><link>/posts/2021-10-22-argument/</link><pubDate>Thu, 21 Oct 2021 00:00:00 +0000</pubDate><guid>/posts/2021-10-22-argument/</guid><description>I tend to argue things in a particular way because I&amp;rsquo;m in a high-trust environment.</description></item><item><title>Crates (existentials in F#)</title><link>/posts/2021-10-19-crates/</link><pubDate>Tue, 19 Oct 2021 00:00:00 +0000</pubDate><guid>/posts/2021-10-19-crates/</guid><description>An introduction to the crate pattern for representing existential quantification in F#.</description></item><item><title>Restaurants</title><link>/restaurants/</link><pubDate>Sun, 12 Sep 2021 22:47:44 +0100</pubDate><guid>/restaurants/</guid><description>&lt;p&gt;This page is a list of restaurants I know to be good, or which I intend to try.&lt;/p&gt;
&lt;h1 id="london"&gt;London&lt;/h1&gt;
&lt;ul&gt;
&lt;li&gt;Dishoom (Bombay/Irani). For good reason are they something of a meme; I might actually agree that it&amp;rsquo;s worth queueing outside to get in. There&amp;rsquo;s almost always room for breakfast, and their breakfast is excellent (bacon and egg naan roll, chai). My favourite dishes thus far are probably the black lentil dahl and the ruby chicken.&lt;/li&gt;
&lt;li&gt;Shoryu (ramen). Solid, middlingly-expensive chain. Everything they do is about equally good.&lt;/li&gt;
&lt;li&gt;Taro (Japanese). On the cheaper end. The chicken teri don is a &lt;em&gt;lot&lt;/em&gt; of food (if you double the chicken, it&amp;rsquo;s considerably more than I could eat) and is really rather good. Bento boxes also good, but really the chicken teriyaki can&amp;rsquo;t be beaten on price-to-calories.&lt;/li&gt;
&lt;li&gt;Hawksmoor (steak). Very expensive. I&amp;rsquo;m not a steak person, but their fish menu is also excellent. No vegan offering, if I recall correctly.&lt;/li&gt;
&lt;li&gt;Casa do Frango (Portuguese chicken; basically an upmarket Nando&amp;rsquo;s). Located very near Borough Market. Quite a bit nicer than Nando&amp;rsquo;s, and only modestly more expensive. The pastel de nata is &lt;em&gt;very&lt;/em&gt; expensive but sublime. Vegan/vegetarian options very limited.&lt;/li&gt;
&lt;li&gt;Applebee&amp;rsquo;s Fish (fish). Located in Borough Market. We encountered no duds on their menu and said we&amp;rsquo;d go again.&lt;/li&gt;
&lt;li&gt;Aster (Scandi/French). Located near Victoria. Pretty expensive, but we had a great birthday meal here.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="not-tried"&gt;Not tried&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Heddon Yokocho (ramen). Jay Rayner recommended; better than Shoryu and same price; near Regent Street.&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Top Posts</title><link>/top-posts/</link><pubDate>Sun, 12 Sep 2021 22:47:44 +0100</pubDate><guid>/top-posts/</guid><description>&lt;p&gt;The generally accessible posts of which I am most proud on this website are:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="/posts/2020-10-23-anki-learning/"&gt;Anki as Learning Superpower&lt;/a&gt; (how to squeeze a bit more out of your Anki usage)&lt;/li&gt;
&lt;li&gt;&lt;a href="/posts/2013-10-20-the-ravenous/"&gt;The Ravenous&lt;/a&gt; (parody of &lt;a href="https://en.wikipedia.org/wiki/The_Raven" title="The Raven Wikipedia page"&gt;The Raven&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;&lt;a href="/posts/2013-08-18-thinking-styles/"&gt;Thinking Styles&lt;/a&gt; (about how people think differently to each other)&lt;/li&gt;
&lt;li&gt;&lt;a href="/posts/2013-07-21-on-shakespeare/"&gt;On Shakespeare&lt;/a&gt; (the foolishness of teaching Shakespeare in school to pupils of a young age)&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The mathematical posts:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="/posts/2013-08-31-slightly-silly-sylow-pseudo-sonnets/"&gt;Slightly Silly Sylow Pseudo-Sonnets&lt;/a&gt; (poetical proof of the Sylow Theorems)&lt;/li&gt;
&lt;li&gt;&lt;a href="/posts/2015-12-24-general-adjoint-functor-theorem/"&gt;General Adjoint Functor Theorem&lt;/a&gt; (exposition on the GAFT and how it is actually a very natural theorem)&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The computer-science posts:&lt;/p&gt;</description></item><item><title>Metatesting your property-based tests</title><link>/posts/2021-02-06-property-based-metatesting/</link><pubDate>Thu, 27 May 2021 00:00:00 +0000</pubDate><guid>/posts/2021-02-06-property-based-metatesting/</guid><description>A rather little-known but very easy and high-reward way to sanity-check your property-based tests.</description></item><item><title>Product comparisons</title><link>/comparisons/</link><pubDate>Fri, 21 May 2021 18:23:48 +0100</pubDate><guid>/comparisons/</guid><description>&lt;p&gt;This page is an ongoing history of product comparisons, made informally but blindly.&lt;/p&gt;
&lt;h1 id="fig-rolls"&gt;Fig rolls&lt;/h1&gt;
&lt;p&gt;Compared Boland with McVities, 2022-04-18.
It was pretty obvious to me in the blind testing that the McVities ones were the big-brand ones, but Boland were much nicer.
Tasted more of fig, and had less pastry around them.&lt;/p&gt;
&lt;h1 id="miso-soup"&gt;Miso soup&lt;/h1&gt;
&lt;p&gt;I&amp;rsquo;m still on a quest for the perfect miso soup; I remember one that was really great from my childhood, and I don&amp;rsquo;t know which it was.&lt;/p&gt;</description></item><item><title>In praise of `--dry-run`</title><link>/posts/2021-02-20-in-praise-of-dry-run/</link><pubDate>Fri, 21 May 2021 00:00:00 +0000</pubDate><guid>/posts/2021-02-20-in-praise-of-dry-run/</guid><description>First-class support for a &amp;ndash;dry-run mode makes a tool more maintainable, more testable, and more user-friendly.</description></item><item><title>Continuation-passing style</title><link>/posts/2021-03-22-continuation-passing-style/</link><pubDate>Mon, 22 Mar 2021 00:00:00 +0000</pubDate><guid>/posts/2021-03-22-continuation-passing-style/</guid><description>Motivating the technique of continuation-passing style, by looking at recursive functions.</description></item><item><title>Rewriting the Technical Interview, in Mathematica</title><link>/posts/2021-03-17-rewriting-technical-interview/</link><pubDate>Wed, 17 Mar 2021 00:00:00 +0000</pubDate><guid>/posts/2021-03-17-rewriting-technical-interview/</guid><description>An exploration into reaching into the internals of Mathematica to natively evaluate C code.</description></item><item><title>Software engineer syllabus</title><link>/posts/2021-02-03-senior-engineer-syllabus/</link><pubDate>Wed, 03 Feb 2021 00:00:00 +0000</pubDate><guid>/posts/2021-02-03-senior-engineer-syllabus/</guid><description>An incomplete but growing list of things I would make mandatory reading if I were building a software engineering syllabus.</description></item><item><title>Cyclic dependencies (a note from Hacker News)</title><link>/posts/2021-01-30-cyclic-dependencies/</link><pubDate>Sat, 30 Jan 2021 00:00:00 +0000</pubDate><guid>/posts/2021-01-30-cyclic-dependencies/</guid><description>A quick note from Hacker News about how to model in F# something that might look like cyclic dependencies.</description></item><item><title>An incomplete life evaluation checklist</title><link>/posts/2021-01-21-evaluation-checklist/</link><pubDate>Thu, 21 Jan 2021 00:00:00 +0000</pubDate><guid>/posts/2021-01-21-evaluation-checklist/</guid><description>A checklist I have used during my regular six-monthly life review.</description></item><item><title>Find the Bug, C# edition</title><link>/posts/2021-01-18-find-the-bug/</link><pubDate>Mon, 18 Jan 2021 00:00:00 +0000</pubDate><guid>/posts/2021-01-18-find-the-bug/</guid><description>A cute little exercise in bug-spotting.</description></item><item><title>A bug in Git</title><link>/posts/2020-12-28-a-bug-in-git/</link><pubDate>Mon, 28 Dec 2020 00:00:00 +0000</pubDate><guid>/posts/2020-12-28-a-bug-in-git/</guid><description>A bug I found and reported in Git.</description></item><item><title>Christmas quiz</title><link>/posts/2020-12-26-christmas-quiz/</link><pubDate>Sat, 26 Dec 2020 00:00:00 +0000</pubDate><guid>/posts/2020-12-26-christmas-quiz/</guid><description>A round of questions I wrote for a Christmas quiz.</description></item><item><title>Christmas dinner notes</title><link>/posts/2020-11-21-christmas-dinner/</link><pubDate>Sat, 21 Nov 2020 00:00:00 +0000</pubDate><guid>/posts/2020-11-21-christmas-dinner/</guid><description>My notes on the production of a Christmas dinner.</description></item><item><title>Anki as Learning Superpower</title><link>/posts/2020-10-23-anki-learning/</link><pubDate>Fri, 23 Oct 2020 00:00:00 +0000</pubDate><guid>/posts/2020-10-23-anki-learning/</guid><description>Some techniques to help you get more out of Anki.</description></item><item><title>General relativity (a note from Hacker News)</title><link>/posts/2020-10-18-gravity/</link><pubDate>Sun, 18 Oct 2020 00:00:00 +0000</pubDate><guid>/posts/2020-10-18-gravity/</guid><description>A quick note from Hacker News about a neat fact from general relativity.</description></item><item><title>Nulls and options (a note from Hacker News)</title><link>/posts/2020-10-10-null-and-option/</link><pubDate>Sat, 10 Oct 2020 00:00:00 +0000</pubDate><guid>/posts/2020-10-10-null-and-option/</guid><description>A quick note from Hacker News about why we want optional types but why &amp;rsquo;null&amp;rsquo; is unintuitive.</description></item><item><title>The uncountability of the reals (a note from Hacker News)</title><link>/posts/2020-08-02-uncountability/</link><pubDate>Sun, 02 Aug 2020 00:00:00 +0000</pubDate><guid>/posts/2020-08-02-uncountability/</guid><description>A quick note from Hacker News about a beautiful proof of the uncountability of the reals.</description></item><item><title>In favour of recursive functions, not imperative constructs, to make loops</title><link>/posts/2020-07-22-tailrecursion/</link><pubDate>Wed, 22 Jul 2020 00:00:00 +0000</pubDate><guid>/posts/2020-07-22-tailrecursion/</guid><description>How to write loops immutably and safely.</description></item><item><title>Static config (a note from Hacker News)</title><link>/posts/2020-04-05-static-config/</link><pubDate>Sun, 05 Apr 2020 00:00:00 +0000</pubDate><guid>/posts/2020-04-05-static-config/</guid><description>A quick note from Hacker News about my preference for static config rather than dynamic.</description></item><item><title>Defunctionalisation</title><link>/posts/2020-03-04-defunctionalisation/</link><pubDate>Wed, 04 Mar 2020 00:00:00 +0000</pubDate><guid>/posts/2020-03-04-defunctionalisation/</guid><description>An underappreciated tool for writing good software.</description></item><item><title>MIT Mystery Hunt photos</title><link>/posts/2020-01-25-mit-mystery-hunt-photos/</link><pubDate>Sat, 25 Jan 2020 00:00:00 +0000</pubDate><guid>/posts/2020-01-25-mit-mystery-hunt-photos/</guid><description>Photos from the Mystery Hunt.</description></item><item><title>MIT Mystery Hunt 2020 answers</title><link>/posts/2020-01-16-mystery-hunt/</link><pubDate>Thu, 16 Jan 2020 00:00:00 +0000</pubDate><guid>/posts/2020-01-16-mystery-hunt/</guid><description>A couple of solution documents I made during the progress of the 2020 MIT Mystery Hunt.</description></item><item><title>Teaching how to cook (a note from Hacker News)</title><link>/posts/2019-12-27-cooking/</link><pubDate>Fri, 27 Dec 2019 00:00:00 +0000</pubDate><guid>/posts/2019-12-27-cooking/</guid><description>A quick note from Hacker News about my thoughts on teaching cookery.</description></item><item><title>The stages of mathematics teaching (a note from Hacker News)</title><link>/posts/2018-09-20-mathematics-teaching/</link><pubDate>Fri, 20 Sep 2019 00:00:00 +0000</pubDate><guid>/posts/2018-09-20-mathematics-teaching/</guid><description>A quick note from Hacker News about the various stages of learning and teaching in mathematics.</description></item><item><title>MIT Mystery Hunt 2019 answers</title><link>/posts/2019-01-16-mystery-hunt/</link><pubDate>Wed, 16 Jan 2019 00:00:00 +0000</pubDate><guid>/posts/2019-01-16-mystery-hunt/</guid><description>A couple of solution documents I made during the progress of the 2019 MIT Mystery Hunt.</description></item><item><title>Chatting with Don Syme about the F# compiler</title><link>/posts/2018-09-10-don-syme/</link><pubDate>Mon, 10 Sep 2018 00:00:00 +0000</pubDate><guid>/posts/2018-09-10-don-syme/</guid><description>Notes from a chat with the creator of F#, about how to contribute to the compiler.</description></item><item><title>Dependent types overview</title><link>/posts/2018-07-21-dependent-types-overview/</link><pubDate>Sat, 21 Jul 2018 00:00:00 +0000</pubDate><guid>/posts/2018-07-21-dependent-types-overview/</guid><description>A quick overview of dependent types.</description></item><item><title>JSON comments (a note from Hacker News)</title><link>/posts/2018-06-02-json-comments/</link><pubDate>Sat, 02 Jun 2018 00:00:00 +0000</pubDate><guid>/posts/2018-06-02-json-comments/</guid><description>A quick note from Hacker News about why the comment-handling situation in JSON is bad.</description></item><item><title>What is lost when we move between number systems?</title><link>/posts/2018-04-08-kinds-of-number/</link><pubDate>Sun, 08 Apr 2018 00:00:00 +0000</pubDate><guid>/posts/2018-04-08-kinds-of-number/</guid><description>Answering the question, &amp;ldquo;What is lost when we move from the reals to the complex numbers?&amp;rdquo;.</description></item><item><title>Infinitesimals as an idea that took a long time</title><link>/posts/2018-02-03-epsilon-delta/</link><pubDate>Sat, 03 Feb 2018 00:00:00 +0000</pubDate><guid>/posts/2018-02-03-epsilon-delta/</guid><description>Answering the question, &amp;ldquo;Which mathematical ideas took a long time to define rigorously?&amp;rdquo;.</description></item><item><title>Abuse of notation in function application</title><link>/posts/2017-11-05-abuse-of-notation/</link><pubDate>Sun, 05 Nov 2017 00:00:00 +0000</pubDate><guid>/posts/2017-11-05-abuse-of-notation/</guid><description>Answering the question, &amp;ldquo;Are these examples of abuses of notation?&amp;rdquo;.</description></item><item><title>The relationship between the IMO and research mathematics</title><link>/posts/2017-03-14-maths-olympiad/</link><pubDate>Tue, 14 Mar 2017 00:00:00 +0000</pubDate><guid>/posts/2017-03-14-maths-olympiad/</guid><description>Answering the question, &amp;ldquo;does the International Maths Olympiad help research mathematics?&amp;rdquo;.</description></item><item><title>Proof of Cauchy-Schwarz</title><link>/posts/2017-02-14-cauchy-schwarz-proof/</link><pubDate>Tue, 14 Feb 2017 00:00:00 +0000</pubDate><guid>/posts/2017-02-14-cauchy-schwarz-proof/</guid><description>&lt;p&gt;This is just a link to a &lt;a href="http://www-stat.wharton.upenn.edu/~steele/Publications/Books/CSMC/New%20Problems/CSNewProof/CauchySchwarzInequalityProof.pdf"&gt;beautiful proof&lt;/a&gt; of the &lt;a href="https://en.wikipedia.org/wiki/Cauchy%E2%80%93Schwarz_inequality"&gt;Cauchy-Schwarz inequality&lt;/a&gt;.
There are a number of elegant proofs, but this is by far my favourite, because (as pointed out in the paper) it &amp;ldquo;builds itself&amp;rdquo;.&lt;/p&gt;</description></item><item><title>What does Mathematica mean by ComplexInfinity?</title><link>/posts/2016-12-31-complex-infinity/</link><pubDate>Sat, 31 Dec 2016 00:00:00 +0000</pubDate><guid>/posts/2016-12-31-complex-infinity/</guid><description>Answering the question, &amp;ldquo;Why does WolframAlpha say that a quantity is ComplexInfinity?&amp;rdquo;.</description></item><item><title>How far back does mathematical understanding go?</title><link>/posts/2016-08-10-reinvent-maths/</link><pubDate>Wed, 10 Aug 2016 00:00:00 +0000</pubDate><guid>/posts/2016-08-10-reinvent-maths/</guid><description>Answering the question, &amp;ldquo;how far back in time would maths be understandable to a modern mathematician?&amp;rdquo;.</description></item><item><title>A Free Market</title><link>/posts/2016-08-07-a-free-market/</link><pubDate>Sun, 07 Aug 2016 00:00:00 +0000</pubDate><guid>/posts/2016-08-07-a-free-market/</guid><description>The story of Martin&amp;rsquo;s search for a kaki fruit.</description></item><item><title>Be a Beginner</title><link>/posts/2016-08-05-be-a-beginner/</link><pubDate>Fri, 05 Aug 2016 00:00:00 +0000</pubDate><guid>/posts/2016-08-05-be-a-beginner/</guid><description>Being a beginner at something is great, especially if it&amp;rsquo;s something that humans are built for.</description></item><item><title>Part III essay</title><link>/posts/2016-06-15-part-iii-essay/</link><pubDate>Wed, 15 Jun 2016 00:00:00 +0000</pubDate><guid>/posts/2016-06-15-part-iii-essay/</guid><description>&lt;p&gt;Now that my time in &lt;a href="https://en.wikipedia.org/wiki/Part_III_of_the_Mathematical_Tripos"&gt;Part III&lt;/a&gt; is over, I feel justified in releasing &lt;a href="https://www.patrickstevens.co.uk/misc/NonstandardAnalysis/NonstandardAnalysisPartIII.pdf"&gt;my essay&lt;/a&gt;,
which is on the subject of &lt;a href="https://en.wikipedia.org/wiki/Non-standard_analysis"&gt;Non-standard Analysis&lt;/a&gt;.
It was supervised by Dr Thomas Forster
(to whom I owe many thanks for exposing me to such an interesting subject, and for agreeing to supervise the essay).&lt;/p&gt;</description></item><item><title>The use of jargon</title><link>/posts/2016-06-13-the-use-of-jargon/</link><pubDate>Mon, 13 Jun 2016 00:00:00 +0000</pubDate><guid>/posts/2016-06-13-the-use-of-jargon/</guid><description>Why jargon is a really useful thing to have and use.</description></item><item><title>Finitistic reducibility</title><link>/posts/2016-05-25-finitistic-reducibility/</link><pubDate>Wed, 25 May 2016 00:00:00 +0000</pubDate><guid>/posts/2016-05-25-finitistic-reducibility/</guid><description>A quick overview of the definition of the mathematical concept of finitistic reducibility.</description></item><item><title>Tennenbaum's theorem</title><link>/posts/2016-04-27-tennenbaums-theorem/</link><pubDate>Wed, 27 Apr 2016 00:00:00 +0000</pubDate><guid>/posts/2016-04-27-tennenbaums-theorem/</guid><description>&lt;p&gt;Most recent exposition: &lt;a href="/misc/Tennenbaum/Tennenbaum.pdf"&gt;an article&lt;/a&gt; on &lt;a href="https://en.wikipedia.org/wiki/Tennenbaum%27s_theorem"&gt;Tennenbaum&amp;rsquo;s Theorem&lt;/a&gt;.
Comments welcome.
The proof is cribbed from Dr Thomas Forster, but his notes only sketched the fairly crucial last step, on account of the notes not yet being complete.&lt;/p&gt;</description></item><item><title>Modular machines</title><link>/posts/2016-04-21-modular-machines/</link><pubDate>Thu, 21 Apr 2016 00:00:00 +0000</pubDate><guid>/posts/2016-04-21-modular-machines/</guid><description>&lt;p&gt;I&amp;rsquo;ve written &lt;a href="/misc/ModularMachines/EmbedMMIntoTuringMachine.pdf"&gt;a blurb&lt;/a&gt; about what a modular machine is (namely, another Turing-equivalent form of computing machine),
and how a Turing machine may be simulated in one.
(In fact, that blurb now contains an overview of how we may use modular machines to produce a group with insoluble word problem,
and how to use them to embed a recursively presented group into a finitely presented one.)&lt;/p&gt;
&lt;p&gt;A modular machine is like a slightly more complicated version of a Turing machine, but it has the advantage
that it is easier to embed a modular machine into a group than it is to embed a Turing machine directly into a group.
We can use this embedding to show that there is a group with unsolvable word problem:
solving the word problem would correspond to determining whether a certain Turing machine halted.&lt;/p&gt;</description></item><item><title>Independence of the Axiom of Choice (for programmers)</title><link>/posts/2016-04-13-independence-of-choice/</link><pubDate>Wed, 13 Apr 2016 00:00:00 +0000</pubDate><guid>/posts/2016-04-13-independence-of-choice/</guid><description>So you&amp;rsquo;ve heard that the Axiom of Choice is magical and special and unprovable and independent of set theory, and you&amp;rsquo;re here to work out what that means.</description></item><item><title>Another Monty Hall explanation</title><link>/posts/2016-04-08-another-monty-hall-explanation/</link><pubDate>Fri, 08 Apr 2016 00:00:00 +0000</pubDate><guid>/posts/2016-04-08-another-monty-hall-explanation/</guid><description>&lt;p&gt;Recall the &lt;a href="/posts/2013-12-22-three-explanations-of-the-monty-hall-problem/"&gt;Monty Hall problem&lt;/a&gt;: the host, Monty Hall, shows you three doors, named A, B and C.
You are assured that behind one of the doors is a car, and behind the two others there is a goat each.
You want the car.
You pick a door, and Monty Hall opens one of the two doors you didn&amp;rsquo;t pick that he knows contains a goat.
He offers you the chance to switch guesses from the door you first picked to the one remaining door.
Should you switch or stick?&lt;/p&gt;</description></item><item><title>Clojure and Exercism</title><link>/posts/2016-03-28-clojure-exercism/</link><pubDate>Mon, 28 Mar 2016 00:00:00 +0000</pubDate><guid>/posts/2016-03-28-clojure-exercism/</guid><description>I&amp;rsquo;ve been trying to learn Clojure through Exercism, a programming exercises tool. It took me an hour to get Hello, World! up and running, so I thought I&amp;rsquo;d document how it&amp;rsquo;s done. I&amp;rsquo;m using Leiningen on Mac OS 10.11.4.</description></item><item><title>Why do we get complex numbers in a certain expression?</title><link>/posts/2016-03-03-a-certain-limit/</link><pubDate>Thu, 03 Mar 2016 00:00:00 +0000</pubDate><guid>/posts/2016-03-03-a-certain-limit/</guid><description>Answering the question, &amp;ldquo;Why does a continued fraction containing only 1, subtraction, and division result in one of two complex numbers?&amp;rdquo;.</description></item><item><title>Friedberg-Muchnik theorem</title><link>/posts/2016-02-05-friedberg-muchnik-theorem/</link><pubDate>Fri, 05 Feb 2016 00:00:00 +0000</pubDate><guid>/posts/2016-02-05-friedberg-muchnik-theorem/</guid><description>&lt;p&gt;Another short post to point out &lt;a href="/misc/FriedbergMuchnik/FriedbergMuchnik.pdf"&gt;my new article on the Friedberg-Muchnik theorem&lt;/a&gt;, a theorem from computability theory. It uses what is known officially as a finite injury priority method, and the proof is cribbed entirely from &lt;a href="https://www.dpmms.cam.ac.uk/~tf/"&gt;Dr Thomas Forster&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Representable functors</title><link>/posts/2016-01-26-representable-functors/</link><pubDate>Tue, 26 Jan 2016 00:00:00 +0000</pubDate><guid>/posts/2016-01-26-representable-functors/</guid><description>&lt;p&gt;Just a post to draw attention to &lt;a href="/misc/RepresentableFunctors/RepresentableFunctors.pdf"&gt;my new article&lt;/a&gt; about representable functors and their links to adjoint functors.
It&amp;rsquo;s very short, but it gives a reason for being interested in representable functors: they are basically &amp;ldquo;those with left adjoints&amp;rdquo;, up to minor quibbles.&lt;/p&gt;</description></item><item><title>Multiplicative determinant</title><link>/posts/2016-01-01-multiplicative-determinant/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>/posts/2016-01-01-multiplicative-determinant/</guid><description>&lt;p&gt;I&amp;rsquo;m clearing out my desktop again, and found &lt;a href="/misc/MultiplicativeDetProof/MultiplicativeDetProof.pdf"&gt;this document on the multiplicativity of the
determinant&lt;/a&gt;, which I wrote in 2014. It might as well be up here.&lt;/p&gt;
&lt;p&gt;I should note that this document contains no motivation of any kind. It is simply an
exercise in symbol-shunting, and it has no clever ideas in it.&lt;/p&gt;</description></item><item><title>Monadicity Theorems</title><link>/posts/2015-12-31-monadicity-theorems/</link><pubDate>Thu, 31 Dec 2015 00:00:00 +0000</pubDate><guid>/posts/2015-12-31-monadicity-theorems/</guid><description>&lt;p&gt;Another short post to highlight the existence of &lt;a href="/misc/MonadicityTheorems/MonadicityTheorems.pdf"&gt;an article about the Monadicity Theorems&lt;/a&gt;, in which I prove one direction of both the Crude and Precise versions. Comments and corrections would be very much appreciated, because there is an awful lot of work involved in proving those theorems. It would be good to know of any parts where the argument is unclear, unmotivated, too long-winded, or wrong.&lt;/p&gt;</description></item><item><title>General Adjoint Functor Theorem</title><link>/posts/2015-12-24-general-adjoint-functor-theorem/</link><pubDate>Thu, 24 Dec 2015 00:00:00 +0000</pubDate><guid>/posts/2015-12-24-general-adjoint-functor-theorem/</guid><description>&lt;p&gt;Just a post to draw attention to &lt;a href="/misc/AdjointFunctorTheorems/AdjointFunctorTheorems.pdf"&gt;my new article&lt;/a&gt; about the &lt;a href="https://ncatlab.org/nlab/show/adjoint&amp;#43;functor&amp;#43;theorem"&gt;General Adjoint Functor Theorem&lt;/a&gt;.
It&amp;rsquo;s a motivation of the GAFT and its proof.
I&amp;rsquo;ve never seen it motivated in this way, and it&amp;rsquo;s actually quite a natural theorem.
I haven&amp;rsquo;t managed to motivate the Special Adjoint Functor Theorem at all, although I&amp;rsquo;m told that it&amp;rsquo;s natural if you know Stone-Cech compactification.&lt;/p&gt;</description></item><item><title>My First Forcing</title><link>/posts/2015-11-28-my-first-forcing/</link><pubDate>Sat, 28 Nov 2015 00:00:00 +0000</pubDate><guid>/posts/2015-11-28-my-first-forcing/</guid><description>In the Part III Topics in Set Theory course, we have used forcing to show the consistency of the Continuum Hypothesis, and we are about to show the consistency of its negation. I don&amp;rsquo;t really grok forcing at the moment, so I thought I would go through an example.</description></item><item><title>Eilenberg-Moore</title><link>/posts/2015-11-12-eilenberg-moore/</link><pubDate>Thu, 12 Nov 2015 00:00:00 +0000</pubDate><guid>/posts/2015-11-12-eilenberg-moore/</guid><description>As an exercise in understanding the definitions involved, I find the Eilenberg-Moore category of a certain functor.</description></item><item><title>Heyting algebras</title><link>/awodey/2015-09-30-heyting-algebras/</link><pubDate>Wed, 30 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-30-heyting-algebras/</guid><description>&lt;p&gt;Now that we&amp;rsquo;ve had the definition of an exponential, we move on to the Heyting algebra, pages 129 through 131 of Awodey. This is still in the &amp;ldquo;exponentials&amp;rdquo; chapter. I stop shortly after the definition of a Heyting algebra, so as to move on to the more general stuff which is more relevant to the Part III course.&lt;/p&gt;
&lt;p&gt;The first thing to come is the definition of an exponential \(b^a\) in a Boolean algebra \(B\) (regarded as a poset category). Without looking at the definition, I draw out a picture. We need to find \(c^b\) and \(\epsilon: c^b \times b \to c\) such that for all \(f: a \times b \to c\) there is \(\bar{f}: a \to c^b\) unique with \(\epsilon \circ (\bar{f} \times 1_b) = f\).&lt;/p&gt;</description></item><item><title>Exponentials in category theory</title><link>/awodey/2015-09-29-exponentials-in-category-theory/</link><pubDate>Tue, 29 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-29-exponentials-in-category-theory/</guid><description>&lt;p&gt;Now we come to Chapter 6 of Awodey, on exponentials, pages 119 through 128. Supposedly, this represents a kind of universal property which is not of the form &amp;ldquo;for every arrow which makes this diagram commute, that arrow factors through this one&amp;rdquo;.&lt;/p&gt;
&lt;p&gt;First, we define the currying of a function \(f: A \times B \to C\), producting a function \(f(a) : B \to C\) - that is, a function \(f(a) \in C^B\). That is, we view \(f: A \to C^B\), defining an isomorphism of homsets \(\text{Hom}&lt;em&gt;{\mathbf{Sets}}(A \times B, C)\) to \(\text{Hom}&lt;/em&gt;{\mathbf{Sets}}(A, C^B)\).&lt;/p&gt;</description></item><item><title>Limits exercises</title><link>/awodey/2015-09-29-limit-exercises/</link><pubDate>Tue, 29 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-29-limit-exercises/</guid><description>&lt;p&gt;These are located on pages 114 through 118 of Awodey.&lt;/p&gt;
&lt;p&gt;Exercise 1 follows by just drawing out the diagrams for the product and the pullback: they end up being the same diagram and the same UMP.&lt;/p&gt;
&lt;p&gt;Exercise 2 a): \(m\) is monic iff \(mx = my \Rightarrow x=y\); the diagram is a pullback iff for all \(x: A \to M\) and \(y: A \to M\) with \(m x = m y\), have \(z: A \to M\) such that \(my = mz = mz = mx\).&lt;/p&gt;</description></item><item><title>Lottery odds</title><link>/posts/2015-09-25-lottery-odds/</link><pubDate>Fri, 25 Sep 2015 00:00:00 +0000</pubDate><guid>/posts/2015-09-25-lottery-odds/</guid><description>It has been proposed to me that if one is to play the National Lottery, one should be sure to select one&amp;rsquo;s own numbers instead of allowing the machine to select them for you. This is not an optimal strategy.</description></item><item><title>Properties of categorical limits</title><link>/awodey/2015-09-23-properties-of-limits/</link><pubDate>Wed, 23 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-23-properties-of-limits/</guid><description>&lt;p&gt;We&amp;rsquo;ve seen how limits are formed, and that they exist iff products and equalisers do. Now we get to see about continuous functions and colimits, pages 105 through 114 of Awodey.&lt;/p&gt;
&lt;p&gt;The definition of a continuous functor is obvious in hindsight given the real-valued version: it &amp;ldquo;preserves all limits&amp;rdquo;, where &amp;ldquo;preserves a particular limit&amp;rdquo; means the obvious thing that limits of cones of the given shape remain limits when the functor is applied.&lt;/p&gt;</description></item><item><title>Limits and pullbacks</title><link>/awodey/2015-09-22-limits-and-pullbacks/</link><pubDate>Tue, 22 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-22-limits-and-pullbacks/</guid><description>&lt;p&gt;I&amp;rsquo;m going to skip pages 85 through 88 of Awodey for the moment, because time is starting to get short and I want to make sure I&amp;rsquo;m doing stuff which is relevant to the Part III course on category theory. Therefore, I&amp;rsquo;ll skip straight to Chapter 5, pages 89 through 95. (There&amp;rsquo;s not really a nice way to break this chapter up into small chunks, because the next many pages are on pullbacks.)&lt;/p&gt;</description></item><item><title>Limits and pullbacks 2</title><link>/awodey/2015-09-22-properties-of-pullbacks-limits/</link><pubDate>Tue, 22 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-22-properties-of-pullbacks-limits/</guid><description>&lt;p&gt;We have just had the definition of a pullback; now in Awodey pages 95 through 100 we&amp;rsquo;ll see some more about them, and after that we&amp;rsquo;ll get the more general unifying idea of the limit in pages 100 through 105.&lt;/p&gt;
&lt;p&gt;Lemma 5.8 states that a certain commuting diagram is a pullback. The proof is by &amp;ldquo;diagram chase&amp;rdquo;, and I can see why - my proof goes along the lines of gesturing several times at various parts of the diagram. Then the corollary takes me a moment to get my head around, but then I turn my head sideways and it pops out of the diagram. If you push the \(h&amp;rsquo;\) line into the page in Lemma 5.8, and rotate the diagram by ninety degrees, you end up with the diagram of Corollary 5.9; then part 2 of Lemma 5.8 is the corollary.&lt;/p&gt;</description></item><item><title>Duality exercises</title><link>/awodey/2015-09-19-duality-exercises/</link><pubDate>Sat, 19 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-19-duality-exercises/</guid><description>&lt;p&gt;Exercise 1 is easy: at the end of Chapter 2 the corresponding products statement was proved, and the obvious dual statement turns out to be this one.&lt;/p&gt;
&lt;p&gt;Exercise 2 falls out of the appropriate diagram, whose upper triangle is irrelevant.&lt;/p&gt;
&lt;p&gt;&lt;img src="/images/CategoryTheorySketches/FreeMonoidFunctorPreservesCoproducts.jpg" alt="Free monoid functor preserves coproducts"&gt;&lt;/p&gt;
&lt;p&gt;Exercise 3 I&amp;rsquo;ve &lt;a href="/awodey/2015-09-15-duality-in-category-theory/"&gt;already proved&lt;/a&gt; - search on &amp;ldquo;sleep&amp;rdquo;.&lt;/p&gt;
&lt;p&gt;Exercise 4: Let \(\pi_1: \mathbb{P}(A + B) \to \mathbb{P}(A)\) be given by \(\pi_1(S) = S \cap A\), and \(\pi_2: \mathbb{P}(A+B) \to \mathbb{P}(B)\) likewise by \(S \mapsto S \cap B\). Claim: this has the UMP of the product of \(\mathbb{P}(A)\) and \(\mathbb{P}(B)\). Indeed, if \(z_1: Z \to \mathbb{P}(A)\) and \(z_2: Z \to \mathbb{P}(B)\) are given, then \(z: Z \to \mathbb{P}(A + B)\) is specified uniquely by \(S \mapsto z_1(S) \cup z_2(S)\) (taking the disjoint union).&lt;/p&gt;</description></item><item><title>Groups in categories</title><link>/awodey/2015-09-19-groups-in-categories/</link><pubDate>Sat, 19 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-19-groups-in-categories/</guid><description>&lt;p&gt;I go into this chapter hoping that it will be on things I already know about group theory. This post will be on pages 75 through 85 of Awodey.&lt;/p&gt;
&lt;p&gt;I already know about groups over sets, but this looks like they can be made more generally over other categories. It is clear that we will need to consider only categories with finite products, because the notion of a binary operation requires us to work on pairs of elements.&lt;/p&gt;</description></item><item><title>Equalisers</title><link>/awodey/2015-09-16-equalisers/</link><pubDate>Wed, 16 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-16-equalisers/</guid><description>&lt;p&gt;This is pages 62 through 71 of Awodey, on &lt;a href="https://en.wikipedia.org/wiki/Equaliser_%28mathematics%29#In_category_theory"&gt;equalisers&lt;/a&gt; and coequalisers.&lt;/p&gt;
&lt;p&gt;The first paragraph is really quite exciting. I can see that there would be a common generalisation of kernels and varieties - they&amp;rsquo;re the same idea that lets us find complementary functions and particular integrals of linear differential equations, for instance. But the axiom of separation (&amp;ldquo;subset selection&amp;rdquo;) as well? Now that&amp;rsquo;s intriguing.&lt;/p&gt;
&lt;p&gt;We are given the definition of an equaliser: given a pair of arrows with the same domain and codomain, it&amp;rsquo;s an arrow \(e\) which may feed into that domain to make the two arrows be &amp;ldquo;the same according to \(e\)&amp;rdquo;.&lt;/p&gt;</description></item><item><title>Duality in category theory</title><link>/awodey/2015-09-15-duality-in-category-theory/</link><pubDate>Tue, 15 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-15-duality-in-category-theory/</guid><description>&lt;p&gt;I don&amp;rsquo;t have strong preconceptions about this chapter. The previous chapter I knew would contain general constructions, and I was looking forwards to that, but this one is more unfamiliar to me. I&amp;rsquo;ll be doing pages 53 through 61 of Awodey here - coproducts.&lt;/p&gt;
&lt;p&gt;The first bits are stuff I recognise from when I flicked through Categories for the Working Mathematician, I think. Or something. Anyway, I recognise the notion of formal duality and the very-closely-related semantic duality. (Like the difference between &amp;ldquo;semantic truth&amp;rdquo; and &amp;ldquo;syntactic truth&amp;rdquo; in first-order logic.) It&amp;rsquo;s probably a horrible sin to say it, but both of these are just obvious, once they&amp;rsquo;ve been pointed out.&lt;/p&gt;</description></item><item><title>Hom-sets and exercises</title><link>/awodey/2015-09-10-homsets-and-exercises/</link><pubDate>Thu, 10 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-10-homsets-and-exercises/</guid><description>&lt;p&gt;This is on pages 48 through 52 of Awodey, covering the hom-sets section and the exercises at the end of Chapter 2. Only eight more chapters after this, and I imagine they&amp;rsquo;ll be more difficult - I should probably step up the speed at which I&amp;rsquo;m doing this.&lt;/p&gt;
&lt;p&gt;Awodey assumes we are working with locally small categories - recall that such categories have &amp;ldquo;given any two objects, there is a bona fide set of all arrows between those objects&amp;rdquo;. That is, all the hom-sets are really sets.&lt;/p&gt;</description></item><item><title>Products in category theory</title><link>/awodey/2015-09-08-products-in-category-theory/</link><pubDate>Tue, 08 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-08-products-in-category-theory/</guid><description>&lt;p&gt;This is on pages 38 through 48 of Awodey. I&amp;rsquo;ve been looking forward to it, because products are things which come up all over the place and I&amp;rsquo;d heard that they are one of the main examples of a categorical idea.&lt;/p&gt;
&lt;p&gt;I skim over the definition of the product in the category of sets, and go straight to the general definition. It seems natural enough: the product is defined uniquely such that given any generalised element of the product, it projects in a unique way to corresponding elements of the children.&lt;/p&gt;</description></item><item><title>Epis and monos</title><link>/awodey/2015-09-02-epis-monos/</link><pubDate>Wed, 02 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-02-epis-monos/</guid><description>&lt;p&gt;This post is on pages 29 through 33 of Awodey. It took me a while to do this, because I was basically on holiday for the past week.&lt;/p&gt;
&lt;p&gt;The definition of a &lt;a href="https://en.wikipedia.org/wiki/Monomorphism"&gt;mono&lt;/a&gt; and an &lt;a href="https://en.wikipedia.org/wiki/Epimorphism"&gt;epi&lt;/a&gt; seems at first glance to be basically the same thing as &amp;ldquo;injection&amp;rdquo; and &amp;ldquo;surjection&amp;rdquo;. A mono is \(f: A \to B\) such that for all \(g, h: C \to A\), if \(fg = fh\) then \(g=h\). Indeed, if we take this in the category of sets, and let \(g, h: {1 } \to A\) (&amp;ldquo;picking out an element&amp;rdquo;), we precisely have the definition of &amp;ldquo;injection&amp;rdquo;. An epi is \(f: A \to B\) such that for all \(i, j:B \to D\), if \(if = jf\) then \(i=j\). Again, in the category of sets, let \(i, j: B \to {1}\); then… ah. \(if = jf\) and \(i=j\) always, because there&amp;rsquo;s only one function to the one-point set from a given set. I may have to rethink the &amp;ldquo;surjection&amp;rdquo; bit.&lt;/p&gt;</description></item><item><title>Initial, terminal, and generalised elements</title><link>/awodey/2015-09-02-initial-generalised-elements/</link><pubDate>Wed, 02 Sep 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-09-02-initial-generalised-elements/</guid><description>&lt;p&gt;This is pages 33 to 38 of Awodey.&lt;/p&gt;
&lt;p&gt;This bit looks really cool. A categorical way of expressing &amp;ldquo;this set has one element only&amp;rdquo;: a terminal object. We have more examples of UMPs - these aren&amp;rsquo;t quite of the same form as the previous ones.&lt;/p&gt;
&lt;p&gt;The proof that initial objects are unique up to unique isomorphism is easy - no need for me even to consider the diagram. On to the huge list of examples.&lt;/p&gt;</description></item><item><title>Free categories and foundations</title><link>/awodey/2015-08-21-free-categories-and-foundations/</link><pubDate>Fri, 21 Aug 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-08-21-free-categories-and-foundations/</guid><description>&lt;p&gt;Here, I will be going through the Free Categories and Foundations sections of Awodey&amp;rsquo;s Category Theory - pages 18 through 25.&lt;/p&gt;
&lt;p&gt;The definition of a free monoid is basically the same as that of a free group. However, I skim past and see the word &amp;ldquo;functor&amp;rdquo; appearing in the &amp;ldquo;no noise&amp;rdquo; statement, so I&amp;rsquo;ll actually read this section properly.
Everything is familiar up until the definition of the universal mapping property. One bit confuses me for a moment - &amp;ldquo;every monoid has an underlying set, and every monoid homomorphism an underlying function; this is a functor&amp;rdquo; - until I realise that by &amp;ldquo;this&amp;rdquo;, Awodey means &amp;ldquo;this construction&amp;rdquo; rather than &amp;ldquo;this underlying function&amp;rdquo;.&lt;/p&gt;</description></item><item><title>Proof by contradiction</title><link>/posts/2015-08-21-proof-by-contradiction/</link><pubDate>Fri, 21 Aug 2015 00:00:00 +0000</pubDate><guid>/posts/2015-08-21-proof-by-contradiction/</guid><description>Here I explain proof by contradiction so that anyone who has ever done a sudoku and seen algebra may understand it.</description></item><item><title>New categories from old</title><link>/awodey/2015-08-20-new-categories-from-old/</link><pubDate>Thu, 20 Aug 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-08-20-new-categories-from-old/</guid><description>&lt;p&gt;Here, I will be going through the Isomorphisms and Constructions sections of Awodey&amp;rsquo;s Category Theory - pages 12 through 17.&lt;/p&gt;
&lt;p&gt;The first definition here is that of an isomorphism within a category. I notice that it corresponds with the usual definition of an isomorphism, but it&amp;rsquo;s not phrased in exactly the same way. Up til now, &amp;ldquo;isomorphism&amp;rdquo; has strictly meant &amp;ldquo;bijective homomorphism&amp;rdquo;. Are these two notions secretly the same? They can&amp;rsquo;t be, because arrows aren&amp;rsquo;t necessarily homomorphisms. Let&amp;rsquo;s proceed with this slightly unfamiliar definition: it is an &amp;ldquo;arrow which is invertible on either side by the same inverse&amp;rdquo;. The book asks us to prove that inverses are unique - that&amp;rsquo;s easy by the usual group-inverses proof, which only really requires associativity.&lt;/p&gt;</description></item><item><title>Category Theory introduction</title><link>/awodey/2015-08-19-category-theory-introduction/</link><pubDate>Wed, 19 Aug 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-08-19-category-theory-introduction/</guid><description>&lt;p&gt;The next few posts will be following me on my journey through the book &lt;a href="http://ukcatalogue.oup.com/product/9780199237180.do"&gt;Category Theory&lt;/a&gt;, by Steve Awodey. I’m using the second edition, if anyone wants to join me. I will read the book and make notes here as I go along: doing the exercises (if they seem interesting enough, I’ll post them up here), coming up with my own intuition pumps, and generally writing down my thought processes. The idea is to see how a fledgling mathematician studies a text, and to record my thoughts so I can refresh my memory more easily in future.&lt;/p&gt;</description></item><item><title>Sequence on Awodey's Category Theory</title><link>/posts/2015-08-19-awodey/</link><pubDate>Wed, 19 Aug 2015 00:00:00 +0000</pubDate><guid>/posts/2015-08-19-awodey/</guid><description>&lt;p&gt;In the summer of 2015, I worked through Awodey&amp;rsquo;s &lt;a href="https://global.oup.com/ukhe/product/category-theory-9780199237180"&gt;Category Theory&lt;/a&gt;, and I produced &lt;a href="/awodey/"&gt;a large collection of posts&lt;/a&gt; as I tried to understand its contents.
These posts are probably not of much interest to anyone who is just looking for something to read, so they&amp;rsquo;re siloed off.&lt;/p&gt;</description></item><item><title>What is a Category?</title><link>/awodey/2015-08-19-what-is-a-category/</link><pubDate>Wed, 19 Aug 2015 00:00:00 +0000</pubDate><guid>/awodey/2015-08-19-what-is-a-category/</guid><description>&lt;p&gt;This post will cover the initial &amp;ldquo;examples&amp;rdquo; section of &lt;a href="http://ukcatalogue.oup.com/product/9780199237180.do"&gt;Category Theory&lt;/a&gt;. Because there aren&amp;rsquo;t really very deep concepts in this section, this is probably a less interesting post to read than the others in this series.&lt;/p&gt;
&lt;p&gt;The introduction lasts until the bottom of page 4, which is where a &lt;em&gt;category&lt;/em&gt; is defined. I read the definition in a kind of blank haze, not really taking it in, but I was reassured by the line &amp;ldquo;we will have plenty of examples very soon&amp;rdquo;. On re-reading the definition, I&amp;rsquo;ve summarised it into &amp;ldquo;objects, arrows which go from object to object, associative compositions of arrows, identity arrows which compose in the obvious way&amp;rdquo;. That&amp;rsquo;s a very general definition, as the text points out, so I&amp;rsquo;m just going to wait until the examples before trying to understand this properly.&lt;/p&gt;</description></item><item><title>Motivational learning</title><link>/posts/2015-01-29-motivational-learning/</link><pubDate>Thu, 29 Jan 2015 00:00:00 +0000</pubDate><guid>/posts/2015-01-29-motivational-learning/</guid><description>&lt;p&gt;&lt;em&gt;In which I am a wizard.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Sometimes as a student, the work piles up and I start to think &amp;ldquo;I&amp;rsquo;ll never finish this&amp;rdquo;. It becomes easy to think that there&amp;rsquo;s no point in working because the work will never be over. When that happens to me, I imagine that my course is magic/alchemy/something with flashy special effects. I&amp;rsquo;m going through the Wizardry Academy, and I&amp;rsquo;ll graduate able to manipulate the four elements. Even if I&amp;rsquo;m not the best in the year at it, I&amp;rsquo;m still able to &lt;em&gt;manipulate the elements&lt;/em&gt;, and if I work at it, I&amp;rsquo;ll be able to manipulate them better and in flashier ways - that&amp;rsquo;s not something most people can do!&lt;/p&gt;</description></item><item><title>Latin translation tips</title><link>/posts/2014-12-23-latin-translation-tips/</link><pubDate>Tue, 23 Dec 2014 00:00:00 +0000</pubDate><guid>/posts/2014-12-23-latin-translation-tips/</guid><description>&lt;p&gt;I&amp;rsquo;m clearing out my computer, and found a file which may as well be here.&lt;/p&gt;
&lt;h2 id="chunking"&gt;Chunking:&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;The first thing to do is to run through the sentence, identifying the verbs and anything that looks like it might be a verb (even in a strange form, like “passus” or “ascendere”).&lt;/li&gt;
&lt;li&gt;Run through a second time, looking for structures like “ut + subjunctive” and “non solum… sed etiam…” - if a verb you spotted is in an odd form, this is when you look quickly for why it’s in that form.&lt;/li&gt;
&lt;li&gt;Look for any subordinate clauses (like “dixit Caecilius, qui in horto laborabat…”)&lt;/li&gt;
&lt;li&gt;If you see an adjective-looking thing, it probably has to go with a noun.&lt;/li&gt;
&lt;li&gt;With that in mind, chunk the text, remembering that two verbs in the same chunk is unlikely unless one is something like “dixit” or “poterat”, which can modify another verb. Remember that chunks shouldn’t be too long, but lots of really short words together might not count against the length limit. Try reading out each chunk - rhythm takes time to learn to grasp, but it might help you.&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id="once-the-text-is-chunked"&gt;Once the text is chunked:&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;Remember that your chunking is probably wrong somewhere, but also is probably broadly right.&lt;/li&gt;
&lt;li&gt;In each chunk, if there’s a nominative and a verb then try and translate those first. Then think about what the verb “expects”; if the verb is looking for an accusative, find an accusative, while if it’s looking for a dative, find a dative. For example, “docet” = “he teaches” is looking for an accusative, while “trahet” = “he drags” is looking both for an accusative (“he drags something”) and possibly a dative (“he drags something somewhere”).&lt;/li&gt;
&lt;li&gt;If it looks like a jumble of words, identify the case of everything (in poetry, it can help if you scan the text) - this should tell you what goes with what. Don’t be too fussy about getting the right case, though - I’d be happy with “dative or ablative”, most of the time, because that’s usually clear from context - as long as you have the right case among your options!&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id="guessing-vocab"&gt;Guessing vocab:&lt;/h2&gt;
&lt;p&gt;Try and work out what the principal parts of a verb are. The English word from a given Latin one almost always comes from the past passive participle (the fourth principal part), by adding “tion” instead of “us”: “passus” -&amp;gt; “passion” [a bit misleading if you don’t know about the Passion of the Christ, because it means “suffering”], “traho” -&amp;gt; “tractus” -&amp;gt; “traction”; it actually means “drag”.
How to guess the principal parts is the kind of thing you learn with time, but as a general rule, “t” -&amp;gt; “s” (as in “patior passus”) and almost everything else goes to “ct”: “pingere pictus” from which “depiction” so “painting”, “facere factus” from which “manufaction” which isn’t really English but tells you it means “making”, etc.&lt;/p&gt;</description></item><item><title>Matrix puzzle</title><link>/posts/2014-12-19-matrix-puzzle/</link><pubDate>Fri, 19 Dec 2014 00:00:00 +0000</pubDate><guid>/posts/2014-12-19-matrix-puzzle/</guid><description>&lt;p&gt;I recently saw a problem from an Indian maths olympiad:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;There is a square arrangement made out of n elements on each side (n^2 elements total). You can put assign a value of +1 or -1 to any element. A function f is defined as the sum of the products of the elements of each row, over all rows and g is defined as the sum of the product of elements of each column, over all columns. Prove that, for n being an odd number, f(x)+g(x) can never be 0.&lt;/p&gt;</description></item><item><title>Film recommendation, Interstellar</title><link>/posts/2014-12-09-film-recommendation-interstellar/</link><pubDate>Tue, 09 Dec 2014 00:00:00 +0000</pubDate><guid>/posts/2014-12-09-film-recommendation-interstellar/</guid><description>&lt;p&gt;I’ve just come back from seeing &lt;a href="https://en.wikipedia.org/wiki/Interstellar_%28film%29"&gt;Interstellar&lt;/a&gt;, a film of peril and physics. This post will be spoiler-free except for sections which are in &lt;a href="https://rot13.com/"&gt;rot13&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;I thought the film was excellent. My previous favourite film in its genre was &lt;a href="https://en.wikipedia.org/wiki/Sunshine_%282007_film%29"&gt;Sunshine&lt;/a&gt;, but this beats it in many ways, chiefly that the physics portrayed in Interstellar - relativity, primarily - is not so wrong that it’s immediately implausible. Indeed, some physics-driven plot twists (such as &lt;em&gt;gvqny sbeprf arne n oynpx ubyr&lt;/em&gt;) I called in advance, which is a testament to how closely the film matched my physical expectations. My stomach nearly dropped out when the characters realised what relativity meant for them.&lt;/p&gt;</description></item><item><title>Christmas carols</title><link>/posts/2014-12-02-christmas-carols/</link><pubDate>Tue, 02 Dec 2014 00:00:00 +0000</pubDate><guid>/posts/2014-12-02-christmas-carols/</guid><description>&lt;p&gt;In which I provide my favourite carols and my favourite renditions of them.&lt;/p&gt;
&lt;p&gt;In no particular order, except that 1) must be at the start and 9) at the end.&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;
&lt;p&gt;&lt;a href="https://www.youtube.com/watch?v=NMGMV-fujUY"&gt;Once in Royal David&amp;rsquo;s City&lt;/a&gt;. Always opens the Festival of Nine Lessons and Carols. Has the same problem as 9) in that the only nice recordings seem to have congregations in, but I suppose that&amp;rsquo;s all part of it.&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;a href="https://www.youtube.com/watch?v=HIedUioo_Jk"&gt;The Three Kings&lt;/a&gt;. My favourite. This performance (King&amp;rsquo;s College) has a soloist who is a bit strident, I think, but all the other ones I&amp;rsquo;ve listened to are even stridenter.&lt;/p&gt;</description></item><item><title>Sum-of-two-squares theorem</title><link>/posts/2014-09-09-sum-of-two-squares-theorem/</link><pubDate>Tue, 09 Sep 2014 00:00:00 +0000</pubDate><guid>/posts/2014-09-09-sum-of-two-squares-theorem/</guid><description>&lt;p&gt;*Wherein I detail the most beautiful proof of a theorem I&amp;rsquo;ve ever seen, in a bite-size form suitable for an Anki deck.&lt;/p&gt;
&lt;h1 id="statement"&gt;Statement&lt;/h1&gt;
&lt;p&gt;There&amp;rsquo;s no particularly nice way to motivate this in this context, I&amp;rsquo;m afraid, so we&amp;rsquo;ll just dive in. I have found this method extremely hard to motivate - a few of the steps are a glorious magic.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;\(n\) is a sum of two squares iff in the prime factorisation of \(n\), primes 3 mod 4 appear only to even powers.&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="proof"&gt;Proof&lt;/h1&gt;
&lt;p&gt;We&amp;rsquo;re going to need a few background results.&lt;/p&gt;</description></item><item><title>Python, script shadowing</title><link>/posts/2014-08-26-python-script-shadowing/</link><pubDate>Tue, 26 Aug 2014 00:00:00 +0000</pubDate><guid>/posts/2014-08-26-python-script-shadowing/</guid><description>&lt;p&gt;&lt;em&gt;A very brief post about the solution to a problem I came across in Python.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;In the course of my work on &lt;a href="https://launchpad.net/ensoft-sextant"&gt;Sextant&lt;/a&gt; (specifically the project to add support for accessing a &lt;a href="https://neo4j.com"&gt;Neo4j&lt;/a&gt; instance by SSH), I ran into a problem whose nature is explained &lt;a href="http://python-notes.curiousefficiency.org/en/latest/python_concepts/import_traps.html"&gt;here&lt;/a&gt; as the Name Shadowing Trap. Essentially, in a project whose root directory contains a &lt;code&gt;bin/executable.py&lt;/code&gt; script, which is intended as a thin wrapper to the module &lt;code&gt;executable&lt;/code&gt;, you can&amp;rsquo;t &lt;code&gt;import executable&lt;/code&gt;, because the &lt;code&gt;bin/executable.py&lt;/code&gt; shadows the module &lt;code&gt;executable&lt;/code&gt;.&lt;/p&gt;</description></item><item><title>Parables, chapter 1, verses 1-10</title><link>/posts/2014-08-19-parables/</link><pubDate>Tue, 19 Aug 2014 00:00:00 +0000</pubDate><guid>/posts/2014-08-19-parables/</guid><description>&lt;p&gt;One day, a group of investors came to &lt;a href="https://en.wikipedia.org/wiki/Jeff_Bezos"&gt;Bezos&lt;/a&gt; in the Temple and begged of him, &amp;ldquo;You are known throughout the land for your wisdom. Please tell us: what lessons did you learn early in life, which we have not yet learnt?&amp;rdquo;&lt;/p&gt;
&lt;p&gt;Bezos replied thus.&lt;/p&gt;
&lt;p&gt;&amp;ldquo;When I was but a child, when I had not yet seen seven summers, I discovered that my teacher had a bountiful store of chocolates hidden in the stationery cupboard. Being of an enterprising frame of mind, I proceeded to eat one of them every day for a week.&amp;rdquo; For he was mindful of the need to preserve the source of good things.&lt;/p&gt;</description></item><item><title>Perfect pitch</title><link>/posts/2014-07-21-perfect-pitch/</link><pubDate>Mon, 21 Jul 2014 00:00:00 +0000</pubDate><guid>/posts/2014-07-21-perfect-pitch/</guid><description>&lt;p&gt;I have a limited form of &lt;a href="https://en.wikipedia.org/wiki/Perfect_pitch"&gt;perfect (absolute) pitch&lt;/a&gt;, which I am sometimes asked about. Often it&amp;rsquo;s the same questions, so here they are. No doubt people with better perfect pitch than mine will be annoyed at this impudent upstart claiming the ability, but perfect pitch comes on a spectrum anyway. Apparently some people can identify notes to within the nearest fifth of a semitone, while some can only identify the semitone closest to the note. I am a bit further towards the &amp;ldquo;tone-deaf&amp;rdquo; end of that spectrum.&lt;/p&gt;</description></item><item><title>Music practice</title><link>/posts/2014-07-19-music-practice/</link><pubDate>Sat, 19 Jul 2014 00:00:00 +0000</pubDate><guid>/posts/2014-07-19-music-practice/</guid><description>&lt;p&gt;A couple of weeks ago, someone opined to me that there was a type of person who was just able to sit down and play at the piano, without sheet music.&lt;/p&gt;
&lt;p&gt;I, myself, am capable of playing &lt;a href="https://www.youtube.com/watch?v=n4JD-3-UAzM"&gt;precisely one piece&lt;/a&gt; inexpertly, from memory, at the piano. (My rendering of that piece is &lt;em&gt;nowhere&lt;/em&gt; near the arranger&amp;rsquo;s standard.) I can play nothing else without sheet music. I very much think that this is the natural state for essentially every musician who has not spent thousands upon thousands of hours practising in a general way. That is, almost no-one can naturally sit down and play a piece from memory without a lot of work beforehand, and almost no-one can improvise well without a great deal of effort directed either at learning how to improvise, or at learning generally the mechanics of playing.&lt;/p&gt;</description></item><item><title>What maths does to the brain</title><link>/posts/2014-07-15-what-maths-does-to-the-brain/</link><pubDate>Tue, 15 Jul 2014 00:00:00 +0000</pubDate><guid>/posts/2014-07-15-what-maths-does-to-the-brain/</guid><description>&lt;p&gt;In my activities on &lt;a href="http://www.thestudentroom.co.uk"&gt;The Student Room&lt;/a&gt;, a student forum, someone (let&amp;rsquo;s call em Entity, because I like that word) recently asked me about the following question.&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Isaac places some counters onto the squares of an 8 by 8 chessboard so that there is at most one counter in each of the 64 squares. Determine, with justiﬁcation, the maximum number that he can place without having ﬁve or more counters in the same row, or in the same column, or on either of the two long diagonals.&lt;/p&gt;</description></item><item><title>Solvability of nonograms</title><link>/posts/2014-07-13-solvability-of-nonograms/</link><pubDate>Sun, 13 Jul 2014 00:00:00 +0000</pubDate><guid>/posts/2014-07-13-solvability-of-nonograms/</guid><description>&lt;p&gt;Recently, a friend re-introduced me to the joys of the &lt;a href="https://en.wikipedia.org/wiki/Nonogram"&gt;nonogram&lt;/a&gt; (variously known as &amp;ldquo;hanjie&amp;rdquo; or &amp;ldquo;griddler&amp;rdquo;). I was first shown these about ten years ago, I think, because they appeared in &lt;a href="http://www.thetimes.co.uk/tto/news/"&gt;The Times&lt;/a&gt;. When The Times stopped printing them, I forgot about them for a long time, until two years ago, or thereabouts, I tried these on &lt;a href="https://www.griddlers.net/home"&gt;a website&lt;/a&gt;. I find the process much more satisfying on paper with a pencil than on computer, so I gave them up again and forgot about them again.&lt;/p&gt;</description></item><item><title>Possible cons of Soylent</title><link>/posts/2014-06-25-possible-cons-of-Soylent/</link><pubDate>Wed, 25 Jun 2014 00:00:00 +0000</pubDate><guid>/posts/2014-06-25-possible-cons-of-Soylent/</guid><description>&lt;p&gt;I have seen many glowing reviews of &lt;a href="https://soylent.com"&gt;Soylent&lt;/a&gt;, and many vitriolic &lt;a href="https://en.wikipedia.org/wiki/Appeal_to_nature"&gt;naturalistic&lt;/a&gt; arguments against it. What I have not really seen is a proper collection of credible reasons why you might not want to try Soylent (that is, reasons which do not boil down to &amp;ldquo;it’s not natural, therefore Soylent is bad&amp;rdquo; or &amp;ldquo;food is great, therefore Soylent is bad&amp;rdquo;).&lt;/p&gt;
&lt;p&gt;This page used to contain citations in the form of links to the Soylent Discourse forum at &lt;code&gt;discourse.soylent.com&lt;/code&gt;.
However, that site is now defunct.&lt;/p&gt;</description></item><item><title>Proof that symmetric matrices are diagonalisable</title><link>/posts/2014-05-26-proof-that-symmetric-matrices-are-diagonalisable/</link><pubDate>Mon, 26 May 2014 00:00:00 +0000</pubDate><guid>/posts/2014-05-26-proof-that-symmetric-matrices-are-diagonalisable/</guid><description>&lt;p&gt;This comes up quite frequently, but I&amp;rsquo;ve been stuck for an easy memory-friendly way to do this. I trawled through the 1A Vectors and Matrices course notes, and found the following mechanical proof. (It&amp;rsquo;s not a discovery-proof - I looked it up.)&lt;/p&gt;
&lt;h2 id="lemma"&gt;Lemma&lt;/h2&gt;
&lt;p&gt;Let \(A\) be a symmetric matrix. Then any eigenvectors corresponding to different eigenvalues are orthonormal. (This is a very standard fact that is probably hammered very hard into your head if you have ever studied maths post-secondary-school.) The proof of this is of the &amp;ldquo;write it down, and you can&amp;rsquo;t help proving it&amp;rdquo; variety:&lt;/p&gt;</description></item><item><title>Discovering a proof of Sylvester's Law of Inertia</title><link>/posts/2014-05-03-discovering-a-proof-of-sylvesters-law-of-inertia/</link><pubDate>Sat, 03 May 2014 00:00:00 +0000</pubDate><guid>/posts/2014-05-03-discovering-a-proof-of-sylvesters-law-of-inertia/</guid><description>&lt;p&gt;&lt;em&gt;This is part of what has become a series on discovering some fairly basic mathematical results, and/or discovering their proofs. It&amp;rsquo;s mostly intended so that I start finding the results intuitive - having once found a proof myself, I hope to be able to reproduce it without too much effort in the exam.&lt;/em&gt;&lt;/p&gt;
&lt;h1 id="statement-of-the-theorem"&gt;Statement of the theorem&lt;/h1&gt;
&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Sylvester%27s_Law_of_Inertia" title="Sylvester&amp;#39;s law of inertia Wikipedia page"&gt;Sylvester&amp;rsquo;s Law of Inertia&lt;/a&gt; states that given a quadratic form \(A\) on a real finite-dimensional vector space \(V\), there is a diagonal matrix \(D\), with entries \(( 1_1,1_2,\dots,1_p, -1_1, -1_2, \dots, -1_q, 0,0,\dots,0 )\), to which \(A\) is congruent; moreover, \(p\) and \(q\) are the same however we transform \(A\) into this diagonal form.&lt;/p&gt;</description></item><item><title>Sequentially compact iff compact</title><link>/posts/2014-04-26-sequentially-compact-iff-compact/</link><pubDate>Sat, 26 Apr 2014 00:00:00 +0000</pubDate><guid>/posts/2014-04-26-sequentially-compact-iff-compact/</guid><description>&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Tom_K%C3%B6rner" title="Prof Körner Wikipedia page"&gt;Prof Körner&lt;/a&gt; told us during the &lt;a href="https://www.dpmms.cam.ac.uk/study/IB/MetricTopologicalSpaces/" title="Met&amp;#43;Top"&gt;IB Metric and Topological Spaces&lt;/a&gt; course that the real meat of the course (indeed, its hardest theorem) was &amp;ldquo;a metric space is sequentially compact iff it is compact&amp;rdquo;. At the moment, all I remember of this result is that one direction requires Lebesgue&amp;rsquo;s lemma (whose statement I don&amp;rsquo;t remember) and that the other direction is quite easy. I&amp;rsquo;m going to try and discover a proof - I&amp;rsquo;ll be honest when I have to look things up.&lt;/p&gt;</description></item><item><title>Cayley-Hamilton theorem</title><link>/posts/2014-04-17-cayley-hamilton-theorem/</link><pubDate>Thu, 17 Apr 2014 00:00:00 +0000</pubDate><guid>/posts/2014-04-17-cayley-hamilton-theorem/</guid><description>&lt;p&gt;This is to detail a much easier proof (at least, I find it so) of &lt;a href="https://en.wikipedia.org/wiki/Cayley-Hamilton_theorem" title="Cayley-Hamilton theorem"&gt;Cayley-Hamilton&lt;/a&gt; than the ones which appear on the Wikipedia page. It only applies in the case of complex vector spaces; most of the post is taken up with a proof of a lemma about complex matrices that is very useful in many contexts.&lt;/p&gt;
&lt;p&gt;The idea is as follows: given an arbitrary square matrix, upper-triangularise it (looking at it in basis \(B\)). Then consider how \(A-\lambda I\) acts on the vectors of \(B\); in particular, how it deals with the subspace spanned by \(b_1, \dots, b_i\).&lt;/p&gt;</description></item><item><title>Sample topology question</title><link>/posts/2014-04-15-sample-topology-question/</link><pubDate>Tue, 15 Apr 2014 00:00:00 +0000</pubDate><guid>/posts/2014-04-15-sample-topology-question/</guid><description>&lt;p&gt;As part of the recent series on how I approach maths problems, I give another one here (question 14 on the Maths Tripos IB 2007 paper 4). The question is:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Show that a compact metric space has a countable dense subset.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;This is intuitively clear if we go by our favourite examples of metric spaces (namely \(\mathbb{R}^n\), the discrete metric and the indiscrete metric). Indeed, in \(\mathbb{R}^n\), which isn&amp;rsquo;t even compact, we have the rationals (so the theorem doesn&amp;rsquo;t give a necessary condition, only a sufficient one); in the indiscrete metric, any singleton \({x }\) is dense (since the only closed non-empty set is the whole space); in the discrete metric, where every set is open, we can&amp;rsquo;t possibly be compact unless the space is finite, so that&amp;rsquo;s why the theorem doesn&amp;rsquo;t hold for a topology with so many sets.&lt;/p&gt;</description></item><item><title>Useful conformal mappings</title><link>/posts/2014-04-07-useful-conformal-mappings/</link><pubDate>Mon, 07 Apr 2014 00:00:00 +0000</pubDate><guid>/posts/2014-04-07-useful-conformal-mappings/</guid><description>&lt;p&gt;This post is to be a list of conformal mappings, so that I can get better at answering questions like &amp;ldquo;Find a conformal mapping from &amp;lt;this domain&amp;gt; to &amp;lt;this domain&amp;gt;&amp;rdquo;. The following Mathematica code is rough-and-ready, but it is designed to demonstrate where a given region goes under a given transformation.&lt;/p&gt;
&lt;pre&gt;&lt;code&gt;whereRegionGoes[f_, pred_, xrange_, yrange_] := 

whereRegionGoes[f, pred, xrange, yrange] = 
 With[{xlist = Join[{x}, xrange], ylist = Join[{y}, yrange]},
 ListPlot[
 Transpose@
 Through[{Re, Im}[
 f /@ (#[[1]] + #[[2]] I &amp;amp; /@ 
 Select[Flatten[Table[{x, y}, xlist, ylist], 1], 
 With[{z = #[[1]] + I #[[2]]}, pred[z]] &amp;amp;])]]]]
&lt;/code&gt;&lt;/pre&gt;
&lt;ul&gt;
&lt;li&gt;Möbius maps - these are of the form \(z \mapsto \dfrac{az+b}{c z+d}\). They keep circles and lines as circles and lines, so they are extremely useful when mapping a disc to a half-plane. A map is defined entirely by how it acts on any three points: there is a unique Möbius map taking any three points to any three points (and hence any circle/line to circle/line). (Some of the following are Möbius maps.)&lt;/li&gt;
&lt;li&gt;To take the unit disc to the upper half plane, \(z \mapsto \dfrac{z-i}{i z-1\)}&lt;/li&gt;
&lt;li&gt;To take the upper half plane to the unit disc, \(z \mapsto \dfrac{z-i}{z+i}\) (the &lt;a href="https://en.wikipedia.org/wiki/Cayley_transform#Conformal_map" title="Cayley transform Wikipedia page"&gt;Cayley transform&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;To rotate by 90 degrees about the origin, \(z \mapsto i \)z&lt;/li&gt;
&lt;li&gt;To translate by \(a\), \(z \mapsto a+\)z&lt;/li&gt;
&lt;li&gt;To scale by factor \(a \in \mathbb{R}\) from the origin, \(z \mapsto a \)z&lt;/li&gt;
&lt;li&gt;\(z \mapsto exp(z)\) takes a vertical strip to an annulus - but note that it is not bijective, because its domain is simply connected while its range is not.&lt;/li&gt;
&lt;li&gt;\(z \mapsto exp(z)\) takes a horizontal strip, width \(\pi\) centred on \(\mathbb{R}\) onto the right-half-plane.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="maps-which-might-not-be-conformal"&gt;Maps which might not be conformal&lt;/h2&gt;
&lt;p&gt;These maps are useful but we can only use them when the domain doesn&amp;rsquo;t include a point where \(f&amp;rsquo;(z) = 0\) (as that would stop the map from being conformal).&lt;/p&gt;</description></item><item><title>Discovering a proof of Heine-Borel</title><link>/posts/2014-04-04-discovering-a-proof-of-heine-borel/</link><pubDate>Fri, 04 Apr 2014 00:00:00 +0000</pubDate><guid>/posts/2014-04-04-discovering-a-proof-of-heine-borel/</guid><description>&lt;p&gt;I&amp;rsquo;m running through my Analysis proofs, trying to work out which ones are genuinely hard and which follow straightforwardly from my general knowledge base. I don&amp;rsquo;t find the &lt;a href="https://en.wikipedia.org/wiki/Heine-Borel_theorem" title="Heine-Borel theorem"&gt;Heine-Borel Theorem&lt;/a&gt; &amp;ldquo;easy&amp;rdquo; enough that I can even forget its statement and still prove it (like [I can with the Contraction Mapping Theorem][2]), but it turns out to be easy in the sense that it follows simply from all the theorems I already know. Here, then, is my attempt to discover a proof of the theorem, using as a guide all the results I know but can&amp;rsquo;t necessarily prove without lots of effort.&lt;/p&gt;</description></item><item><title>How to discover the Contraction Mapping Theorem</title><link>/posts/2014-03-30-how-to-discover-the-contraction-mapping-theorem/</link><pubDate>Sun, 30 Mar 2014 00:00:00 +0000</pubDate><guid>/posts/2014-03-30-how-to-discover-the-contraction-mapping-theorem/</guid><description>&lt;p&gt;A little while ago I set myself the exercise of stating and proving the &lt;a href="https://en.wikipedia.org/wiki/Contraction_mapping_theorem" title="Contraction Mapping Theorem Wikipedia page"&gt;Contraction Mapping Theorem&lt;/a&gt;. It turned out that I mis-stated it in three different aspects (&amp;ldquo;contraction&amp;rdquo;, &amp;ldquo;non-empty&amp;rdquo; and &amp;ldquo;complete&amp;rdquo;), but I was able to correct the statement because there were several points in the proof where it was very natural to do a certain thing (and where that thing turned out to rely on a correct statement of the theorem).&lt;/p&gt;</description></item><item><title>A roundup of some board games</title><link>/posts/2014-03-20-a-roundup-of-some-board-games/</link><pubDate>Thu, 20 Mar 2014 00:00:00 +0000</pubDate><guid>/posts/2014-03-20-a-roundup-of-some-board-games/</guid><description>&lt;p&gt;It has been commented to me that it&amp;rsquo;s quite hard to find out (on the Internet) what different games involve. For instance, &lt;a href="https://en.wikipedia.org/wiki/Agricola_%28board_game%29" title="Agricola Wikipedia page"&gt;Agricola&lt;/a&gt; is a game about farming (and that&amp;rsquo;s easy to find out), but what you actually do while playing it is not easy to discover. Here, then, is a brief overview of some games.&lt;/p&gt;
&lt;h1 id="agricola"&gt;Agricola&lt;/h1&gt;
&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Agricola_%28board_game%29" title="Agricola (Wikipedia page)"&gt;Agricola&lt;/a&gt; is a game in which you control a farm, and are aiming to make your farm thrive. It is a multiplayer game (for two to five) divided into turns. During each turn, you can make several actions (the number of actions you can make is determined by the number of people you have on your farm; you start out with two, and some actions increase the number of people you have). The actions are shared between all players - that is, if I make an action, you may not make that same action this turn. There is no other inter-player interaction - no attacking or anything, and you all have your own farm to manage. Your aim is to use actions to gather resources, build and extend your house, and plough fields; at the end of the game (after fourteen rounds, which is about forty minutes) everyone scores their own farm according to a set checklist, and the winner is the one who has the most prosperous farm.&lt;/p&gt;</description></item><item><title>Rage, rage against the poet’s hardest sell</title><link>/posts/2014-02-16-rage-rage-against-the-poets-hardest-sell/</link><pubDate>Sun, 16 Feb 2014 00:00:00 +0000</pubDate><guid>/posts/2014-02-16-rage-rage-against-the-poets-hardest-sell/</guid><description>&lt;p&gt;I feel that I can write a sonnet well.&lt;br&gt;
While sonnets are an easy thing to spout,&lt;br&gt;
It’s really hard to write a villanelle.&lt;/p&gt;
&lt;p&gt;By rhyming, any story I can tell:&lt;br&gt;
in couplets, rhyme and rhythm evens out.&lt;br&gt;
I feel that I can write a sonnet well.&lt;/p&gt;
&lt;p&gt;But alternately-structured verse is hell.&lt;br&gt;
The poet struggles, juggles words about:&lt;br&gt;
It’s really hard to write a villanelle.&lt;/p&gt;
&lt;p&gt;Enthusiasm’s difficult to quell.&lt;br&gt;
An acolyte of Shakespeare, I’m devout:&lt;br&gt;
I feel that I can write a sonnet well.&lt;/p&gt;</description></item><item><title>Writing essays</title><link>/posts/2014-01-28-writing-essays/</link><pubDate>Tue, 28 Jan 2014 00:00:00 +0000</pubDate><guid>/posts/2014-01-28-writing-essays/</guid><description>&lt;p&gt;The aim of this post is twofold: to find out whether a certain mental habit of mine is common, and to draw parallels between that habit and the writing of essays.&lt;/p&gt;
&lt;p&gt;I don&amp;rsquo;t know whether this is common or not, but when I&amp;rsquo;m feeling particularly not-alert (for instance, when I&amp;rsquo;m nearly asleep, or while I&amp;rsquo;m doing routine tasks like cooking), I sometimes accidentally latch onto a topic and mentally explain it to myself, as if I were teaching it to the Ancient Greeks (who, naturally, speak English). As an example, last night&amp;rsquo;s topic of discourse was &amp;ldquo;the composition of soil&amp;rdquo;, in which I &amp;ldquo;talked&amp;rdquo; about soil, in a manner roughly according to the following diagram. It is laid out so as to display roughly what occurred to me, and the order in which it occurred to me to &amp;ldquo;say&amp;rdquo; it.&lt;/p&gt;</description></item><item><title>Introduction to functional programming syntax of Mathematica</title><link>/posts/2014-01-24-introduction-to-functional-programming-syntax-of-mathematica/</link><pubDate>Fri, 24 Jan 2014 00:00:00 +0000</pubDate><guid>/posts/2014-01-24-introduction-to-functional-programming-syntax-of-mathematica/</guid><description>&lt;p&gt;Recently, I was browsing the &lt;a href="http://community.wolfram.com"&gt;Wolfram Community&lt;/a&gt; forum, and I came across the following question:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;What are the symbols @, #, / in Mathematica?&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;I remember that grasping the basics of functional programming took me quite a lot of mental effort (well worth it, I think!) so here is my attempt at a guide to the process.&lt;/p&gt;
&lt;p&gt;In Mathematica, there are only two things you can work with: the Symbol and the Atom. There is only one way to combine these things: you can provide them as arguments to each other. We denote &amp;ldquo;\(x\) with arguments \(y\) and \(z\)&amp;rdquo; by &amp;ldquo;&lt;code&gt;x[y,z]&lt;/code&gt;&amp;rdquo;.&lt;/p&gt;</description></item><item><title>Denouement of Myst III: Exile</title><link>/posts/2014-01-12-denouement-of-myst-iii-exile/</link><pubDate>Sun, 12 Jan 2014 00:00:00 +0000</pubDate><guid>/posts/2014-01-12-denouement-of-myst-iii-exile/</guid><description>&lt;p&gt;A long time ago, in a galaxy far far away, I completed &lt;a href="https://en.wikipedia.org/wiki/Myst_III:_Exile" title="Myst III: Exile Wikipedia page"&gt;Myst III: Exile&lt;/a&gt;. It&amp;rsquo;s a stupendously good puzzle game. For some reason, it popped into my mind again a couple of days ago. This post contains very hefty spoilers for that game (it will completely ruin the ending - I will be discussing information-exchange protocols which are key to completing it), so if you&amp;rsquo;re ever going to play it, don&amp;rsquo;t read this post yet. It&amp;rsquo;s a brilliant game - I highly recommend it.&lt;/p&gt;</description></item><item><title>The Creation</title><link>/posts/2014-01-02-the-creation/</link><pubDate>Thu, 02 Jan 2014 00:00:00 +0000</pubDate><guid>/posts/2014-01-02-the-creation/</guid><description>&lt;p&gt;Once upon a time, before this bountiful age of Matter and Light, there was only the Fell. A single being, surrounded by Chaos, content to remain alone forever (for it did not know what a &amp;ldquo;friend&amp;rdquo; was). It had not the power to shape the Chaos; neither had it the inclination, for it needed nothing and had no desires. For seething unchanging aeons, it persisted.&lt;/p&gt;
&lt;p&gt;Then Chaos bore new fruit. A single electron, a point source of &lt;em&gt;charge&lt;/em&gt;. The &lt;em&gt;electric field&lt;/em&gt; thereby induced resonated throughout all of Chaos, propagating yet further, every second by the same amount; and so the Fell recognised &lt;em&gt;distance&lt;/em&gt;. The Fell experienced &lt;em&gt;curiosity&lt;/em&gt; then: for an electromagnetic field was entirely a novel sensation to it. The place it inhabited was changed, from isotropic to merely &lt;em&gt;spherically symmetric&lt;/em&gt;: now the Fell identified &lt;em&gt;direction&lt;/em&gt;. It began to &lt;em&gt;move towards&lt;/em&gt; the point charge, first &lt;em&gt;slowly&lt;/em&gt;, and then &lt;em&gt;faster&lt;/em&gt;, until its &lt;em&gt;velocity&lt;/em&gt; approached that of the electric field itself. All this was for to discover the nature of the descendant of Chaos.&lt;/p&gt;</description></item><item><title>Smartphone Charter</title><link>/posts/2013-12-30-smartphone-charter/</link><pubDate>Mon, 30 Dec 2013 00:00:00 +0000</pubDate><guid>/posts/2013-12-30-smartphone-charter/</guid><description>&lt;p&gt;I am shortly to receive a new &lt;a href="https://en.wikipedia.org/wiki/Nexus_5" title="Nexus 5 Wikipedia page"&gt;Nexus 5&lt;/a&gt;. I am determined not to become a smartphone zombie, and so I hereby commit to the following Charter.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;I will keep my phone free of social networking apps, and I will ensure that I do not know the passwords to access their web interfaces. While they can be really quite handy, they are usually simply a distraction. People are used to the fact that I am present on the Internet only when I have my computer with me; there&amp;rsquo;s no need for that to change.&lt;/li&gt;
&lt;li&gt;I will only look at text messages when I&amp;rsquo;m not talking to someone already.&lt;/li&gt;
&lt;li&gt;I will never look at &lt;a href="http://www.reddit.com/" title="reddit"&gt;reddit&lt;/a&gt; or &lt;a href="https://news.ycombinator.com" title="Hacker News"&gt;Hacker News&lt;/a&gt; or suchlike on my phone, unless there is no-one else around. Similarly, I will not access my news feeds from my phone. It&amp;rsquo;s far too easy to waste time and attention on them, when such attention is expected from the people I&amp;rsquo;m with.&lt;/li&gt;
&lt;li&gt;If I am doing something on my phone, and someone asks me to stop, I will do one of the following (with number 1 being heavily preferred, and number 3 only in emergency):
&lt;ol&gt;
&lt;li&gt;I will stop using my phone within ten seconds&lt;/li&gt;
&lt;li&gt;I will explain what I am doing, and ask permission to continue&lt;/li&gt;
&lt;li&gt;I will explain what I am doing (or say that an explanation will be forthcoming as soon as possible), and continue.&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;li&gt;I will keep my phone out of reach of my bed when I go to sleep. It&amp;rsquo;s easy to become lost in the Internet, especially when you&amp;rsquo;re tired and not really concentrating.&lt;/li&gt;
&lt;li&gt;I will be able to access emails on my phone, but I will set it up so that it only checks manually.&lt;/li&gt;
&lt;li&gt;I will not install games on my phone. It&amp;rsquo;s not there as &amp;ldquo;something to keep me entertained when I&amp;rsquo;m bored&amp;rdquo; but as &amp;ldquo;something to be useful when needed&amp;rdquo;, and in my experience, games seem to intrude.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;If I break any of these, you&amp;rsquo;re allowed to get annoyed with me. (The converse is false in general.)&lt;/p&gt;</description></item><item><title>Three explanations of the Monty Hall Problem</title><link>/posts/2013-12-22-three-explanations-of-the-monty-hall-problem/</link><pubDate>Sun, 22 Dec 2013 00:00:00 +0000</pubDate><guid>/posts/2013-12-22-three-explanations-of-the-monty-hall-problem/</guid><description>&lt;p&gt;Earlier today, I had a rather depressing conversation with several people, in which it was revealed to me that many people will attempt to argue against the dictates of mathematical and empirical fact in the instance of the &lt;a href="https://en.wikipedia.org/wiki/Monty_hall_problem" title="Monty Hall problem Wikipedia page"&gt;Monty Hall Problem&lt;/a&gt;. I present a version of the problem which is slightly simpler than the usual statement (I have replaced goats with empty rooms).&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Monty Hall is a game show presenter. He shows you three doors; behind one of the three is a car, and the other two hide empty rooms. You have a free choice: you pick one of the doors. Monty Hall then opens a door which you did not pick, which he knows is an empty-room door. Then he gives you the choice: out of the two doors remaining, you may switch your choice to the other door, or stick with the one you first picked. You will get whatever is behind the door you end up with. You want to pick the car; do you stick with your first choice, or do you switch to the other door?&lt;/p&gt;</description></item><item><title>The Training Game</title><link>/posts/2013-12-14-the-training-game/</link><pubDate>Sat, 14 Dec 2013 00:00:00 +0000</pubDate><guid>/posts/2013-12-14-the-training-game/</guid><description>&lt;p&gt;The book Don&amp;rsquo;t Shoot the Dog, by Karen Pryor, contains a simple exercise in demonstrating &lt;a href="https://en.wikipedia.org/wiki/Clicker_training" title="Clicker training Wikipedia page"&gt;clicker training&lt;/a&gt;. This is a very successful technique used to produce behaviour in animals: having first associated the sound of a click with the reward of attention or food, one can then use the click as an immediate substitute for the reward (so that one can train more complicated, time-critical actions through positive reinforcement; a click is instant, but food or attention requires the trainer approaching the trainee). The demonstration exercise involves a person designated the Trainer, and a person designated the Trainee. The trainer has a goal in mind, but cannot communicate that goal to the trainee; the only interaction allowed is a click when the trainee is doing something vaguely correct. As an example, the trainee can be made to move towards a light switch by dint of a click when ey is pointing towards the switch, then a click when ey moves in that direction (ignoring any attempts to move in a different direction); the trainer then draws attention to the general area of the light by clicking whenever the trainee looks in the right direction, and then for any hand movement, then for hand movement in the direction of the light switch. This kind of incremental reinforcement can be used to achieve all sorts of interesting behaviour. (I seem to remember, from Don&amp;rsquo;t Shoot the Dog, that it has been used in chickens to make them do hundred-step dances, although I may have mis-remembered that.)&lt;/p&gt;</description></item><item><title>The Jean-Paul Sartre Cookbook</title><link>/posts/2013-11-23-the-jean-paul-sartre-cookbook/</link><pubDate>Sat, 23 Nov 2013 00:00:00 +0000</pubDate><guid>/posts/2013-11-23-the-jean-paul-sartre-cookbook/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Many thanks to the &lt;a href="http://web.archive.org/web/20201113203936/https://www.dpmms.cam.ac.uk/~piers/" title="Guru Piers Bursill-Hall"&gt;Guru Bursill-Hall&lt;/a&gt; for bringing this tract to my attention through his weekly History of Maths bulletins. It was originally written in 1987 by Marty Smith, according to the Internet.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;h1 id="the-jean-paul-sartre-cookbook"&gt;The Jean-Paul Sartre Cookbook&lt;/h1&gt;
&lt;p&gt;&lt;strong&gt;October 3.&lt;/strong&gt;   Spoke with Camus today about my cookbook. Though he has never actually eaten, he gave me much encouragement. I rushed home immediately to begin work. How excited I am! I have begun my formula for a Denver omelet.&lt;/p&gt;</description></item><item><title>Markov Chain card trick</title><link>/posts/2013-11-12-markov-chain-card-trick/</link><pubDate>Tue, 12 Nov 2013 00:00:00 +0000</pubDate><guid>/posts/2013-11-12-markov-chain-card-trick/</guid><description>&lt;p&gt;In my latest lecture on &lt;a href="http://www.statslab.cam.ac.uk/~grg/teaching/markovc.html" title="Markov Chains course page"&gt;Markov Chains&lt;/a&gt; in Part IB of the Mathematical Tripos, our lecturer showed us a very nice little application of the theorem that &amp;ldquo;if a discrete-time chain is aperiodic, irreducible and positive-recurrent, then there is an invariant distribution to which the chain tends as time increases&amp;rdquo;. In particular, let \(X\) be a Markov chain on a state space consisting of &amp;ldquo;the value of a card revealed from a deck of cards&amp;rdquo;, where aces count 1 and picture cards count 10. Let \(P\) be randomly chosen from the range \(1 \dots 5\), and let \(X_0 = P\). Proceed as follows: define \(X_n\) as &amp;ldquo;the value of the \(\sum_{i=0}^{n-1} X_i\)-th card&amp;rdquo;. Stop when the newest \(X_n\) would be greater than \(52\).&lt;/p&gt;</description></item><item><title>My quest for a new phone</title><link>/posts/2013-11-07-my-quest-for-a-new-phone/</link><pubDate>Thu, 07 Nov 2013 00:00:00 +0000</pubDate><guid>/posts/2013-11-07-my-quest-for-a-new-phone/</guid><description>&lt;p&gt;&lt;em&gt;This post is unfinished, and may never be finished - I have decided that the Nexus 5 is sufficiently cheap, nice-looking and future-proof to outweigh the boredom of continuing the research here, especially given that such research by necessity has a very short lifespan. I am one of those people who hates shopping with a fiery passion.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;My current phone is a five-year-old &lt;a href="https://en.wikipedia.org/wiki/Nokia_1680_classic" title="Nokia 1680 Wikipedia page"&gt;Nokia 1680&lt;/a&gt;. It has recently developed a disturbing tendency to turn off when I&amp;rsquo;m not watching it.
This puts me in the market for a new phone. Having looked over the Internet for guides to which phone to buy, I&amp;rsquo;ve become lost in the swamp of information, so I am using this post to order my thoughts.&lt;/p&gt;</description></item><item><title>How to do Analysis questions</title><link>/posts/2013-10-24-how-to-do-analysis-questions/</link><pubDate>Thu, 24 Oct 2013 00:00:00 +0000</pubDate><guid>/posts/2013-10-24-how-to-do-analysis-questions/</guid><description>&lt;p&gt;This post is for posterity, made shortly after &lt;a href="https://www.dpmms.cam.ac.uk/~par31" title="Paul Russell"&gt;Dr Paul Russell&lt;/a&gt; lectured Analysis II in Part IB of the Maths Tripos at Cambridge. In particular, he demonstrated a way of doing certain basic questions. It may be useful to people who are only just starting the study of analysis and/or who are doing example sheets in it.&lt;/p&gt;
&lt;p&gt;The first example sheet of an Analysis course will usually be full of questions designed to get you up and running with the basic definitions. For instance, one question from the first example sheet of Analysis II this year is as follows:&lt;/p&gt;</description></item><item><title>The Ravenous</title><link>/posts/2013-10-20-the-ravenous/</link><pubDate>Sun, 20 Oct 2013 00:00:00 +0000</pubDate><guid>/posts/2013-10-20-the-ravenous/</guid><description>&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/The_Raven" title="The Raven Wikipedia page"&gt;Once upon a midnight dreary&lt;/a&gt;, while I pondered, weak and weary,&lt;br&gt;
I required a snack to feed me. Reaching in the kitchen drawer -&lt;br&gt;
With the scissors, cut the wrapping, I revealed a jar of tapen-&lt;br&gt;
Ade of olives. Gently snapping, snapping off the lid, I saw:&lt;br&gt;
Lines of mouldy olive scored the tapenade. The lid I saw&lt;br&gt;
Speckled with each mocking spore.&lt;/p&gt;
&lt;p&gt;How the pangs of hunger rumbled while I cursed the jar I&amp;rsquo;d fumbled;&lt;br&gt;
Indistinct, I faintly mumbled, &amp;ldquo;May this torture last no more!&amp;rdquo;&lt;br&gt;
Suddenly I saw the bread bin; eagerly towards it edging,&lt;br&gt;
Bravely to my stomach pledging, pledging food would be in store.&lt;br&gt;
Opening that sacred vessel, only crumbs were left in store.&lt;br&gt;
Savagely the bag I tore.&lt;/p&gt;</description></item><item><title>Training away mental bias</title><link>/posts/2013-10-13-training-away-mental-bias/</link><pubDate>Sun, 13 Oct 2013 00:00:00 +0000</pubDate><guid>/posts/2013-10-13-training-away-mental-bias/</guid><description>&lt;p&gt;&lt;em&gt;In which I recount an experiment I have been performing. Please be aware that in this article I am in &amp;ldquo;[meaning what I say][1]&amp;rdquo; mode.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;For the past year or so, I have been consciously trying to identify and counteract places in the &amp;ldquo;natural&amp;rdquo;, everyday use of language in which gender bias is implicitly assumed to be correct. The kind of thing I mean is:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;A: I called the plumber.&lt;/p&gt;</description></item><item><title>Meaning what you say</title><link>/posts/2013-10-11-meaning-what-you-say/</link><pubDate>Fri, 11 Oct 2013 00:00:00 +0000</pubDate><guid>/posts/2013-10-11-meaning-what-you-say/</guid><description>&lt;p&gt;In conversation with (say, for the purposes of propagating a sterotype) humanities students, I am often struck by how imprecisely language is used, and how much confusion arises therefrom. A case in point:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;A: I think that froogles should be sprogged!&lt;/p&gt;
&lt;p&gt;B: Sprogging froogles would make the bimmers go plog.&lt;/p&gt;
&lt;p&gt;A: But I use froogles all the time - I don&amp;rsquo;t care about the bimmers! Why are you so caught up on the plogging of bimmers?&lt;/p&gt;</description></item><item><title>Plot Armour</title><link>/posts/2013-10-10-plot-armour/</link><pubDate>Thu, 10 Oct 2013 00:00:00 +0000</pubDate><guid>/posts/2013-10-10-plot-armour/</guid><description>&lt;p&gt;&lt;em&gt;Wherein I dabble in parodic fiction. The title refers to the TV Tropes page on &lt;a href="http://tvtropes.org/pmwiki/pmwiki.php/Main/PlotArmor"&gt;Plot Armour&lt;/a&gt;, but don&amp;rsquo;t follow that link unless you first resolve not to click on any links on that page. TV Tropes is the hardest extant website from which to escape.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Jim, third-in-command of the Watchers, ducked behind the Warlord&amp;rsquo;s force-field, desperately trying to catch his breath in the face of an inexorable onslaught. His attackers, the hundred-strong members of the Hourglass Collective, had never been defeated in pitched battle. As testament to their ability, two thousand of the finest troops the Watchers had to offer stood motionless around him, suspended in time; even now, even with five of the most experienced Watchers still fighting, the Hourglass forces were calmly and efficiently slitting the throats of the frozen soldiers. Skilled in cultivating terror, they were working in from afar, and it looked to Jim as though he would have to endure another half-hour of helplessness before they got to him at last. Jim and the Warlord had only survived this far by virtue of an accidental and uncontrollable burst of power from the Founder of the Watchers, released at a fortuitous moment to counter the time-suspension channelled by the Hourglass. That had given the Warlord time to protect five people, before the Founder had collapsed.&lt;/p&gt;</description></item><item><title>How to prove that you are a god</title><link>/posts/2013-09-21-how-to-prove-that-you-are-a-god/</link><pubDate>Sat, 21 Sep 2013 00:00:00 +0000</pubDate><guid>/posts/2013-09-21-how-to-prove-that-you-are-a-god/</guid><description>&lt;p&gt;I came across an interesting question while reading the blog of &lt;a href="http://www.scottaaronson.com"&gt;Scott Aaronson&lt;/a&gt; today. The question was as follows:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;In the world of the colour-blind, how could I prove that I could see colour?&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;I&amp;rsquo;m presuming, to make the discussion more life-like and less cheaty, that this civilisation hasn&amp;rsquo;t discovered that light comes in wavelengths, or that it has but it can&amp;rsquo;t distinguish very well between wavelengths (so that all coloured light falls into the same bucket of 100nm to 1000nm, for instance). The challenge is to design an experimental protocol to confirm or deny that I have access to information that the colour-blind do not. This question is much harder than the corresponding question in the world of the blind, because having vision tells you so much more than having colour vision (simply set up a flag two miles away, have someone raise it at a random time, note down the time you saw it raised, and compare notes).&lt;/p&gt;</description></item><item><title>Stumbled across 14th September 2013</title><link>/posts/2013-09-13-stumbled-across-14th-september-2013/</link><pubDate>Fri, 13 Sep 2013 00:00:00 +0000</pubDate><guid>/posts/2013-09-13-stumbled-across-14th-september-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;
&lt;p&gt;On the merits of silence (I wholeheartedly agree): &lt;a href="http://www.nytimes.com/2013/08/25/opinion/sunday/im-thinking-please-be-quiet.html"&gt;http://www.nytimes.com/2013/08/25/opinion/sunday/im-thinking-please-be-quiet.html&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Given the previous results on humans&amp;rsquo; sense of physical location, I&amp;rsquo;m not particularly surprised that you can make yourself identify your body as being somewhere other than where it really is: &lt;a href="http://www.psychologicalscience.org/index.php/news/releases/visualized-heartbeat-can-trigger-out-of-body-experience.html"&gt;http://www.psychologicalscience.org/index.php/news/releases/visualized-heartbeat-can-trigger-out-of-body-experience.html&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Aaand the future arrives: &lt;a href="http://www.washington.edu/news/2013/08/27/researcher-controls-colleagues-motions-in-1st-human-brain-to-brain-interface"&gt;http://www.washington.edu/news/2013/08/27/researcher-controls-colleagues-motions-in-1st-human-brain-to-brain-interface&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Another reason why Finland is amazing: &lt;a href="http://web.archive.org/web/20150302131427/http://neomam.com/blog/there-is-no-homework-in-finland"&gt;http://web.archive.org/web/20150302131427/http://neomam.com/blog/there-is-no-homework-in-finland&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;A thought-provoking story: &lt;a href="http://web.archive.org/web/20010802144026/http://www.tor.com/72ltrs.html"&gt;WebCite version&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;On the &amp;ldquo;mundane magics&amp;rdquo; kind of lines: &lt;a href="http://i.imgur.com/hINj1xf.png"&gt;http://i.imgur.com/hINj1xf.png&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Not sure what to make of this - I actually can&amp;rsquo;t remember who narrated Paddington in the audio-books of my youth: &lt;a href="http://www.bbc.co.uk/news/entertainment-arts-24077834"&gt;http://www.bbc.co.uk/news/entertainment-arts-24077834&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Slightly silly Sylow pseudo-sonnets</title><link>/posts/2013-08-31-slightly-silly-sylow-pseudo-sonnets/</link><pubDate>Sat, 31 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-31-slightly-silly-sylow-pseudo-sonnets/</guid><description>&lt;p&gt;This is a collection of poems which together prove the &lt;a href="/posts/2013-06-26-sylow-theorems/"&gt;Sylow theorems&lt;/a&gt;.&lt;/p&gt;
&lt;h1 id="notes-on-pronunciation"&gt;Notes on pronunciation&lt;/h1&gt;
&lt;ul&gt;
&lt;li&gt;Pronounce \( \vert P \vert \) as &amp;ldquo;mod P&amp;rdquo;, \(a/b\) or \(\dfrac{a}{b}\) as &amp;ldquo;a on b&amp;rdquo;, and \(=\) as &amp;ldquo;equals&amp;rdquo;.&lt;/li&gt;
&lt;li&gt;\(a^b\) for positive integer \(b\) is pronounced &amp;ldquo;a to the b&amp;rdquo;.&lt;/li&gt;
&lt;li&gt;\(g^{-1}\) is pronounced &amp;ldquo;gee inverse&amp;rdquo;.&lt;/li&gt;
&lt;li&gt;&amp;ldquo;Sylow&amp;rdquo; is pronounced &amp;ldquo;see-lov&amp;rdquo;, for the purposes of these poems.&lt;/li&gt;
&lt;li&gt;\(p\) and \(P\) and \(n_p\) are different entities, so they&amp;rsquo;re allowed to rhyme.&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="monorhymic-motivation"&gt;&lt;a href="https://en.wikipedia.org/wiki/Monorhyme"&gt;Monorhymic&lt;/a&gt; Motivation &lt;sup id="fnref:1"&gt;&lt;a href="#fn:1" class="footnote-ref" role="doc-noteref"&gt;1&lt;/a&gt;&lt;/sup&gt;&lt;/h1&gt;
&lt;p&gt;Suppose we have a finite group called \(G\).&lt;br&gt;
This group has size \(m\) times a power of \(p\).&lt;br&gt;
We choose \(m\) to have coprimality:&lt;br&gt;
the power of \(p\)&amp;rsquo;s the biggest we can see.&lt;br&gt;
Then One: a subgroup of that size do we&lt;br&gt;
assert exists. And Two: such subgroups be&lt;br&gt;
all conjugate. And \(m\)&amp;rsquo;s nought mod \(n_p\),&lt;br&gt;
while \(n_p = 1 \pmod{p}\); that&amp;rsquo;s Three.&lt;/p&gt;</description></item><item><title>Topology made simple</title><link>/posts/2013-08-26-topology-made-simple/</link><pubDate>Mon, 26 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-26-topology-made-simple/</guid><description>&lt;p&gt;I&amp;rsquo;ve been learning some basic &lt;a href="https://en.wikipedia.org/wiki/Topology" title="Topology Wikipedia page"&gt;topology&lt;/a&gt; over the last couple of months, and it strikes me that there are some &lt;em&gt;very&lt;/em&gt; confusing names for things. Here I present an approach that hopefully avoids confusing terminology.&lt;/p&gt;
&lt;p&gt;We define a &lt;strong&gt;topology&lt;/strong&gt; \(\tau\) on a set \(X\) to be a collection of sets such that: for every pair of sets \(x,y \in \tau\), we have that \(x \cap y \in \tau\); \(\phi\) the empty set and \(X\) are both in \(\tau\); for every \(x \in \tau\) we have that \(x \subset X\); and that \(\displaystyle \cup_{\alpha} x_{\alpha}\) is in \(\tau\) if all the \(x_{\alpha}\) are in \(\tau\). (That is: \(\tau\) contains the empty set and the entire set; sets in \(\tau\) are subsets of \(X\); not-necessarily-countable unions of sets in \(\tau\) are in \(\tau\); and finite intersections of sets in \(\tau\) are in \(\tau\).) We then say that \((X, \tau)\) is a &lt;strong&gt;topological space&lt;/strong&gt;.&lt;/p&gt;</description></item><item><title>Stumbled across 24th August 2013</title><link>/posts/2013-08-24-stumbled-across-24-august-2013/</link><pubDate>Sat, 24 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-24-stumbled-across-24-august-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;The much-vaunted Hyperloop looks really cool, if it could ever be built: &lt;a href="https://arstechnica.com/business/2013/08/hyperloop-a-theoretical-760-mph-transit-system-made-of-sun-air-and-magnets/"&gt;https://arstechnica.com/business/2013/08/hyperloop-a-theoretical-760-mph-transit-system-made-of-sun-air-and-magnets/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;But it may be a bit too half-baked: &lt;a href="https://pedestrianobservations.com/2013/08/13/loopy-ideas-are-fine-if-youre-an-entrepreneur/"&gt;https://pedestrianobservations.com/2013/08/13/loopy-ideas-are-fine-if-youre-an-entrepreneur/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I love a good visualisation: &lt;a href="http://nickolaylamm.com/art-for-clients/what-if-you-could-see-wifi/"&gt;http://nickolaylamm.com/art-for-clients/what-if-you-could-see-wifi/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I laughed pretty much constantly through this piece of bureaucracy-hacking: &lt;a href="http://www.slate.com/articles/life/culturebox/2013/08/the_kindly_brontosaurus_the_amazing_prehistoric_posture_that_will_get_you.html"&gt;http://www.slate.com/articles/life/culturebox/2013/08/the_kindly_brontosaurus_the_amazing_prehistoric_posture_that_will_get_you.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;This is a problem with the Internet of Things as well as with mind-computer interfaces: &lt;a href="http://www.extremetech.com/extreme/134682-hackers-backdoor-the-human-brain-successfully-extract-sensitive-data"&gt;http://www.extremetech.com/extreme/134682-hackers-backdoor-the-human-brain-successfully-extract-sensitive-data&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Wow - it&amp;rsquo;s possible to represent words as vectors so that &lt;em&gt;vector(&amp;lsquo;Paris&amp;rsquo;) - vector(&amp;lsquo;France&amp;rsquo;) + vector(&amp;lsquo;Italy&amp;rsquo;)&lt;/em&gt; results in a vector that is very close to &lt;em&gt;vector(&amp;lsquo;Rome&amp;rsquo;)&lt;/em&gt;: &lt;a href="https://code.google.com/p/word2vec/"&gt;https://code.google.com/p/word2vec/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Let there be food: &lt;a href="http://web.archive.org/web/20150219023941/http://thisiswhyyourefat.kinja.com/cadbury-creme-eggs-benedict-230182670"&gt;http://web.archive.org/web/20150219023941/http://thisiswhyyourefat.kinja.com/cadbury-creme-eggs-benedict-230182670&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;One of the manifold reasons why the USA&amp;rsquo;s &lt;a href="https://en.wikipedia.org/wiki/Transportation_Security_Administration" title="TSA Wikipedia page"&gt;TSA&lt;/a&gt; should be scrapped: &lt;a href="https://varnull.adityamukerjee.net/2013/08/22/dont-fly-during-ramadan"&gt;https://varnull.adityamukerjee.net/2013/08/22/dont-fly-during-ramadan&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;An excellent witty dialogue between some experts in their respective fields: &lt;a href="http://mathwithbaddrawings.com/2013/08/21/five-math-experts-split-the-check/"&gt;http://mathwithbaddrawings.com/2013/08/21/five-math-experts-split-the-check/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;How to disagree correctly: &lt;a href="http://www.paulgraham.com/disagree.html"&gt;http://www.paulgraham.com/disagree.html&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>How to punt in Cambridge</title><link>/posts/2013-08-22-how-to-punt-in-cambridge/</link><pubDate>Thu, 22 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-22-how-to-punt-in-cambridge/</guid><description>&lt;p&gt;&lt;a href="https://en.wiktionary.org/wiki/when_in_Rome,_do_as_the_Romans_do" title="When in Rome…"&gt;When in Cambridge&lt;/a&gt;…&lt;/p&gt;
&lt;p&gt;The river is always full of beginners and professional puntists. The beginners veer all over the place, getting very wet, while the professionals zip between them, somehow managing to avoid collision by the width of an otter&amp;rsquo;s hair. The worst attempt by a beginner I&amp;rsquo;ve ever seen at punting was an attempt to use the pole rather like an oar, without ever touching the bottom of the river with it. This patent perplexity pertaining to the point of the punt provoked a pertinent post.&lt;/p&gt;</description></item><item><title>My experiences with flow</title><link>/posts/2013-08-21-my-experiences-with-flow/</link><pubDate>Wed, 21 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-21-my-experiences-with-flow/</guid><description>&lt;p&gt;I&amp;rsquo;m in the middle of reading &lt;a href="https://en.wikipedia.org/wiki/Flow_%28psychology%29"&gt;Flow&lt;/a&gt;, by &lt;a href="https://en.wikipedia.org/wiki/Mihaly_Csikszentmihalyi" title="Mihaly Csikszentmihalyi"&gt;Mihály Csíkszentmihályi&lt;/a&gt;, and so far, I love it. It describes the &amp;ldquo;&lt;a href="https://en.wikipedia.org/wiki/Flow_%28psychology%29"&gt;flow state&lt;/a&gt;&amp;rdquo; of consciousness, that state of &amp;ldquo;everything is irrelevant except for the task at hand&amp;rdquo; in which time flies past without your noticing, and you don&amp;rsquo;t notice hunger or thirst or people moving around you. Flow can be induced when performing a difficult task which lies within your abilities, where immediate feedback is provided. I, at least, feel characteristically exhausted after coming out of a long period of flow - but it&amp;rsquo;s a good kind of mental exhaustion, much as the tiredness after a long swim is a good kind of physical exhaustion (in contrast to tiredness-after-a-long-day-of-doing-nothing, which feels sort of lazier and unwholesome). The Wikipedia page is a good enough explanation of flow that I will not describe it further here.&lt;/p&gt;</description></item><item><title>Thinking styles</title><link>/posts/2013-08-18-thinking-styles/</link><pubDate>Sun, 18 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-18-thinking-styles/</guid><description>&lt;p&gt;All the way back into primary school (ages 4 to 11 years old, in case a non-Brit is reading this), we have been told repeatedly that &amp;ldquo;people learn things in different ways&amp;rdquo;. There were two years in primary school when I had a teacher who was very into &lt;a href="https://en.wikipedia.org/wiki/Six_Thinking_Hats"&gt;Six Thinking Hats&lt;/a&gt; (leading to the worst outbreak of headlice I&amp;rsquo;ve ever encountered) and &lt;a href="https://en.wikipedia.org/wiki/Mind_map"&gt;mind maps&lt;/a&gt;. I never understood mind maps, and whenever we were told to create a mind map, I&amp;rsquo;d make mine as linear and boxy as possible, out of simple frustration with the pointless task of making a picture of something that I already had perfectly well-set-out in my mind. I quickly learnt to correlate &amp;ldquo;making a mind map&amp;rdquo; with &amp;ldquo;being slow and inefficient at thinking&amp;rdquo;. (This was back when my memory was still exceptionally good, so I wasn&amp;rsquo;t really learning much at school - having read, and therefore memorised, a good children&amp;rsquo;s encyclopaedia was enough for me - and hence relative to me, pretty much everyone else was slow and inefficient, because I&amp;rsquo;d already learnt the material.)&lt;/p&gt;</description></item><item><title>Stumbled across 11th August 2013</title><link>/posts/2013-08-11-stumbled-across-11th-august-2013/</link><pubDate>Sun, 11 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-11-stumbled-across-11th-august-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;A thousand times this (EDIT 2022: the link is dead and I have no idea what I was referring to).&lt;/li&gt;
&lt;li&gt;A possible fix for the &amp;ldquo;&lt;a href="https://en.wikipedia.org/wiki/Criticism_of_democracy#Economic_criticisms"&gt;economic problem&lt;/a&gt; of democracy&amp;rdquo;: &lt;a href="https://mason.gmu.edu/~rhanson/futarchy.html"&gt;https://mason.gmu.edu/~rhanson/futarchy.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A fascinating look at privacy online, how we&amp;rsquo;re not built for privacy, and how tribal cultures attain privacy: &lt;a href="https://aeon.co/essays/facebook-s-privacy-settings-aren-t-the-problem-ours-are/"&gt;https://aeon.co/essays/facebook-s-privacy-settings-aren-t-the-problem-ours-are/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I&amp;rsquo;m all for healthy competition and so forth, but do we really want such massive phones? &lt;a href="https://arstechnica.com/gadgets/2013/08/the-smallest-new-android-phone-you-can-buy-isnt-small-at-all/"&gt;https://arstechnica.com/gadgets/2013/08/the-smallest-new-android-phone-you-can-buy-isnt-small-at-all/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;This is the kind of thing that I never quite have the courage or the morals to do: &lt;a href="http://web.archive.org/web/20130809202515/http://www.minyanville.com/business-news/editors-pick/articles/A-Russian-Bank-Is-Sued-for/8/7/2013/id/51205"&gt;http://web.archive.org/web/20130809202515/http://www.minyanville.com/business-news/editors-pick/articles/A-Russian-Bank-Is-Sued-for/8/7/2013/id/51205&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;This is an excellent summary for why I&amp;rsquo;m trying to find a good Gmail replacement: &lt;a href="https://ar.al/notes/schnail-mail-free-real-mail-for-life/"&gt;https://ar.al/notes/schnail-mail-free-real-mail-for-life/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A guide for dealing with introverts (not that many of my friends need it - perhaps that&amp;rsquo;s why they&amp;rsquo;re my friends): &lt;a href="http://laughingsquid.com/how-to-live-with-introverts/"&gt;http://laughingsquid.com/how-to-live-with-introverts/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I didn&amp;rsquo;t know this was such a wide-spread problem: &lt;a href="http://www.coding2learn.org/blog/2013/07/29/kids-cant-use-computers/"&gt;http://www.coding2learn.org/blog/2013/07/29/kids-cant-use-computers/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I agree with this article on the state of maths teaching entirely - I had some excellent teachers, but I could see from the textbooks how it was designed to be taught: &lt;a href="http://mysite.science.uottawa.ca/mnewman/LockhartsLament.pdf"&gt;http://mysite.science.uottawa.ca/mnewman/LockhartsLament.pdf&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;How is it that Scandinavia manages to be so nice all the time?! &lt;a href="https://www.bbc.co.uk/news/world-europe-23655675"&gt;https://www.bbc.co.uk/news/world-europe-23655675&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>New computer setup</title><link>/posts/2013-08-04-new-computer-setup/</link><pubDate>Sun, 04 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-04-new-computer-setup/</guid><description>&lt;p&gt;&lt;em&gt;Editor&amp;rsquo;s note: this is a snapshot of life in 2013-08-04. My setup has changed substantially since then.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;In case I ever have to get a new computer (or, indeed, in case anyone else is interested), I hereby present the (updating) list of applications and so forth that I would immediately install to get a computer up to usability.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Browser: &lt;a href="https://www.mozilla.org/en-US/firefox/new/"&gt;Firefox&lt;/a&gt; with &lt;a href="https://www.ghostery.com/"&gt;Ghostery&lt;/a&gt;, &lt;a href="https://www.eff.org/https-everywhere"&gt;HTTPS Everywhere&lt;/a&gt;, and &lt;a href="https://addons.mozilla.org/en-US/firefox/addon/noscript/"&gt;NoScript&lt;/a&gt; (and remember to turn on Do Not Track…)&lt;/li&gt;
&lt;li&gt;Mail client: &lt;a href="https://www.mozilla.org/en-US/thunderbird/"&gt;Thunderbird&lt;/a&gt; with &lt;a href="http://www.enigmail.net/home/index.php"&gt;Enigmail&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Messaging client: &lt;a href="https://adium.im/"&gt;Adium&lt;/a&gt; on Mac, and possibly &lt;a href="https://www.pidgin.im/"&gt;Pidgin&lt;/a&gt; for others - I&amp;rsquo;ve never used a non-Mac chat client. Beware: as of this writing, Pidgin stores passwords in plain text, so don&amp;rsquo;t save passwords in Pidgin.&lt;/li&gt;
&lt;li&gt;Encryption: GPG (&lt;a href="http://www.gpg4win.org/"&gt;Windows&lt;/a&gt;, &lt;a href="https://gpgtools.org/"&gt;Mac&lt;/a&gt;, &lt;a href="https://gnupg.org/"&gt;Linux&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Text editor: Vim&lt;/li&gt;
&lt;li&gt;Memory training: &lt;a href="http://ankisrs.net/"&gt;Anki&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Movie viewing: &lt;a href="https://videolan.org/vlc/"&gt;VLC&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Screen colour muter: &lt;a href="http://stereopsis.com/flux/"&gt;f.lux&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Backup software: &lt;a href="https://www.crashplan.com/"&gt;CrashPlan&lt;/a&gt; - but I also keep local backups using whatever built-in automated backup utility the OS provides&lt;/li&gt;
&lt;li&gt;FTP client: &lt;a href="https://filezilla-project.org/"&gt;FileZilla&lt;/a&gt;, or &lt;a href="http://cyberduck.io/"&gt;Cyberduck&lt;/a&gt; on a Mac&lt;/li&gt;
&lt;li&gt;Syncing: &lt;a href="https://www.dropbox.com/"&gt;Dropbox&lt;/a&gt; (but I want to get rid of this, because of privacy concerns)&lt;/li&gt;
&lt;li&gt;Computational software: &lt;a href="https://www.wolfram.com"&gt;Mathematica&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Music: &lt;a href="https://www.apple.com/itunes/"&gt;iTunes&lt;/a&gt; (but I want to switch this for something not-Apple, and it has no Linux version)&lt;/li&gt;
&lt;li&gt;Gaming: &lt;a href="https://store.steampowered.com/"&gt;Steam&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;RSS reader: Currently, my RSS feed is presented in-browser, at &lt;a href="https://www.newsblur.com"&gt;NewsBlur&lt;/a&gt;.&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Stumbled across 4th August 2013</title><link>/posts/2013-08-04-stumbled-across-4-august-2013/</link><pubDate>Sun, 04 Aug 2013 00:00:00 +0000</pubDate><guid>/posts/2013-08-04-stumbled-across-4-august-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;An ad developer has misgivings: &lt;a href="http://seriouspony.com/blog/2013/7/24/your-app-makes-me-fat"&gt;http://seriouspony.com/blog/2013/7/24/your-app-makes-me-fat&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Hint for dealing with some automated phone helplines - swear at them and they&amp;rsquo;ll put you through to a human: &lt;a href="https://www.vice.com/en/article/z444dx/if-you-swear-at-apple-s-automated-customer-service-they-ll-put-you-through-to-a-human"&gt;https://www.vice.com/en/article/z444dx/if-you-swear-at-apple-s-automated-customer-service-they-ll-put-you-through-to-a-human&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The future is coming: &lt;a href="http://www.extremetech.com/extreme/162678-harvard-creates-brain-to-brain-interface-allows-humans-to-control-other-animals-with-thoughts-alone"&gt;http://www.extremetech.com/extreme/162678-harvard-creates-brain-to-brain-interface-allows-humans-to-control-other-animals-with-thoughts-alone&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A large collection of replacements for various PRISM-vulnerable services: &lt;a href="https://prism-break.org/"&gt;https://prism-break.org/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Some people think in a really rather interesting way: &lt;a href="https://www.schneier.com/blog/archives/2005/02/smart_water.html"&gt;https://www.schneier.com/blog/archives/2005/02/smart_water.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The joys of a memoryless distribution: &lt;a href="http://io9.com/the-quantum-zeno-effect-actually-does-stop-the-world-977909459"&gt;http://io9.com/the-quantum-zeno-effect-actually-does-stop-the-world-977909459&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;An impressive photograph: &lt;a href="https://web.archive.org/web/20130814173950/http://www.oddly-even.com/2013/07/31/the-largest-photo-ever-taken-of-tokyo-is-zoomable-and-it-is-glorious/"&gt;largest photo cached&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A fair chunk of the &amp;ldquo;1910&amp;rsquo;s predicted Year 2000 technologies&amp;rdquo; has been invented: &lt;a href="http://www.sadanduseless.com/2011/03/world-in-2000/"&gt;http://www.sadanduseless.com/2011/03/world-in-2000/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A sweet video about Street View: &lt;a href="http://vimeo.com/32397612"&gt;http://vimeo.com/32397612&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;How to enable encryption in your emails using &lt;a href="https://en.wikipedia.org/wiki/GNU_Privacy_Guard"&gt;GPG&lt;/a&gt;: &lt;a href="http://arstechnica.com/security/2013/06/encrypted-e-mail-how-much-annoyance-will-you-tolerate-to-keep-the-nsa-away/"&gt;http://arstechnica.com/security/2013/06/encrypted-e-mail-how-much-annoyance-will-you-tolerate-to-keep-the-nsa-away/&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>On to-do lists as direction in life</title><link>/posts/2013-07-30-on-to-do-lists-as-direction-in-life/</link><pubDate>Tue, 30 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-30-on-to-do-lists-as-direction-in-life/</guid><description>&lt;p&gt;&lt;a href="https://en.wikipedia.org/wiki/Getting_Things_Done"&gt;Getting Things Done&lt;/a&gt; has gathered something of a &lt;a href="http://web.archive.org/web/20130428015707/http://www.wired.com/techbiz/people/magazine/15-10/ff_allen?" title="Wired article on GTD"&gt;cult following&lt;/a&gt; [archived due to &lt;a href="https://en.wikipedia.org/wiki/Link_rot" title="Link rot Wikipedia page"&gt;link rot&lt;/a&gt;] since its inception. As a way of getting things done, it&amp;rsquo;s pretty good - separate tasks out into small bits on your to-do list so that you have mental room free to consider the bigger picture. However, there&amp;rsquo;s a certain aspect of to-do lists that I&amp;rsquo;ve not really seen mentioned before, and which I find to be really helpful.&lt;/p&gt;</description></item><item><title>Stumbled across 29th July 2013</title><link>/posts/2013-07-29-stumbled-across-29-july-2013/</link><pubDate>Mon, 29 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-29-stumbled-across-29-july-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;Hehe: &lt;a href="http://www.pixartheory.com/"&gt;http://www.pixartheory.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Wow - light trapped for a full minute: &lt;a href="http://www.newscientist.com/article/dn23925-light-completely-stopped-for-a-recordbreaking-minute.html"&gt;http://www.newscientist.com/article/dn23925-light-completely-stopped-for-a-recordbreaking-minute.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The importance of a consistent utility function: &lt;a href="http://lesswrong.com/lw/my/the_allais_paradox/"&gt;http://lesswrong.com/lw/my/the_allais_paradox/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Obama promised to be friendly to whistleblowers, and has quietly removed said promise: &lt;a href="http://sunlightfoundation.com/blog/2013/07/25/obama-promises-disappear-from-web/"&gt;http://sunlightfoundation.com/blog/2013/07/25/obama-promises-disappear-from-web/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I wholeheartedly agree with this site: &lt;a href="https://abandonmatlab.wordpress.com/"&gt;https://abandonmatlab.wordpress.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Good post on belief-in-belief: &lt;a href="http://web.archive.org/web/20120629012114/http://stairs.umd.edu/236/meta-atheism.html"&gt;http://web.archive.org/web/20120629012114/http://stairs.umd.edu/236/meta-atheism.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Huh. A strange system, the US medical system: &lt;a href="http://stallman.org/articles/asked_to_lie.html"&gt;http://stallman.org/articles/asked_to_lie.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Very much this - about how the media has lost the plot about PRISMgate: &lt;a href="http://m.guardiannews.com/technology/2013/jul/28/edward-snowden-death-of-internet"&gt;http://m.guardiannews.com/technology/2013/jul/28/edward-snowden-death-of-internet&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Aaand my faith in humanity is once again shattered: &lt;a href="http://i.imgur.com/mdfvFA6.jpg"&gt;http://i.imgur.com/mdfvFA6.jpg&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Metathought</title><link>/posts/2013-07-25-metathought/</link><pubDate>Thu, 25 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-25-metathought/</guid><description>&lt;p&gt;I have recently discovered the game of &lt;a href="https://en.wikipedia.org/wiki/Agricola_%28board_game%29"&gt;Agricola&lt;/a&gt;, a board game involving using resources (family members, stone, etc) to build a thriving farm.
The game is turn-based, with the possible actions each turn being severely limited.
This makes the game be in large part about optimising under constraint (the foundation of any good game).
However, during gameplay I also detected a certain resonance between Agricola and the game of &lt;a href="https://en.wikipedia.org/wiki/Magic_the_gathering"&gt;Magic: The Gathering&lt;/a&gt;, beyond the usual &amp;ldquo;constrained optimisation&amp;rdquo; theme.
While I was playing Agricola, there was a kind of niggle in the back of my mind, telling me that &amp;ldquo;ooh, this is like Magic&amp;rdquo;.&lt;/p&gt;</description></item><item><title>Stumbled across 24th July 2013</title><link>/posts/2013-07-24-stumbled-across-24th-july-2013/</link><pubDate>Wed, 24 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-24-stumbled-across-24th-july-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;This is something I will try at some point, probably when I get back to uni: &lt;a href="http://www.bulletproofexec.com/how-to-make-your-coffee-bulletproof-and-your-morning-too/"&gt;http://www.bulletproofexec.com/how-to-make-your-coffee-bulletproof-and-your-morning-too/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;This was fun: &lt;a href="http://www.sporcle.com/games/Government_Agent/true-or-false-logic-quiz"&gt;http://www.sporcle.com/games/Government_Agent/true-or-false-logic-quiz&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Hah - stupid copyright owners: &lt;a href="https://torrentfreak.com/hbo-wants-google-to-censor-hbo-com-130203/"&gt;https://torrentfreak.com/hbo-wants-google-to-censor-hbo-com-130203/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The government&amp;rsquo;s got around to allowing the testing of driverless cars: &lt;a href="https://arstechnica.com/tech-policy/2013/07/uk-govt-approves-autonomous-cars-on-public-roads-before-years-end/"&gt;https://arstechnica.com/tech-policy/2013/07/uk-govt-approves-autonomous-cars-on-public-roads-before-years-end/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;An insightful comic about getting to sleep: &lt;a href="https://abstrusegoose.com/523"&gt;https://abstrusegoose.com/523&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Roll on the cheap and easy satellites: &lt;a href="http://www.guardian.co.uk/science/across-the-universe/2013/jul/17/sabre-rocket-engine-reaction-skylon"&gt;http://www.guardian.co.uk/science/across-the-universe/2013/jul/17/sabre-rocket-engine-reaction-skylon&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A bunch of interesting sciency things, including a new application of zapping current through the brain: &lt;a href="https://arstechnica.com/science/2013/07/weird-science-always-runs-current-through-its-brain-before-speed-dating/"&gt;https://arstechnica.com/science/2013/07/weird-science-always-runs-current-through-its-brain-before-speed-dating/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;At last! &lt;a href="http://coderinaworldofcode.blogspot.co.uk/2013/07/50-shades-of-grey-made-illegal-in-uk.html"&gt;http://coderinaworldofcode.blogspot.co.uk/2013/07/50-shades-of-grey-made-illegal-in-uk.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I didn&amp;rsquo;t see this at the time - consider my faith in humanity restored: &lt;a href="https://www.bbc.co.uk/news/world-asia-pacific-13598607"&gt;https://www.bbc.co.uk/news/world-asia-pacific-13598607&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Excellent essay on why it&amp;rsquo;s hard to prohibit same-sex marriage: &lt;a href="http://web.archive.org/web/20140723074138/http://linuxmafia.com/faq/Essays/marriage.html"&gt;cached&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>The Orbit/Stabiliser Theorem</title><link>/posts/2013-07-22-the-orbitstabiliser-theorem/</link><pubDate>Mon, 22 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-22-the-orbitstabiliser-theorem/</guid><description>&lt;p&gt;The Orbit/Stabiliser Theorem is a simple theorem in group theory. Thanks to &lt;a href="https://gowers.wordpress.com/2011/11/09/group-actions-ii-the-orbit-stabilizer-theorem/"&gt;Tim Gowers&lt;/a&gt; for the proof I outline here - I find it much more intuitive than the proof that was presented in lectures, and it involves equivalence relations (which I think are wonderful things).&lt;/p&gt;
&lt;p&gt;Theorem: \(\vert {g(x), g \in G} \vert \times \vert {g \in G: g(x) = x} \vert = \vert G \vert\).&lt;/p&gt;
&lt;p&gt;Proof: We fix an element \(x \in G\), and define two equivalence relations: \(g \sim h\) iff \(g(x) = h(x)\), and \(g \cdot h\) if \(h^{-1} g \in \text{Stab}_G(x)\), where \(\text{Stab}_G(k) = {g \in G: g(k) = k}\).&lt;/p&gt;</description></item><item><title>On Shakespeare</title><link>/posts/2013-07-21-on-shakespeare/</link><pubDate>Sun, 21 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-21-on-shakespeare/</guid><description>&lt;p&gt;I&amp;rsquo;ve now seen two Shakespeare plays at the &lt;a href="https://en.wikipedia.org/wiki/Shakespeare%27s_Globe"&gt;Globe&lt;/a&gt; - once in person, to see A Midsummer Night&amp;rsquo;s Dream, and once with a one-year-and-eighty-mile gap between viewing and performance (through the &lt;a href="https://www.dramaonlinelibrary.com/shakespeares-globe-on-screen"&gt;Globe On Screen&lt;/a&gt; project), to see Twelfth Night.
Both times the plays were excellent.
Both were comedies, and both were laugh-out-loud funny.&lt;/p&gt;
&lt;p&gt;The performance of Twelfth Night, then, was beamed into a local-ish cinema for our viewing pleasure.
(Definitely more comfortable than the seating at the Globe, although I am reliably informed that if you go to the Globe, you really have to be a groundling, standing at the front next to the stage, in order to get the proper experience.)
My seat was next to those of some young-ish children.
The result of taking several young children to a three-hour performance of a play which isn&amp;rsquo;t in Modern English was predictable, but it got me thinking.
(Bear with me - this will become relevant.)&lt;/p&gt;</description></item><item><title>My objection to the One Logical Leap view</title><link>/posts/2013-07-18-my-objection-to-the-one-logical-leap-view/</link><pubDate>Thu, 18 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-18-my-objection-to-the-one-logical-leap-view/</guid><description>&lt;p&gt;A large chunk of the reason why changing someone&amp;rsquo;s mind is so difficult is the fact that our deeply-held beliefs seem so obviously true to us, and we find it hard to understand why those beliefs aren&amp;rsquo;t obvious to others. Example:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;A: A god exists - look around you; everything you see is so obviously created, not stumbled upon!
B: No, that&amp;rsquo;s rubbish - look around you, everything you see is easily explained by understood processes!&lt;/p&gt;</description></item><item><title>Prerequisites for hypothetical situations</title><link>/posts/2013-07-14-prerequisites-for-hypothetical-situations/</link><pubDate>Sun, 14 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-14-prerequisites-for-hypothetical-situations/</guid><description>&lt;p&gt;Usually when I discover (or, more rarely, think up) a thought experiment about a moral point, and discuss it with an arbitrary person whom I will (for convenience) call Kim, the conversation usually goes like this:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Me: {Interesting scenario} - what do you think?&lt;/p&gt;
&lt;p&gt;Kim: I would just {avoids point of scenario by nitpicking}&lt;/p&gt;
&lt;p&gt;Me: You know what I meant. {applies easy fix to scenario to prevent nitpick}&lt;/p&gt;
&lt;p&gt;Kim: Well then, I&amp;rsquo;d {avoids point of scenario by raising unrelated moral issue}&lt;/p&gt;</description></item><item><title>The Multiple Drafts view of consciousness</title><link>/posts/2013-07-14-the-multiple-drafts-view-of-consciousness/</link><pubDate>Sun, 14 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-14-the-multiple-drafts-view-of-consciousness/</guid><description>&lt;p&gt;I&amp;rsquo;ve been reading one of &lt;a href="https://en.wikipedia.org/wiki/Daniel_Dennett"&gt;Daniel Dennett&amp;rsquo;s&lt;/a&gt; books, &lt;em&gt;Consciousness Explained&lt;/em&gt;. Aside from the fact that the author has an incredible beard and is therefore correct on all matters, he can also write a very cogent book. In &lt;em&gt;Consciousness Explained&lt;/em&gt;, Dennett outlines what he calls the Multiple Drafts approach to explaining consciousness; this blog post is my attempt to summarise that view in a couple of short analogies.&lt;/p&gt;
&lt;p&gt;Dennett starts off by providing evidence that our time-perception is somewhat malleable: we can interpret &lt;a href="https://en.wikipedia.org/wiki/Color_Phi_phenomenon"&gt;two dots of different colours&lt;/a&gt; (appearing separated by a short distance in time and space) as a single moving dot that changes colour abruptly at some point. The key puzzle here is that we perceive the colour to have changed &lt;em&gt;before&lt;/em&gt; seeing the second coloured dot. Dennett then outlines what seem to be the two mainstream points of view on how this happens.&lt;/p&gt;</description></item><item><title>Stumbled across 13th July 2013</title><link>/posts/2013-07-13-stumbled-across-13th-july-2013/</link><pubDate>Sat, 13 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-13-stumbled-across-13th-july-2013/</guid><description>&lt;ul&gt;
&lt;li&gt;This is really quite heartwarming: &lt;a href="http://www.reddit.com/r/Random_Acts_Of_Pizza/"&gt;http://www.reddit.com/r/Random_Acts_Of_Pizza/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Interesting article on current trends in fiction: &lt;a href="http://www.locusmag.com/Perspectives/2013/01/david-brin-our-favorite-cliche-a-world-filled-with-idiots-orwhy-films-and-novels-routinely-depict-society-and-its-citizens-as-fools/"&gt;http://www.locusmag.com/Perspectives/2013/01/david-brin-our-favorite-cliche-a-world-filled-with-idiots-orwhy-films-and-novels-routinely-depict-society-and-its-citizens-as-fools/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A ridiculous reason for a rocket to explode: &lt;a href="https://arstechnica.com/science/2013/07/parts-installed-upside-down-caused-last-weeks-russian-rocket-to-explode/"&gt;https://arstechnica.com/science/2013/07/parts-installed-upside-down-caused-last-weeks-russian-rocket-to-explode/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A very information-dense way of storing data long-term: &lt;a href="https://phys.org/news/2013-07-5d-optical-memory-glass-evidence.html"&gt;https://phys.org/news/2013-07-5d-optical-memory-glass-evidence.html&lt;/a&gt; (compare &lt;a href="http://rosettaproject.org/disk/technology/"&gt;http://rosettaproject.org/disk/technology/&lt;/a&gt; which is much less information-dense but much more easily decoded in the event of being discovered after the collapse of civilisation)&lt;/li&gt;
&lt;li&gt;A cool thing to do with a Raspberry Pi and a microwave: &lt;a href="http://madebynathan.com/2013/07/10/raspberry-pi-powered-microwave/"&gt;http://madebynathan.com/2013/07/10/raspberry-pi-powered-microwave/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I really want one of these - I think I might order one: &lt;a href="http://www.kickstarter.com/projects/cloud-guys/plug-the-brain-of-your-devices"&gt;http://www.kickstarter.com/projects/cloud-guys/plug-the-brain-of-your-devices&lt;/a&gt; (also, the word &amp;ldquo;plug&amp;rdquo; is insanely wonderful when spoken in a French accent)&lt;/li&gt;
&lt;li&gt;An interesting idea for making the world a better place: &lt;a href="http://web.archive.org/web/20130713135924/http://simulacrum.cc/2013/07/10/three-trends-that-push-us-towards-an-unconditional-basic-income/"&gt;http://web.archive.org/web/20130713135924/http://simulacrum.cc/2013/07/10/three-trends-that-push-us-towards-an-unconditional-basic-income/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A look at how to infer causality or not, as the case may be, depending on the data: &lt;a href="http://www.michaelnielsen.org/ddi/if-correlation-doesnt-imply-causation-then-what-does/"&gt;http://www.michaelnielsen.org/ddi/if-correlation-doesnt-imply-causation-then-what-does/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;I hope they get to producing this quickly: &lt;a href="http://technabob.com/blog/2013/05/22/lumigrids-bike-leds/"&gt;http://technabob.com/blog/2013/05/22/lumigrids-bike-leds/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Thank goodness for that - regular expressions are the most unreadable things ever: &lt;a href="https://phys.org/news/2013-07-ordinary-language.html"&gt;https://phys.org/news/2013-07-ordinary-language.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Something else I would do if I had eternity to play with: &lt;a href="https://www.youtube.com/watch?v=voB6WiP83NU"&gt;https://www.youtube.com/watch?v=voB6WiP83NU&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Glass ceiling issues: &lt;a href="http://whatwouldkingleonidasdo.tumblr.com/post/54989171152/how-i-discovered-gender-discrimination"&gt;http://whatwouldkingleonidasdo.tumblr.com/post/54989171152/how-i-discovered-gender-discrimination&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>A framework for discussing "pricelessness"</title><link>/posts/2013-07-12-a-framework-for-discussing-pricelessness/</link><pubDate>Fri, 12 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-12-a-framework-for-discussing-pricelessness/</guid><description>&lt;p&gt;Sometimes some people argue that certain things are &amp;ldquo;priceless&amp;rdquo; - that is, worth an infinite amount of money to them. I posit that what this really means is that it would take work and uncomfortable imagination to evaluate the worth of that thing to them.&lt;/p&gt;
&lt;p&gt;The example that triggered this framework was my evaluation of how much my sense of smell was worth to me. (It was late at night and I couldn&amp;rsquo;t get to sleep, so I just let my mind wander around for a bit.) I was unable to quantify the amount I would pay to keep my sense of smell, but it is certainly finite, as the following thought experiment demonstrates.&lt;/p&gt;</description></item><item><title>Imre Leader Appreciation Society</title><link>/posts/2013-07-10-imre-leader-appreciation-society/</link><pubDate>Wed, 10 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-10-imre-leader-appreciation-society/</guid><description>&lt;p&gt;There was once a small website devoted to noting the more interesting quotes from our more idiosyncratic lecturers.
It sadly vanished from the web, although after some detective work, I found a copy floating around on one of Amazon&amp;rsquo;s servers.
I stored them for posterity using the archival service WebCitation, which is itself now dead, so instead I shall link to &lt;a href="https://www.konraddabrowski.co.uk/ilas/index.html"&gt;Konrad Dąbrowski&amp;rsquo;s capture&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Stumbled across 9th July 2013</title><link>/posts/2013-07-09-stumbled-across-9th-july-2013/</link><pubDate>Tue, 09 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-09-stumbled-across-9th-july-2013/</guid><description>&lt;p&gt;Being bored over the summer holiday, I decided that I would document the cool things I ran across on the Internet. Over the last week, there have been many of these. If I see anything particularly amazing, it&amp;rsquo;ll go in one of these aggregation posts.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="http://blog.eyewire.org/gallery/image-gallery/"&gt;Neurons are surprisingly beautiful&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A rather neat and very short story, &lt;a href="https://qntm.org/timeloop"&gt;Time Loop&lt;/a&gt; by qntm&lt;/li&gt;
&lt;li&gt;A bit less short but just as good a short story: &lt;a href="https://qntm.org/responsibility"&gt;I don&amp;rsquo;t know, Timmy, being God is a big responsibility&lt;/a&gt; by qntm&lt;/li&gt;
&lt;li&gt;A rant with which students can all identify, in The Cambridge Student magazine: now lost from the Internet.&lt;/li&gt;
&lt;li&gt;An Easter Island word &amp;ldquo;tingo&amp;rdquo; means &amp;ldquo;to borrow objects from a friend&amp;rsquo;s house one by one until there are none left&amp;rdquo;: &lt;a href="http://web.archive.org/web/20100516040410/http://blog.web-translations.com/2008/12/toujours-tingo-words-that-dont-exist-in-english/"&gt;Link to the Internet Archive&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Musings on free will: &lt;a href="http://www.mit.edu/people/dpolicar/writing/prose/text/godTaoist.html"&gt;Is God a Taoist?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A thing that I just have to share again: &lt;a href="http://nextbigfuture.com/2013/06/technical-hurdles-have-been-overcome.html"&gt;Technical hurdles have been overcome for the first human head transplant&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The human brain is a really weird piece of kit: &lt;a href="http://lesswrong.com/lw/20/the_apologist_and_the_revolutionary/"&gt;The Apologist and the Revolutionary&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;We &lt;em&gt;have&lt;/em&gt; to make one of these at some point: &lt;a href="https://www.pimpthatsnack.com/project/the-creme-de-la-creme-egg/"&gt;the Creme de la Creme Egg&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;This is quite soothing in a weird kind of way: &lt;a href="https://thingsfittingperfectlyintothings.tumblr.com/"&gt;Things Fitting Perfectly Into Things&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;It is possible to be deficient in arsenic. (Link to the Soylent Discourse forum is permanently defunct.)&lt;/li&gt;
&lt;li&gt;A really useful website for when you don&amp;rsquo;t want to have to spin up Wolfram|Alpha to work out time differences: &lt;a href="http://everytimezone.com/"&gt;Every Time Zone&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Why never to talk to the police (seriously, never talk to the police): &lt;a href="https://www.youtube.com/watch?v=6wXkI4t7nuc"&gt;Don&amp;rsquo;t Talk to the Police&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A fascinating book about the power of positive and negative reinforcement, and why they&amp;rsquo;re often done wrongly: &lt;a href="https://web.archive.org/web/20130206170903/http://www.papagalibg.com/FilesStore/karen_pryor_-_don_t_shoot_the_dog.pdf"&gt;Don&amp;rsquo;t Shoot the Dog&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The Church of England really took its time, but at last they&amp;rsquo;ve done it: &lt;a href="https://www.bbc.co.uk/news/uk-23215388"&gt;Church of England makes Chichester child abuse apology&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The Hawkeye Initiative, for the liberation of women in comics: &lt;a href="http://thehawkeyeinitiative.com/"&gt;The Hawkeye Initiative&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>An obvious improvement to tennis</title><link>/posts/2013-07-08-an-obvious-improvement-to-tennis/</link><pubDate>Mon, 08 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-08-an-obvious-improvement-to-tennis/</guid><description>&lt;p&gt;So yesterday the &lt;a href="https://en.wikipedia.org/wiki/The_Championships,_Wimbledon"&gt;Wimbledon tennis tournament&lt;/a&gt; was decided. The system for verifying whether the tennis ball is out or not (and hence whether play for the point stops or continues) on the main courts is as follows:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;The ball lands.&lt;/li&gt;
&lt;li&gt;The linesperson keeping charge of the line nearest to the landing point of the ball works out whether the ball landed inside or outside the region demarcated by the line.&lt;/li&gt;
&lt;li&gt;The umpire decides whether or not to overrule the linesperson&amp;rsquo;s decision.&lt;/li&gt;
&lt;li&gt;The &lt;a href="https://en.wikipedia.org/wiki/Hawk-Eye"&gt;Hawkeye&lt;/a&gt; ball-tracking system determines whether the ball landed inside or outside the region demarcated by the line.&lt;/li&gt;
&lt;li&gt;If either player disagrees with the official decision (that is, if the linesperson called &amp;ldquo;out&amp;rdquo; when the player thought the ball was in, or the linesperson was silent when the player thought the ball was out, or if the umpire overruled a decision that the player thinks was correct) then that player informs the umpire that ey wishes to &amp;ldquo;challenge&amp;rdquo; the linesperson. In this instance, the Hawkeye reading is consulted (and the ball&amp;rsquo;s trajectory slowly animated on a big screen, for added tension) and regarded as definitive.&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;The problem I have with this system is the process of &amp;ldquo;challenging&amp;rdquo;. Each player starts out with a challenge count of three. If a player makes a challenge, and Hawkeye contradicts the official call, then the challenge count is maintained at its current level. If a player makes a challenge, and Hawkeye agrees with the official call, then the challenge count for that player is decremented. A player cannot challenge if eir challenge count is 0. On entering a tie-break, each player&amp;rsquo;s challenge count is incremented.&lt;/p&gt;</description></item><item><title>Mundane magics</title><link>/posts/2013-07-07-mundane-magics/</link><pubDate>Sun, 07 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-07-mundane-magics/</guid><description>&lt;p&gt;I have stumbled across a LessWrong post on the importance of &lt;a href="http://lesswrong.com/lw/ve/mundane_magic/" title="LessWrong post on Mundane Magic"&gt;seeing what is real for just how cool it is&lt;/a&gt;. It lists such examples as:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;em&gt;Vibratory Telepathy&lt;/em&gt;.  By transmitting invisible vibrations through the very air itself, two users of this ability can &lt;em&gt;share thoughts&lt;/em&gt;.  As a result, Vibratory Telepaths can form emotional bonds much deeper than those possible to other primates.&lt;/li&gt;
&lt;li&gt;&lt;em&gt;Psychometric Tracery&lt;/em&gt;.  By tracing small fine lines on a surface, the Psychometric Tracer can leave impressions of emotions, history, knowledge, even the structure of other spells.  This is a higher level than Vibratory Telepathy as a Psychometric Tracer can share the thoughts of long-dead Tracers who lived thousands of years earlier.  By reading one Tracery and inscribing another simultaneously, Tracers can duplicate Tracings; and these replicated Tracings can even contain the detailed pattern of other spells and magics.  Thus, the Tracers wield almost unimaginable power as magicians; but Tracers can get in trouble trying to use complicated Traceries that they could not have Traced themselves.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;I thought I would give a few more. First, I hereby rename &lt;em&gt;The Eye&lt;/em&gt; (as that post&amp;rsquo;s author names this ability) to &lt;em&gt;Force Perception&lt;/em&gt;, and I dub a user of any of these magics a Mage.&lt;/p&gt;</description></item><item><title>Cambridge vocab - a guide for the mystified</title><link>/posts/2013-07-06-cambridge-vocab-a-guide-for-the-mystified/</link><pubDate>Sat, 06 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-06-cambridge-vocab-a-guide-for-the-mystified/</guid><description>&lt;p&gt;There is an awfully large collection of confusing words you will encounter on first coming to study at Cambridge. You pick them up really quickly in the natural run of things, but I thought perhaps a mini-dictionary might be helpful. The list is alphabetised (if I&amp;rsquo;m competent enough, anyway) and may, like so many of my writings, grow. Apologies for my crude attempts at pronunciations for the non-obvious words, but it&amp;rsquo;s very hard to find someone who can read &lt;a href="https://en.wikipedia.org/wiki/IPA"&gt;IPA&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Cambridge undergrad maths tips</title><link>/posts/2013-07-04-cambridge-undergrad-maths-tips/</link><pubDate>Thu, 04 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-04-cambridge-undergrad-maths-tips/</guid><description>&lt;p&gt;I wrote this when I was excessively bored during exam term of my first year. It may grow as I get better at working (I&amp;rsquo;m something of a &lt;a href="https://en.wikipedia.org/wiki/Ministry_of_Truth"&gt;revisionist&lt;/a&gt;). The advice is entirely Cambridge-based; a lot of it probably applies to other places with minor alterations. Most of this comes from personal experience.&lt;/p&gt;
&lt;p&gt;During a supervision, your supervisor will be writing all the time. As soon as you leave the supervision, mark the sheets that are particularly important in some obvious way (eg. by colouring in the corner). That way, when you&amp;rsquo;re frantically flicking through the notes at the end of the year, you&amp;rsquo;ll see where the information you need is. By &amp;ldquo;most important&amp;rdquo;, I mean the places where the supervisor explains something fundamental to many questions, rather than the ins and outs of one particular question.&lt;/p&gt;</description></item><item><title>In which I augment the lexicon</title><link>/posts/2013-07-03-in-which-i-augment-the-lexicon/</link><pubDate>Wed, 03 Jul 2013 00:00:00 +0000</pubDate><guid>/posts/2013-07-03-in-which-i-augment-the-lexicon/</guid><description>A few dubiously-real words which I think should be more widely used.</description></item><item><title>CUCaTS Puzzlehunt</title><link>/posts/2013-06-26-cucats-puzzlehunt/</link><pubDate>Wed, 26 Jun 2013 00:00:00 +0000</pubDate><guid>/posts/2013-06-26-cucats-puzzlehunt/</guid><description>&lt;p&gt;At the end of last (that is, Lent 2012-2013) term at Cambridge, I took part in the &lt;a href="https://cucats.org"&gt;Cambridge University Computing and Technology Society&lt;/a&gt; &lt;a href="https://cucats.org/puzzlehunt"&gt;Puzzlehunt&lt;/a&gt; (for some reason, as of this writing, they haven&amp;rsquo;t yet updated that page for this year&amp;rsquo;s Puzzlehunt, but last year&amp;rsquo;s is up there). A short summary: the Puzzlehunt is a treasure hunt around Cambridge, crossed with a whole bunch of online computing-based puzzles. It&amp;rsquo;s very difficult, and it lasts for twenty-four hours.&lt;/p&gt;</description></item><item><title>First post</title><link>/posts/2013-06-26-first-post/</link><pubDate>Wed, 26 Jun 2013 00:00:00 +0000</pubDate><guid>/posts/2013-06-26-first-post/</guid><description>&lt;p&gt;Hello all!&lt;/p&gt;
&lt;p&gt;In the spirit of shouting into an echoing void, this is my first post, testing whether the setup works. Some content will probably turn up soon.&lt;/p&gt;</description></item><item><title>Sylow theorems</title><link>/posts/2013-06-26-sylow-theorems/</link><pubDate>Wed, 26 Jun 2013 00:00:00 +0000</pubDate><guid>/posts/2013-06-26-sylow-theorems/</guid><description>A fairly long and winding way through a proof of the three Sylow theorems.</description></item><item><title/><link>/wordpress/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/wordpress/</guid><description>&lt;!DOCTYPE html&gt;
&lt;html lang="en-US"&gt;
 &lt;head&gt;
 &lt;meta charset="utf-8"&gt;
 &lt;title&gt;Redirecting&amp;hellip;&lt;/title&gt;
 &lt;link rel="canonical" href="/index.html"&gt;
 &lt;script&gt;location="/index.html"&lt;/script&gt;
 &lt;meta http-equiv="refresh" content="0; url=/index.html"&gt;
 &lt;meta name="robots" content="noindex"&gt;
 &lt;/head&gt;
 &lt;body&gt;
 &lt;h1&gt;Redirecting&amp;hellip;&lt;/h1&gt;
 &lt;a href="/index.html"&gt;Click here if you are not redirected.&lt;/a&gt;
 &lt;/body&gt;
&lt;/html&gt;</description></item></channel></rss>