# Jottary

Jump to navigation
Jump to search

Paradigm(s) | functional |
---|---|

Designed by | User:Melvin |

Appeared in | 2023 |

Computational class | Turing complete |

Reference implementation | [1] |

Influenced by | Combinatory Logic, Lambda Calculus, Chris Barker, Jot |

File extension(s) | `.jottary` |

**Jottary** (pronounced /dʒɑteri/) is a Turing tarpit described as "an even better Gödel-numbering" than its sister's Jot "sister language" Iota. It is based on combinatory logic. Every combination of 1's is a syntactically valid Jottary program, including the null program.

## Semantics of Jottary

[] -> I [1_{1}...1_{2n}] -> S(K[1^{n-1}]) [1_{1}...1_{2n+1}] -> (([1^{n}]S)K)

(Above, `[1...1]`

converts the Jottary program `1...1`

into lambda calculus/combinatory logic)

## Converting Jot to Jottary

For a binary Jot string

:
*b*

[b] -> 1^{dec(1b)-1}

This proves Jottary is Turing-complete.

## Related languages

- Jot, Jottary's binary "sister language"
- Iota, Jottary's sister's "sister language"
- Zot, Jot with I/O.