We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
User talk:Dragoneater67
bf-os
do you wanna join my bf-os project? --Mrtli08 (talk) 18:17, 16 January 2026 (UTC)
- yes, i am exteremely bored right now Dragon Eater SIX SEVEN 18:24, 16 January 2026 (UTC)
- Brain-os source code (not an esolang but an esolang-built OS) Go there to perform edits whenever you want and dont forget to update the manual so the code is not over-obscure --Mrtli08 (talk) 19:34, 16 January 2026 (UTC)
BF-...........OS??? BRAINFUCK OS?????????? ARE YOU SURE???????? This is either the most beautiful or the most cursed thing I've ever heard.
NeurosamaLover (talk) 04:34, 20 February 2026 (UTC)
- its both at the same time dragon eater SIX SEVEN 06:56, 20 February 2026 (UTC)
new esolang i made
Check out Bracky, its basically based off ur ((()))(((())))=5 but its better, far better. YOU CAN GET MULTIPLE LINES OF CODE!!!a
- Better in what way??? c--Yayimhere2(school) (talk) 05:23, 9 April 2026 (UTC)
Reply about Guesslang
75 score:
io is correct
nil is almost correct
The format of indentation is incorrect
ziptext is almost correct
keyboard is correct
rev is correct
T F interpreter thing
Hey there d̪ʁæɠθɳ̩ə̯æ̯ʈɘ̃ʁ67 i would like for you to make a T F interpreter and make an 8-bit adder in it! best regards Esolang lover123 (talk) 14:19, 11 April 2026 (UTC) bye!
- ill try, also, please put new messages on the bottom Dragoneater67mobile (talk) 16:06, 11 April 2026 (UTC)
VoidPtr: FSA and limited memory access.
Hello Dragoneater67,
first of all, thank you for viewing the page! Really appreciate it.
I saw that you wrote that VoidPtr can't arbitrarily access any cell, and removed it from the Turing completeness category, even though calling the system call $4 repeatedly allows to allocate infinite memory in theory.
(Maybe because I wrote that exact system calls aren't core language features?)
Infinite memory access is possible through direct addressing, by just writing a number. Only indirect access is limited to 255, because a cell holds 1 byte.
I would appreciate it if you could further explain why you decided to change the categories.
Edit: Just saw the talk, sorry. So VoidPtr is turing complete, the exact BF implementation I wrote in VoidPtr isn't, it's just an example. VoidPtr itself supports infinite addresses.
I will add a disclaimer for the BF interpreter and change the categories back.