The K-coupling language. Variables, user-defined functions, control flow, lists, recursion. Small, expression-oriented, parses cleanly. K(x) = x/(1+x). R(x) = 1/(1+1/x). E(x) = x × kT·ln(2). T(x) = K(x) − R(x). The four primitives plus a real language around them.
New to Turbo? — Take the tutorial
x = K(1.868)let x = 5 in K(x)if R(x) > INV_PHI
then "locked"
else "free"fn double(x) = x * 2map(fn(x) = K(x),
[0.5, 1.0])fn fact(n) =
if n < 2 then 1
else n * fact(n-1)[K(0.5), K(1.0), K(1.868)]map(K, range(5))closures capture
their environmentTurbo is a domain-specific language for K/R/E/T coupling computation. Like SQL is for queries. Like regex is for patterns. Like KaTeX is for math typesetting. Constrained on purpose. The four primitives are the load-bearing semantics; the language around them is variables, functions, control flow, lists, recursion — enough to write coupling computations cleanly, not enough to write a web server. That’s by design.
Turing-complete via recursion, but most useful programs are small. The point isn’t replacing Python. The point is having a vocabulary an AI in the GUMP framework parses natively, and a syntax that compresses coupling math to its minimum form.
Your data stays on your machine. Deterministic: same input, same output, every time. No eval injection — identifiers must be defined in the environment.