Jot

From Esolang

Jump to: navigation, search
This page has been protected from edits by unregistered users because it is a frequent target for spambots. If you wish to edit it but do not have an account, please either create an account or suggest the text of your edit on the Talk page.

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

Contents

Semantics of Jot 

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

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

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.

Related languages

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

External resources

Retrieved from "http://esolangs.org/wiki/Jot"
Personal tools