Exhaustive search of turing machines with at most N states. Enough fast to search all machines for 1000 steps when N<=4.
Can also do exhaustive search for tape inputs with n bits. (outside 'n bit tape' all values are blank (==0))
No proofing for programs that won't halt, except trivial 'no halt rule' case.
Various other things, like simple backwards search to see what tapes are possible for certain ruleset.
Also included simple random turing machine: Rules can have random direction (left or right).
Can show above normal and random turing machine runs as bitmaps.
Version 0.3.1 here
Hosted by