# The Cleaner pattern - how to free native handles in Java 9?

The Cleaner pattern is a new, shiny way to free native handles in Java 9.

The Cleaner pattern is a new, shiny way to free native handles in Java 9.

A review of various ways to approximate the factorial function, Gamma function and Digamma function.

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.

How to optimise asm2bf code? What optimisations techniques apply to brainfuck? Let’s think about it in the context of a simple UNIX utility.

An analysis of my code guessing round 6 entry.

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!