546372

The title of this article is not correct because of technical limitations. The correct title is actually 54637272.

54637272 (pronounced "fifty-four, sixty-three, seventy-two") is an esoteric programming language by User:Aadenboy.

The language has a counter that is an unbounded integer starting at one. Each command is a triplet of three numbers Y, B, and G. The program infinitely loops. Each of the three cases are checked in order, with the first applicable case that has an observable effect running.

1. If the factorization of the counter has Y or less instances of G, skip the next B commands. B and G must be greater than 1. Every prime factor of G is checked.
2. If the factorization of the counter has B or more instances of Y, multiply the counter by G. Y and G must be greater than 1. Every prime factor of Y is checked.
3. If the factorization of the counter has G or more distinct prime factors, divide the counter by B, then skip the next Y commands. B must be greater than 1.

$\left.(p,c)\right|_{a}={\begin{cases}(p+B,c)&{\text{if }}B>1,G>1,{\text{and }}\forall n\mid G,\nu _{n}(c)\leq Y\\(p,Gc)&{\text{if }}Y>1,G>1,{\text{and }}\forall n\mid Y,\nu _{n}(c)\geq B\\(p+Y,{\frac {c}{B}})&{\text{if }}B>1{\text{ and }}\omega (c)\geq G\\(p,c)&{\text{otherwise}}\end{cases}}$

Examples

A+B Problem

02003232 03002727 0222 3033 0422

02 00 32
03 00 27
0 2 2
3 0 3
0 4 2

Computational class

54637272 is Turing-complete by translation to multiplicative simple system.

Multiplicative simple system

*SS	54637272
Scale by n	20nn if n is an integer, otherwise 0m0m where m is the reciprocal of n.
While n is a factor	0nee ............ 0n1n 02EE, where e is the number of commands in the block, and E is the number of commands outside the block.

See also

• mAME