Talk:Sansism
From Esolang
[edit] Sansism without wire-crossing
How about this, for a proof that Sansism is Turing-complete even if wire-crossing is banned (much like Archway2): The proof is by showing that wire-crossing-less Sansism can emulate Brainfuck. The following equivalences are as usual:
+ + - - , , . . > ! < ##!##
[ and ] need special treatment. The following equivalences are used:
G1 [ >* *G2
1G
] *G>*
-
2+G
The * symbols indicate where the code enters and exits each block. The 1 and 2 have to be on corresponding rows; they can be moved up or down to allow for inner loops. A > is placed right at the start of the program. For instance, the (pointless) Brainfuck program +[-[>]-]+ becomes:
G G
G G
>!G>-G>+
- -
>-G +G
>+G +G
which contains no wire-crossings. (The program slopes gradually from bottom-left to top-right). --ais523 12:43, 22 May 2006 (UTC)

