Talk:ONLY STACK mini

You can leave comments and code comment in any language.

Implementations in any programming language(python, js, jsfuck, C, C++, C#, bf, Piet, Whitespace, and so on.) are welcome!

Forth(by Jan Pilavik)

( I can't write code well. (´°̥̥̥̥̥̥̥̥ω°̥̥̥̥̥̥̥̥｀) )
: 実際の加算命令ではない擬似加算命令  OVER OVER + ;
: 実際の減算命令ではない擬似減算命令  OVER OVER - ;
: 実際の乗算命令ではない擬似乗算命令  OVER OVER * ;
: 実際の除算命令ではない擬似除算命令  OVER OVER / ;

comment:

Forthは消費するからOVERがある Jan Pilavik (talk) 14:14, 7 August 2026 (UTC)

Forth idea(by Jan Pilavik)

STACK=this is top $\left[G_{1},G_{2},G_{3}\ldots \right]$
$G_{n}=2^{a_{n1}}\times 3^{a_{n2}}\times 5^{a_{n2}}\ldots$

$p_{n}^{-1}=\operatorname {add} \left(n,m\right)$
$p_{n}^{-2}=\operatorname {sub} \left(n,m\right)$
$p_{n}^{-3}=\operatorname {mul} \left(n,m\right)$
$p_{n}^{-4}=\operatorname {div} \left(n,m\right)$
$p_{n}^{-5}=\operatorname {POW} \left(n,m,l\right)$
$\operatorname {POW} \left(n,m,l\right)=n^{\frac {m}{l}}$

example:
$G_{1}=2^{-1}\times 3^{2}\times 5^{-5}\times 7^{2}\times 11^{1}\times 13^{2}$ is $\operatorname {add} \left(2,\operatorname {POW} \left(2,1,2\right)\right)$

$G_{2}=2^{-2}\times 3^{0}\times 5^{1}$ is $\operatorname {sub} \left(0,1\right)=-1$

$G_{3}=2^{-5}\times 3^{-2}\times 5^{0}\times 7^{1}\times 11^{1}\times 13^{2}$ is $\operatorname {POW} \left(\operatorname {sub} \left(0,1\right),1,2\right)=i$

comments

これで任意の数が表せる　Jan Pilavik (talk) 01:41, 9 August 2026 (UTC)

ONLY_STACK miniコード→ONLY_STACK_mini_to_Forth.py→Forthのように Jan Pilavik (talk) 02:45, 9 August 2026 (UTC)

指数を+5することで浮動小数による誤差がなくなる Jan Pilavik (talk) 05:18, 10 August 2026 (UTC)

最小化の難しさが段違いだ Jan Pilavik (talk) 13:39, 10 August 2026 (UTC)

計算式の最小化ね Jan Pilavik (talk) 15:14, 12 August 2026 (UTC)