ALWCIDFEC
Jump to navigation
Jump to search
ALWCIDFEC(A Language Where Commands Is Different For Each Cell) is variant of 3-cell brainfuck, where as it says in title, commands are different for each cell you use.
Instructions
| BF / For cell 1 | For cell 2 | For cell 3 |
|---|---|---|
| + | * | 4 |
| - | / | 1 |
| [ | ( | { |
| ] | ) | } |
Examples
Infinite loop
Cell 1:
+[]
Cell 2:
*()
Cell 3:
4{}
A+B Problem
++++**(+/)
Any amount of +'s and * will be added togeter
Computational class
Assuming the ALWCIDFEC interpreter uses unbounded (or unbounded positive) integers, it is trivial to compile a 3-cell brainfuck program into ALWCIDFEC unless it uses unbalanced loops. The Turing-completeness proof for 3-cell brainfuck does not use unbalanced loops, so it also proves that ALWCIDFEC is Turing-complete.