Differences from brainfuck
- Input is loaded into the tape at the beginning of execution.
- Cells can only hold a
- The only instruction that modifies the tape is the 'swap' instruction, which swaps the contents of the current cell with the cell to the right.
||Swaps the values of the current cell and the cell to the right.|
||Move the cell pointer to the left.|
||Move the cell pointer to the right.|
||Jump past the matching |
||Jump back to the matching |
||Adds the bit at the current cell to the output queue. When the output queue reaches a size of 8, it is emptied and the corresponding UTF-8/ASCII character is printed.|
If the input tape contains sufficient consecutive pairs of
1 0, a swapfuck program could operate on each pair as if it was a single, flippable bit.
 loops were replaced with ones that looped while the current cell was zero, not non-zero, a finite input tape of
1 1 1 1 1 1 would allow a program to simulate three-cell unbounded brainfuck, which is Turing complete. The tape is split into 6, interleaved bit streams - the first three represent the values of the cells, and the last three are used simply to find the beginning of the tape while remembering the current cell position.
Performing Turing complete computations in regular swapfuck is more difficult, but likely not impossible. The tape could be split into 3 + n interleaved bit streams, where n is the number of bits required to keep track of the current register in use and invert its value for seeking. Then, we only need a finite number of 1s for this bookkeeping, as we can lug them around with intensive swapping.
A rough implementation of swapfuck in Lua is available here.