Given a NxM matrix, one can pick a single element from each row so that the cost of this operation is the smallest. The cost is defined as the sum of every other element left in a row. For each column containing nonzero elements, an element must be picked so that every other element besides the chosen one must originate from different rows. What is the lowest cost for a given matrix?

Is it possible to program in C without alphanumeric characters? Is such a subset of C turing-complete? Finally, can we mechanically translate C code to non-alphanumeric C code? Let’s find out!

Overview of a rewrite of my Domain eXtensions APL library, alongside some RIDE patches.

If [ gcd(80, x) > gcd(50, x) ], then year x is leap. But why?

An analysis of anarchism in the context of anarchocapitalism and anarchocommunism. Simply put - Why is anarchocapitalism an oxymoron? Is anarchism as terrible as we think? Let’s find out!

In this short post we’ll be taking a closer look at one of the CODEX prods. Featuring InnoSetup and FreeArc.

A tiny, 30-line 6502 emulator in C.

Don’t get me wrong - C is a lovely language. Like with every other man-made thing, there’s something off about it. Just like with programming in general…

A writeup on my passion for combinator calculus.

In July of 2020 was working with Ada#0132 on a small, multiprecision fibonacci sequence generator written in C.