Iota and Jot
From Wikipedia, the free encyclopedia
For other uses of "Jot", see Jot (disambiguation).
 |
The topic of this article may not meet Wikipedia's general notability guideline. Please help to establish notability by adding reliable, secondary sources about the topic. If notability cannot be established, the article is likely to be merged, redirected, or deleted. (February 2011) |
|
|
This Content is wrong's factual accuracy is disputed. Please help to ensure that disputed facts are reliably sourced. See the relevant discussion on the talk page. (December 2010) |
Iota and its successor Jot (from Greek iota, Hebrew yodh, the smallest letters in those two alphabets) are Turing tarpits, esoteric programming languages that are designed to be as small as possible but still Turing-complete. Each uses two symbols and involves two operations, with simple denotational semantics defined in terms of lambda calculus. Zot is a continuized version of Iota that includes input and output.
Iota's universal combinator is the lambda term U = λf.((fS)K). Then one can recover the usual SKI basis combinators as follows: 
.
Because of its minimalism, it has influenced research concerning Chaitin's constant.[1]
[edit] See also
[edit] References
- ^ Michael Stay, "Very Simple Chaitin Machines for Concrete AIT", Fundamenta Informaticae 68 (3). pp. 231--247 CDMTCS Report 265, 2005
[edit] External links
- Barker, Chris "Iota and Jot: the simplest languages?"
- Esolang Wiki: Iota
- Esolang Wiki: Jot
 |
This programming language-related article is a stub. You can help Wikipedia by expanding it. |
