!itoe Turing-completeness proof

Here, User:↑ will prove the Turing-completeness of !itoe. Compared to bf:

!itoe	BF
tasindu	,
ikunude	[ and ]
+-*/	+ and -
ado	.

We also have variables, so < and > aren't a problem. As so, !itoe is Turing-complete