Talk:Comefrom0x10

Turing completeness

I listed this as Turing complete because it probably is and I wrote a brainfuck interpreter with it. Trouble is, the brainfuck interpreter uses standard library functions written in Python, so I'm not 100% sure. Obvious physical memory limitations aside, I'm not really certain how you'd implement an unbounded array in Cf0x10 without relying on the implementation detail of Python strings.

Julfers (talk) 03:19, 14 July 2017 (UTC)