Talk:MiniBitMove
Jump to navigation
Jump to search
I think this language is actually even less powerful than LBA. More specifically, this program is equivalent to XOR by a constant. Here is the proof
- Repeat the input program and take the first n zeroes and all bits before it, where n is the length of the tape
- Split the string by zero
- For each substring, get modullo 2 of the length of the string.
- Read it as bitstring to be XOR-ed to the tape.