A multipurpose mathematical beauty demonstrated in APL.

We all know the Newton-Raphson method for approximating the zero of a real-valued function, but how do we approach the problem of finding all real and complex roots of a polynomial?

A short explanation behind my implementation of the Taylor Series in APL.

Writing and optimising a SK calculus reductor in asm2bf.

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.