|
|
| Line 1: |
Line 1: |
| {{Other uses of|Jot|Jot (disambiguation)}}
| | Hi there, I am Andrew Berryhill. Mississippi is exactly where her home is but her husband wants them to transfer. Office supervising is what she does for a residing. It's not a common thing but what I like doing is to climb but I don't have the time recently.<br><br>Feel free to surf to my blog; clairvoyants ([http://hknews.classicmall.com.hk/groups/some-simple-tips-for-personal-development-progress/ http://hknews.classicmall.com.hk]) |
| {{Notability|date=February 2011}}
| |
| | |
| '''Iota''' and its successor '''Jot''' (from [[Greek language|Greek]] [[iota]], [[Hebrew]] [[yodh]], the smallest letters in those two alphabets) are extremely minimalist [[formal system]]s, designed to be even simpler than other more popular alternatives, such as the [[lambda calculus]] and [[SKI calculus|SKI combinator calculus]]. They can therefore also be considered minimalist computer programming languages, or [[Turing tarpit]]s, [[esoteric programming language]]s 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 continuized version of Iota that includes input and output.
| |
| | |
| Iota's universal combinator has a very simple structure (defined here using [[denotational semantics]] in terms of the [[lambda calculus]]):
| |
| | |
| {{Center|<math>U = \lambda f.((fS)K)</math>}}
| |
| | |
| From this, one can recover the usual [[SKI_combinator_calculus#SKI_expressions|SKI basis combinators]] as follows:
| |
| | |
| {{Center|<math>I\, =\, (UU),\; K\, =\, (U(U(UU))), \;S\, =\, (U(U(U(UU))))</math>}}
| |
| | |
| Because of its minimalism, it has influenced research concerning [[Chaitin's constant]].<ref>Michael Stay, [http://arxiv.org/abs/cs.IT/0508056 "Very Simple Chaitin Machines for Concrete AIT"], ''Fundamenta Informaticae 68 (3). pp. 231--247 CDMTCS Report 265'', 2005</ref>
| |
| | |
| ==See also==
| |
| *[[Lambda calculus]]
| |
| *[[Combinatory logic]]
| |
| *[[Binary combinatory logic]]
| |
| *[[SKI calculus|SKI combinator calculus]]
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| | |
| ==External links==
| |
| * Barker, Chris "[http://semarch.linguistics.fas.nyu.edu/barker/Iota/ Iota and Jot: the simplest languages?]"
| |
| * [http://esolangs.org/wiki/Iota Esolang Wiki: Iota]
| |
| * [http://esolangs.org/wiki/Jot Esolang Wiki: Jot]
| |
| | |
| {{DEFAULTSORT:Iota And Jot}}
| |
| [[Category:Esoteric programming languages]]
| |
| | |
| | |
| {{Compu-lang-stub}}
| |
Hi there, I am Andrew Berryhill. Mississippi is exactly where her home is but her husband wants them to transfer. Office supervising is what she does for a residing. It's not a common thing but what I like doing is to climb but I don't have the time recently.
Feel free to surf to my blog; clairvoyants (http://hknews.classicmall.com.hk)