Perspex machine: VI. A graphical user interface to the perspex machine

The perspex machine is a continuous, super-Turing machine which, in previous work, was simulated programatically on a digital computer in the AI language Pop11. Here we present a C++ simulation of the perspex machine, along with a graphical user interface, that can be used to implement, edit, visualise, instrument, and run perspex programs interactively. The interface uses a number of different projections to make 4D perspex-space more accessible to the user. We also present a new proof of the Walnut Cake Theorem that has much weaker conditions than the previous proof and is, therefore, much more widely applicable. It predicts non-monotonicities in numerical algorithms with sub-quadratic convergence.