I am working on a physical breadboard 8bit CPU that directly interpret brainfuck.
The language specification indicates that both opening and closing brackets have logic :
[ => Jump to matching ] If Zero
] => Jump to matching [ Unless Zero
But with the way I made my CPU I can't implement the first rule, finding the matching closing bracket will be hard.
What would be the consequences of changing the opening bracket logic to doing nothing and only keep the closing bracket logic ? Does it affect the Turing completeness of the language ?
I know it won't really be Brainfuck anymore and existing programs may no longer work properly, for example :
[+.]
classic brainfuck: won't do anything
my modified brainfuck: will print every character from 0 to 255 (or an overflow error if cells don't loop back to 0)