Abuse filter log

''''Jot''' (pronounced /dʒɑt/) is a [[Turing tarpit]] designed by [[Chris Barker]], described as "a better Gödel-numbering" than its "sister language" [[Iota]]. 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 [''F''0] -> [''F'']SK [''F''1] -> &lambda;x.&lambda;y.[''F''](xy) -> S(K[''F'']) (Above, <code>[''F'']</code> converts the Jot program <code>''F''</code> into [[lambda calculus]]/[[combinatory logic]]) == Converting combinatory logic to Jot == {K} -> 11100 {S} -> 11111000 {''AB''} -> 1{''A''}{''B''} (Above, <code>{''X''}</code> converts the combinatory logic expression <code>''X''</code> into Jot) Note that to make the <code>{''AB''}</code> rule work, this translation satisfies the stronger property <code>[''F''{''A''}] = [''F''](''A'')</code>. 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== * [http://www.nyu.edu/projects/barker/Iota/#Goedel Jot: a better Goedel-numbering] ([http://web.archive.org/web/20201112014512/http://www.nyu.edu/projects/barker/Iota/ archived version]) [[Category:Languages]] [[Category:Turing complete]] [[Category:Turing tarpits]] [[Category:Functional paradigm]] [[Category:No IO]] [[Category:Implemented]] [[Category:2001]]'