# Laconic

Jump to navigation
Jump to search

**Laconic** is a programming language that compiles to a one-tape two-symbol Turing machine. The goal for its creation was to create two-symbol Turing machines with very few states (a golfed Turing machine) that does something interesting when started on a blank tape. Laconic is a strongly-typed language that supports recursive functions.

Laconic was created by Adam Yedidia in 2016.

## External resources

- Adam Yedidia; Scott Aaronson, "A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory" (2016), pre-print of the article defining Laconic.
- Scott Aaronson, "The 8000th Busy Beaver number eludes ZF set theory: new paper by Adam Yedidia and me" (2016-05-03), blog post,
*Shtetl-Optimized*. - GitHub repository probably containing an implementation of Laconic, documentation, and Laconic programs.