Talk:DJN OISC

wheres the proof that this is TC? Gggfr (talk) 04:20, 13 October 2024 (UTC)

There's a "proof" in the linked article, but the language is underspecified on this page, and is missing a lot of details about how DJN works in Redcode. It's also only Turing-complete if you have unbounded cells, which implies that some sort of optimiser is needed because programs run in time proportional to the size of the cells (thus, you need to be able to optimise the infinite loop into a finite loop). --ais523 13:35, 13 October 2024 (UTC)