Jot

Jot (pronounced /dʒɑt/) is a Turing tarpit designed by Chris Barker, described as "a better Gödel-numbering". It is based on combinatory logic. Every combination of 0's and 1's is a syntactically valid Jot program, including the null program.

Semantics of Jot
[]     ->   I [F0]    ->   [F]SK [F1]   ->   &lambda;x.&lambda;y.[F](xy)  ->  S(K[F])

(Above,  converts the Jot program   into lambda calculus/combinatory logic)

Converting combinatory logic to Jot
{K}    ->   11100 {S}    ->   11111000 {AB}   ->   1{A}{B}

(Above,  converts the combinatory logic expression   into Jot)

Note that to make the  rule work, this translation satisfies the stronger property.

This proves Jot is Turing-complete.

Related languages

 * Iota, Jot's "sister language", described in the same article.
 * Zot, Jot with I/O.

External resources

 * Jot: a better Goedel-numbering