Jot

From Esolang

Jot is a Turing tarpit designed by Chris Barker, described as "a better Goedel-numbering". Every combination of 0's and 1's is a syntactically valid Jot program, including the null program.

Contents 1 Semantics of Jot 2 Converting combinatory logic to Jot 3 Related languages 4 External resources

[edit] Semantics of Jot

[]      ->   I
[F0]    ->   [F]SK
[F1]    ->   λxy.[F](xy)

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

[edit] Converting combinatory logic to Jot

[K]     ->   11100
[S]     ->   11111000
[AB]    ->   1[A][B]

(Above, [X] converts the combinatory logic expression X into Jot)

This proves Jot is Turing-complete.

[edit] Related languages

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

[edit] External resources

• Jot: a better Goedel-numbering