BUT

BUT is a esolang created by User:Yayimhere with 2 unbounded decimal counters(u and r. also if decremented to negative will be set to 0) and 4 functions(i, t ,f and k) and these functions can be changed. it was inspired by Emmental and then most of ais523's works

commands

heres the functions(when i reference y i mean counter y and the same with u):

$f(x)=x+{\frac {y}{10^{\left\lfloor \log _{10}(y)\right\rfloor }+1}}$

$k(x)=\log _{u}(x)^{y}-x$

$t(x)=x-5$

$i(x)=x+2$

syntax

command	description
p/b	apply function p to counter b
[p;q]	redefine function p to the BUT code q(recursive functions are not allowed) where when y is used is the register the function is used on
(q;b)	loop code q(only checking at the brackets) until counter b is 0
:	halt
#	escape loop
|n	goto line n
{b.}	set counter b to user input
{b,}	print counter b as a ascii char

when a function p is redefined the original function is p₀ and the redefined one is p(and such it is for every redefinition. so for the n^th redefinition the function from before the redefinition must now be referenced as p_n-1) and must be referenced

examples

Cat:

{r.}({r,}{r.};r)

translation to Minsky machine

notes:

• this translation uses Short Minsky Machine Notation
• the two registers are u and r

this is the translation:

℘xy <-> t/y i/y i/y(|x#;)
℘y <-> i/y i/y i/y t/y
℘ <-> :

this proves that BUT is Turing-complete. the functions can be redefined:

[t;t/y i/y i/y]
[i;i/y i/y i/y t/y]

and now the translation becomes:

℘xy <-> t/y(|x+2#;)
℘y <-> i/y
℘ <-> :