User blog comment:Boboris02/MBOT/@comment-1605058-20161218195724/@comment-1605058-20161219113158

By the way, let me point out that what you describe in the Examples section looks like MBOT is supposed to work a bit like a framework for formal grammars. This is especially visible in the first two examples - you are giving some rewriting rules which one has to follow. If you were to formalize the system in this context though, you would require an infinite alphabet, since you need a symbol for every positive integer, and similarly the number of production rules would be infinite. Also, \(\union\) can be expressed in this way as well, but you again need a separate rule for every integer \(a\). Still, a lot of work would be necessary to put MBOT in this framework.

Unfortunately, this doesn't let one make any sense out of your uncomputable example.