Examine individual changes
Jump to navigation
Jump to search
This page allows you to examine the variables generated by the Abuse Filter for an individual change.
Variables generated for this change
Variable | Value |
---|---|
Edit count of the user (user_editcount) | 0 |
Name of the user account (user_name) | 'Tubs' |
Age of the user account (user_age) | 151 |
Page ID (page_id) | 1033 |
Page namespace (page_namespace) | 0 |
Page title (without namespace) (page_title) | 'Jot' |
Full page title (page_prefixedtitle) | 'Jot' |
Action (action) | 'edit' |
Edit summary/reason (summary) | '/* External resources */ Barker's website is temporarily unavailable' |
Old content model (old_content_model) | 'wikitext' |
New content model (new_content_model) | 'wikitext' |
Old page wikitext, before the edit (old_wikitext) | ''''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] -> λx.λ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]
[[Category:Languages]]
[[Category:Turing complete]]
[[Category:Turing tarpits]]
[[Category:Functional paradigm]]
[[Category:No IO]]
[[Category:Implemented]]
[[Category:2001]]' |
New page wikitext, after the edit (new_wikitext) | ''''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] -> λx.λ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]]' |
Unified diff of changes made by edit (edit_diff) | '@@ -27,5 +27,5 @@
==External resources==
-* [http://www.nyu.edu/projects/barker/Iota/#Goedel Jot: a better Goedel-numbering]
+* [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]]
' |
New page size (new_size) | 1479 |
Old page size (old_size) | 1375 |
Lines added in edit (added_lines) | [
0 => '* [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])'
] |
Unix timestamp of change (timestamp) | 1607611248 |