Ooh, I see you've also pondered interpreters of Thue and brainfuck in /// / Itflabtijtslwi. I haven't got around to actually writing anything, but maybe I should mention to you the ideas I've had which I thought might be useful for this:
- Since Thue is nondeterministic, there should be no harm in implementing Thue substitutions directly as /// substitutions acting in parallel at all possible target spots of the (suitably encoded) Thue string.
- For brainfuck , I think it would be a good idea to parse into a format that contains the nesting level of the , in a way that can be decremented and incremented automatically. That way I think you can "easily" rearrange things at the top level without needing to worry about matching through deeper ones.
- For the BF cell contents, I figured that a binary encoding using 0 = a and 1 = ab (for some a and b, similarly to what's in my binary to unary converter) would make it possible to do all of +->< with a finite number of substitutions each.
--Ørjan 01:06, 14 July 2011 (UTC)