This unassuming little calculator turned out to be a far more powerful beast than its appearance would suggest. A 1430-step program memory, conditional execution and loops, a simple subroutine functionality, and 26 named variables make a respectable machine.

Programs are basically algebraic formulae, with a few special operators that allow repeated or conditional execution. A program line is limited to 160 characters, but with up to nine "subroutine" lines, it is possible to use all of program memory in a single program. This allows for fairly complex solutions to be programmed into this calculator.

One demonstration is a program that computes the natural logarithm of the Gamma function, implemented here using Stirling's formula. A simple loop extends the domain of this implementation to all negative numbers (except for negative integers of course) yielding a full 10 digits of precision for most arguments. Newlines have been inserted here for clarity, but they don't need to be keyed in when entering this program into the calculator.

f(X)=1⇒G
  \(\llcorner\rightarrow\)X>5•N→[
    GX⇒G
    X+1⇒X\(\leftarrow\urcorner\)
  ]
  XLN X-X+LN √(2π÷X)-LN G+
  ((((1÷1188÷X2-1÷1680)÷X2+1÷1260)÷X2-1÷360)÷X2+1÷12)÷X