# Lag Turing-completness proof

Jump to navigation
Jump to search

Here is how you can translate Brainfuck program to Lag.

## TCPL

It has 4 commands:

inc;x;

increment variable `x`

dec;x;

decrement variable `x`

start;x;y;

Start loop `x`

until `y`

will be zero

end;x;y;

End loop `x`

## Translating BF to TCPL

Commands `>`

and `<`

are not implemented, you need to switch variables you use.
Equaletent of `+`

and `-`

are `inc;x`

and `dec;x`

.

[...]

are:

start;loop;x;y; ... end;loop;x;y;

## TCPL to Lag

Translator can be found in Github repository