Programming in the minimal two-dimensional esoteric programming language 1L_a is pretty difficult, as there are only a few instructions. However, using some creative strategy, 1L_a has been proved to be Turing-Complete.

History

1L_a is designed by Scott Feeney in 2005. It is the first member to be implemented in the 1L_a family. It's well known due to its simplicity.

Contents

  1. The language
  2. Flattened 1L_a
  3. Simple statements
  4. Making larger programs
This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.