Elemental demonstration

One distinct feature of twinchers is their ability to overcome the compute-efficient frontier - a heuristic observation that the error of a neural network decreases polynomially with increasing training resources but never reaches zero. This behaviour has been observed across a wide variety of problems (see a video from Welch Labs and Refs. [1-3]). Here we model this phenomenon using a simple problem and demonstrate how twinchers achieve zero error within limited resources.