Talk:Javagony Turing-completeness proof

Based on the lead paragraph I was expecting this proof to show a method for translating Javagony programs to brainfuck programs. I don't think that's what it's doing though. It looks like all it's doing is decrementing a number until it reaches zero. IMHO it would be much cooler, and a much more convincing proof, if this program was actually just a brainfuck interpreter written in Javagony (and I don't think this would require much more effort -- it's already halfway there). --Chris Pressey (talk) 11:13, 2 July 2020 (UTC)

Very cool. I may try to extend the interpreter to be compatible with brainfuck, including I/O, if I find I have some spare time (not hugely likely atm though.) --Chris Pressey (talk) 10:47, 8 July 2020 (UTC)