#12. Strict Less-Than

Note

If you have any ideas or enhancements for this page, please edit it on GitHub!

Following documentation is a cooperative result combined from our Discord chat and numerous pull requests. Thanks to everyone who helped!

Image

This image was produced from the twelfth radio transmission using previously contributed code.

This partly annotated version of the image was made using code from message #3.

Interpretation

Operator 416 is consistent with checking whether the first number is strictly less than the second number. We will denote it as lt.

Decoded

lt
ap ap lt 0 -1   =   f
ap ap lt 0 0   =   f
ap ap lt 0 1   =   t
ap ap lt 0 2   =   t
...
ap ap lt 1 0   =   f
ap ap lt 1 1   =   f
ap ap lt 1 2   =   t
ap ap lt 1 3   =   t
...
ap ap lt 2 1   =   f
ap ap lt 2 2   =   f
ap ap lt 2 3   =   t
ap ap lt 2 4   =   t
...
ap ap lt 19 20   =   t
ap ap lt 20 20   =   f
ap ap lt 21 20   =   f
...
ap ap lt -19 -20   =   f
ap ap lt -20 -20   =   f
ap ap lt -21 -20   =   t
...

Code

The Haskell code has been revised to decode new glyphs.

Example output: