Please turn JavaScript on

Esolang - Recent changes [en]

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  98.79 / day

Message History

Truth machine

← Older revision Revision as of 13:38, 22 November 2026 (3 intermediate revisions by the same user not shown) Line 30: Line 30:

==Examples== ==Examples== Programming in this language is very confusing and challenging because of the ‌imbalance. ===[[Cat program]] (never terminat...

Read full story

Lean

← Older revision Revision as of 13:22, 22 November 2026 Line 469: Line 469: The formulas uniquely define the kolakoski sequence even without a(0) = 1 and a(1) = 2 [https://vllladd.github.io/lean-projects/Projects/Kolakoski/Recurrence.html#Kolakoski.sum_sub_eq_and_sum_eq_iff_kolakoski]. The formulas uniquely define the ...

Read full story

Turing-completeness: implemented

← Older revision Revision as of 13:13, 22 November 2026 (4 intermediate revisions by the same user not shown) Line 17: Line 17: | {{cd|,}} || Input a byte, add it by 11, and store it in current cell. | {{cd|,}} || Input a byte, add it by 11, and store it in current cell. |- |- |...

Read full story

Emanator

← Older revision Revision as of 13:01, 22 November 2026 Line 187: Line 187:

=== [[Emanator]] === === [[Emanator]] ===
This program is formally verified [https://vllladd.github.io/lean-projects/Projects/Esolangs/Emanator/Programs/Kolakoski.html#Emanator.getOutput_progKol] ...

Read full story
BFFuck

Syntax

← Older revision Revision as of 12:46, 22 November 2026 Line 32: Line 32: mod(a,x) # Set a to a mod x mod(a,x) # Set a to a mod x lt(a,x) # If a is less than x, set a to 1, otherwise 0 lt(a,x) # If a is less than x, set a to 1, otherwise 0 le(a,x) # If a is less than or equal to x, set a to 1, otherwis...

Read full story