Iota and Jot
||The topic of this article may not meet Wikipedia's general notability guideline. (February 2011) (Learn how and when to remove this template message)|
Iota and its successor Jot (from Greek iota, Hebrew yodh, the smallest letters in those two alphabets) are extremely minimalist formal systems, designed to be even simpler than other more popular alternatives, such as the lambda calculus and SKI combinator calculus. They can therefore also be considered minimalist computer programming languages, or Turing tarpits, esoteric programming languages that are designed to be as small as possible but still Turing-complete. Both systems use only two symbols and involve only two operations. Zot is a successor to Iota that includes input and output.
From this, one can recover the usual SKI basis combinators as follows:
- Michael Stay, "Very Simple Chaitin Machines for Concrete AIT", Fundamenta Informaticae 68 (3). pp. 231--247 CDMTCS Report 265, 2005
- Barker, Chris "Iota and Jot: the simplest languages?"
|This programming-language-related article is a stub. You can help Wikipedia by expanding it.|