Alana is a highly responsive Turing Machine simulator with many examples, like (unary and binary) addition, subtraction and multiplication, "copy band content", string parsing examples, and divisibility and primality testing. The documentation contains an introduction to Turing Machines as well as some interesting theoretical information (halting problem, busy beaver, universal Turing Machines) and pointers to further literature.
| Tags | Scientific/Engineering Mathematics Software Development Interpreters |
|---|---|
| Licenses | GPL |
| Implementation | Tcl |
Recent releases


Changes: Four new examples have been added: another string parsing example, "copy tape content", a divisibility test, and a primality test. Dialog handling has been improved. The most recent 64 transitions can now be undone. Console mode is now more flexible. The documentation has been heavily corrected and improved.


Changes: Three new examples were added: subtraction, binary addition, and multiplication. Various usability improvements were implemented. Some mistakes in the file loading code were corrected. Console mode is now much faster.


No changes have been submitted for this release.