<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Alexander Varga</title>
  <subtitle>Blog posts from asvarga.com</subtitle>
  <link href="https://asvarga.com/blog/"/>
  <link rel="self" href="https://asvarga.com/blog/feed.xml"/>
  <id>https://asvarga.com/blog/</id>
  <author><name>Alexander Varga</name></author>
  <updated>2026-05-02T00:00:00Z</updated>
  <entry>
    <title>Function with 4-Fold Symmetry</title>
    <link href="https://asvarga.com/blog/2026/05/02/function-with-4-fold-symmetry/"/>
    <id>https://asvarga.com/blog/2026/05/02/function-with-4-fold-symmetry/</id>
    <published>2026-05-02T00:00:00Z</published>
    <updated>2026-05-02T00:00:00Z</updated>
    <summary>Puzzle: find a function f: ℝ → ℝ with 4-fold rotational symmetry.</summary>
    <category term="Puzzle"/>
    <category term="Math"/>
  </entry>
  <entry>
    <title>NanoBots</title>
    <link href="https://asvarga.com/blog/2026/03/24/nanobots/"/>
    <id>https://asvarga.com/blog/2026/03/24/nanobots/</id>
    <published>2026-03-24T00:00:00Z</published>
    <updated>2026-03-24T00:00:00Z</updated>
    <summary>I built a compiler to let users program millions of nanobots that run on the GPU. Let me show you its features:)</summary>
    <category term="Compilers"/>
    <category term="Game"/>
    <category term="Parallel Programming"/>
  </entry>
  <entry>
    <title>Fair Chess and Simultaneous Games</title>
    <link href="https://asvarga.com/blog/2024/06/22/fair-chess-and-simultaneous-games/"/>
    <id>https://asvarga.com/blog/2024/06/22/fair-chess-and-simultaneous-games/</id>
    <published>2024-06-22T00:00:00Z</published>
    <updated>2024-06-22T00:00:00Z</updated>
    <summary>The game of chess is famously flawed due to the first-move advantage, in which the player who moves first has a significant advantage. Let's fix it and make it fair.</summary>
    <category term="Game"/>
    <category term="Parallel Programming"/>
  </entry>
  <entry>
    <title>Transfinite Zippers</title>
    <link href="https://asvarga.com/blog/2023/03/05/transfinite-zippers/"/>
    <id>https://asvarga.com/blog/2023/03/05/transfinite-zippers/</id>
    <published>2023-03-05T00:00:00Z</published>
    <updated>2023-03-05T00:00:00Z</updated>
    <summary>In my previous post, I described an approach for extending multi-stage programming (MSP) to infinity and beyond. We start with a simple computing “machine” M[0] such as the lambda calculus. Each machine M[a] has a…</summary>
    <category term="Ordinal"/>
    <category term="Data Structures"/>
  </entry>
  <entry>
    <title>Transfinite Meta-Programming - Part 2</title>
    <link href="https://asvarga.com/blog/2022/07/18/transfinite-meta-programming---part-2/"/>
    <id>https://asvarga.com/blog/2022/07/18/transfinite-meta-programming---part-2/</id>
    <published>2022-07-18T00:00:00Z</published>
    <updated>2022-07-18T00:00:00Z</updated>
    <summary>In Part 1 I attempted to give some intuition for the process of iterating reflection to infinity and beyond: any time we can iterate reflection infinitely, we can reflect on this infinite process. In this post, I’ll…</summary>
    <category term="Ordinal"/>
    <category term="Meta"/>
  </entry>
  <entry>
    <title>Transfinite Meta-Posting - Part 1</title>
    <link href="https://asvarga.com/blog/2022/06/20/transfinite-meta-posting---part-1/"/>
    <id>https://asvarga.com/blog/2022/06/20/transfinite-meta-posting---part-1/</id>
    <published>2022-06-20T00:00:00Z</published>
    <updated>2022-06-20T00:00:00Z</updated>
    <summary>In the beginning, I wrote blog posts.</summary>
    <category term="Ordinal"/>
    <category term="Meta"/>
  </entry>
  <entry>
    <title>Efficient Transfinite Lists</title>
    <link href="https://asvarga.com/blog/2022/05/30/efficient-transfinite-lists/"/>
    <id>https://asvarga.com/blog/2022/05/30/efficient-transfinite-lists/</id>
    <published>2022-05-30T00:00:00Z</published>
    <updated>2022-05-30T00:00:00Z</updated>
    <summary>My last two posts were about ordinals and pure lists, and they got a combined whopping 11 claps, so I’m selling out and writing a post about both. In particular, this post is about a data structure I discovered for…</summary>
    <category term="Data Structures"/>
    <category term="Ordinal"/>
  </entry>
  <entry>
    <title>Pure Lists with O(log(i)) Indexing</title>
    <link href="https://asvarga.com/blog/2020/10/21/pure-lists-with-ologi-indexing/"/>
    <id>https://asvarga.com/blog/2020/10/21/pure-lists-with-ologi-indexing/</id>
    <published>2020-10-21T00:00:00Z</published>
    <updated>2020-10-21T00:00:00Z</updated>
    <summary>Linked lists are simple and ubiquitous. When used as a stack, they allow for constant time pushing and popping. Furthermore, they are purely functional: multiple processes can branch off of a linked list and push…</summary>
    <category term="Data Structures"/>
  </entry>
  <entry>
    <title>Plotting Functions on Ordinals</title>
    <link href="https://asvarga.com/blog/2020/05/27/plotting-functions-on-ordinals/"/>
    <id>https://asvarga.com/blog/2020/05/27/plotting-functions-on-ordinals/</id>
    <published>2020-05-27T00:00:00Z</published>
    <updated>2020-05-27T00:00:00Z</updated>
    <summary>Let’s say we’ve defined a function f from ordinals to ordinals and want to plot it like we might plot a function from integers to integers. We want to line up our ordinals on the x- and y-axes, and plot a point at (…</summary>
    <category term="Ordinal"/>
    <category term="Math"/>
  </entry>
</feed>
