Talk:ALWCIDFEC

Computational class

How is this Turing Complete? How would it compute something like the Look-and-say sequence? Huh (talk) 15:22, 7 September 2022 (UTC)

You'd probably need several layers of indirect to do anything useful, but it's definitely turing-complete. -PkmnQ (talk) 16:10, 6 January 2023 (UTC)

Still, there should probably be a proof somewhere without asserting that this is turing complete with no evidence. Until such proof appears I'm going to remove this from the turing complete category. Timothytomato (talk) 01:42, 14 July 2024 (UTC)

It's trivially possible to compile 3-cell brainfuck with balanced loops into ALWCIDFEC – the Turing-completeness proof for 3-cell brainfuck uses only balanced loops, so it proves ALWCIDFEC to be Turing-complete too. --ais523 18:23, 14 July 2024 (UTC)