Programming in 1L a: Difference between revisions
| [checked revision] | [pending revision] |
Content deleted Content added
No edit summary |
displaytitle |
||
| Line 15: | Line 15: | ||
{{shelves|Esoteric programming languages}} |
{{shelves|Esoteric programming languages}} |
||
{{Status|25%}} |
{{Status|25%}} |
||
{{DISPLAYTITLE:Programming in 1L_a}} |
|||
Latest revision as of 01:00, 27 April 2024
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
[edit | edit source]1L_a was designed by Scott Feeney. Released in 2005, it is the first member to be implemented in the 1L_a family. It's well known due to its simplicity.
Contents
[edit | edit source]