APL is an executable mathematical notation - in fact, it was designed by Iverson for describing algorithms on paper (in 1958 IIrC), and then the team working on it implemented it in software, because ... it was a well specified way to describe algorithms.
I highly recommend reading [0], which contains the simplest (IMO) description of the simplex algorithm, which is both mathematical and executable. If you find that inspiring, [1] is also worth a read.
I highly recommend reading [0], which contains the simplest (IMO) description of the simplex algorithm, which is both mathematical and executable. If you find that inspiring, [1] is also worth a read.
[0] https://www.jsoftware.com/papers/DFSP.htm
[1] http://www.eecg.toronto.edu/~jzhu/csc326/readings/iverson.pd...