←2024-03-20 2024-03-21 2024-03-22→ ↑2024 ↑all
00:01:14 <hppavilion[1]> I don't have specific ideas for such a language off the top of my head, but imagine one where !$ means to stop execution if the tree is nontrivial, ~ means to delete the root node, and [subprogram] means to map `subprogram` over all children of the root node. [!$~] would delete all leaf children of the root node. [[!$~]] would delete all leaf grandchildren of the root node.
00:02:16 <hppavilion[1]> Imagine that ^ creates a new leaf child of the current tree. If I wanted to produce the tree given by (()(())(()())) I could do ^{^^}^{$^}^
00:02:32 <hppavilion[1]> Er, ^{^^}^{!$^}^
00:14:32 <Sgeo> Is Lagrange a decent enough Gopher browser, even though it's intended for Gemini?
00:15:07 <Sgeo> Gemini's kind of cool, and client certificates as authentication is very cool, although there are limitations, and I assume the web is heading in that direction (but more thought out)
00:54:09 <hppavilion[1]> ok i got sucked into the tree rewriting language actually. What I really need is a good way to deeply recurse through the tree.
01:02:33 <hppavilion[1]> I can delete child-leaves with {$#~} (slight change to the syntax, $# does what !$ did), grandchild-leaves with {{$#~}}, great-grandchild leaves with {{{$#~}}}, and so on. I can delete all leaves down to great-grandchildren with {$#~}{{$#~}}{{{$#~}}}, but I don't think there's any way to reliably reach the canopy at runtime.
01:03:25 <hppavilion[1]> Actually, for that matter, I don't even think there's a way to make an arbitrarily deep tree at runtime.
01:06:18 <esolangs> [[Talk:-Output]] https://esolangs.org/w/index.php?diff=125025&oldid=124426 * EvyLah * (+309) please implement +output instead if you're gonna do an implementation
01:08:43 -!- Hooloovoo has quit (Quit: ZNC 1.8.2+deb2+b1 - https://znc.in).
01:12:39 -!- Hooloovoo has joined.
01:15:53 <fizzie> I remember reading someone's very angry article about the total uselessness of TLS client certificates, but not any of the specifics.
02:05:48 <esolangs> [[Mapfuck]] https://esolangs.org/w/index.php?diff=125026&oldid=78638 * Purah126 * (+20)
02:12:40 <esolangs> [[RC4 Mapfuck]] N https://esolangs.org/w/index.php?oldid=125027 * Purah126 * (+553) Created page with "'''This is a WIP.''' RC4 Mapfuck is an esoteric programming language created by [[User:Purah126]]. It is kind of like normal Mapfuck, but instead uses RC4 to change the map. Each instruction has an ID: * + = 0 * - = 1 * > = 2 * < = 3 * [ = 4 * ] = 5 * . = 6 * , =
02:14:33 <esolangs> [[RC4 Mapfuck]] https://esolangs.org/w/index.php?diff=125028&oldid=125027 * Purah126 * (+182)
02:49:51 <zzo38> fizzie: If I knew what was the details then I might know if it is applicable to Gemini (or to Scorpion)
02:50:50 <zzo38> Sgeo: I don't know; I have not used Lagrange. I had started writing my own, although I will have to check that I have not forgotten anything important in the design of the data structures and general about the program, to do it. (Currently, I just use astroget (which is similar than curl) for accessing files from Gemini.)
02:53:23 <zzo38> Myself and some other people do have criticisms of Gemini, such as that the TLS is mandatory, and that the response header does not tell you the size of the file, lack of range requests, etc. There are also some less common criticisms, such as Han unification. (So, I made my own, which handles some of these, but others I have deliberately rejected)
02:56:29 <zzo38> I have also seen a criticism of using TLS at all. The specification of Scorpion document and file format has a link to it in the section titled "Security issues". In order to avoid needing to read that document just to find one link, I will also mention it here: gemini://gemini.ctrl-c.club/~stack/gemlog/2022-02-13.notls.gmi
02:57:56 <zzo38> (I am opposed to mandatory TLS, which is why Scorpion specification allows both TLS and non-TLS and strongly suggests to implement non-TLS, even if TLS is also implemented.)
03:01:56 <zzo38> (Note that, this document against TLS, itself requires TLS.)
03:06:33 <zzo38> hppavilion[1]: OK, although you might should want to have some other commands, e.g. create a child node and then immediately use it with a subprogram, and possibly others (e.g. to reach the canopy like you said, and make deep trees). I understand what you have so far but I think it is not enough to do much with it, it seem to me.
03:07:13 <zzo38> (Possibly, the command to find a leaf and find the parent node, and to ignore a specific branch, or to delete and store in a register to put it back later?)
03:43:43 <esolangs> [[Ferntape]] M https://esolangs.org/w/index.php?diff=125029&oldid=125024 * RainbowDash * (+79) /* Interpreter in JavaScript */
03:52:35 -!- amby has quit (Quit: so long suckers! i rev up my motorcylce and create a huge cloud of smoke. when the cloud dissipates im lying completely dead on the pavement).
04:51:00 -!- Hooloovoo has quit (Ping timeout: 252 seconds).
04:51:11 -!- Hoolootwo has joined.
07:34:13 -!- chiselfuse has quit (Remote host closed the connection).
07:34:50 -!- chiselfuse has joined.
07:47:01 -!- tromp has joined.
07:48:39 -!- Sgeo has quit (Read error: Connection reset by peer).
08:04:08 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
08:09:42 -!- Koen_ has joined.
08:35:21 -!- tromp has joined.
09:24:37 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
09:54:15 <hppavilion[1]> I did consider "create leaf, immediately run subprogram", but set it aside. I'm pretty sure it's technically unnecessary, though as a matter of convenience it's certainly a good idea.
10:06:07 -!- Koen_ has quit (Remote host closed the connection).
10:06:23 <hppavilion[1]> The format evolved so there's a single boolean register called FLAG and a boolean stack for restoring the content of FLAG after subprograms (and for passing flags up from subprograms)
10:08:35 <hppavilion[1]> # jumps to the end of the subprogram if FLAG is set to true, ! inverts the value of flag, and $ sets flag to TRUE if the root node has no children, else sets it to FALSE. {subprogram} pushes the flag onto the stack, maps the subprogram over all children of the root node, then pops flag back off the stack.
10:09:15 <hppavilion[1]> (subprogram) just runs subprogram as-is. So if you want to set FLAG to False, you can do (!#!), if you want to set it to True you can do (#!).
10:10:58 <hppavilion[1]> The really weird one is +. + takes the current value of FLAG and ORs it in-place with the top value on the stack (that is, stack top = stack top | FLAG)
10:13:22 <hppavilion[1]> That way, if you run (!#!){subprogram*}, then FLAG will be TRUE iff any of the iterations set the flag, (!#!){subprogram!+}! sets FLAG to TRUE iff all of the iterations set the flag
10:20:08 <hppavilion[1]> oh hey, $ is redundant. (!#!){!+}.
10:20:23 -!- Lord_of_Life has quit (Ping timeout: 264 seconds).
10:21:11 -!- Lord_of_Life has joined.
10:27:03 -!- hppavilion[1] has quit (Quit: Leaving).
10:35:56 -!- tromp has joined.
11:23:10 <esolangs> [[]] https://esolangs.org/w/index.php?diff=125030&oldid=123838 * Kaveh Yousefi * (+617) Added a hyperlink to my implementation of the programming language on GitHub and supplemented several page categories.
11:27:54 <esolangs> [[]] https://esolangs.org/w/index.php?diff=125031&oldid=125030 * Kaveh Yousefi * (+484) Supplemented two further examples, one being a repeating cat program, the other a countdown printer.
11:32:49 -!- __monty__ has joined.
11:36:55 <esolangs> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=125032&oldid=124903 * PrySigneToFry * (+43) /* Introductions */
11:38:28 <esolangs> [[User talk:PrySigneToFry]] https://esolangs.org/w/index.php?diff=125033&oldid=124797 * PrySigneToFry * (+39) /* Programming */
11:39:45 <esolangs> [[FRAK]] M https://esolangs.org/w/index.php?diff=125034&oldid=35237 * None1 * (+23)
11:40:49 <esolangs> [[Brainfuck code generation]] M https://esolangs.org/w/index.php?diff=125035&oldid=124914 * None1 * (+11) /* Languages that compile to brainfuck */
11:41:47 <esolangs> [[MarioLANG]] https://esolangs.org/w/index.php?diff=125036&oldid=121433 * PrySigneToFry * (+2) /* Cat program */
11:49:54 <esolangs> [[Esolang talk:Categorization]] M https://esolangs.org/w/index.php?diff=125037&oldid=120646 * None1 * (+194) /* Languages that ignore chars or strings */
12:10:02 -!- Koen_ has joined.
12:13:20 -!- tromp has quit (Read error: Connection reset by peer).
12:14:51 -!- Koen_ has quit (Ping timeout: 260 seconds).
12:19:08 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=125039&oldid=124996 * Qawtykit * (+11)
12:47:21 <esolangs> [[Special:Log/upload]] upload * None1 * uploaded "[[File:BrainPi.png]]": [[BrainPi]] logo
12:49:36 -!- Koen_ has joined.
12:52:55 <esolangs> [[BrainPi]] https://esolangs.org/w/index.php?diff=125041&oldid=124714 * None1 * (+40)
12:59:18 <esolangs> [[User talk:PrySigneToFry]] https://esolangs.org/w/index.php?diff=125042&oldid=125033 * None1 * (+369) /* About Binary */ Everything that can run on a computer uses binary
13:00:16 <esolangs> [[User talk:PrySigneToFry]] M https://esolangs.org/w/index.php?diff=125043&oldid=125042 * None1 * (+3)
13:22:38 -!- __monty__ has quit (Ping timeout: 264 seconds).
13:23:42 <esolangs> [[]] https://esolangs.org/w/index.php?diff=125044&oldid=124505 * PrySigneToFry * (-1) /* Syntax */
13:24:24 -!- Koen_ has quit (Quit: Leaving...).
13:29:25 <esolangs> [[Domino Crisis]] https://esolangs.org/w/index.php?diff=125045&oldid=124995 * PrySigneToFry * (+173)
13:31:40 <esolangs> [[Special:Log/upload]] upload * PrySigneToFry * uploaded "[[File:Domino.webp.jpg]]"
13:32:15 <esolangs> [[Domino Crisis]] https://esolangs.org/w/index.php?diff=125047&oldid=125045 * PrySigneToFry * (-76)
13:36:10 <esolangs> [[Say]] N https://esolangs.org/w/index.php?oldid=125048 * None1 * (+1258) Created page with "{{lang|a=User:None1}} ==Syntax== Things in square brackets are optional, but if one is given, the others most be given too. ''Variable'': "[Yes/No, ]''Variable2'', it is ''Value''[, not ''String'']" Value can be: * A string (surrounded by single quotes), then the string is s
13:38:58 <esolangs> [[Say]] M https://esolangs.org/w/index.php?diff=125049&oldid=125048 * None1 * (+0) /* Truth Machine */
14:01:32 <esolangs> [[10]] N https://esolangs.org/w/index.php?oldid=125050 * Yourusername * (+689) Created page with "10 has two valid chars, 1 and 0, whitespace like newline, space, and tab are also valid, all other chars are comments == Syntax of program == [x]+ in syntax is x happens 1 or more times [anything] in syntax means any of the other syntax things [x]? in syntax is x happ
14:04:58 <esolangs> [[10]] https://esolangs.org/w/index.php?diff=125051&oldid=125050 * Yourusername * (+137)
14:05:51 <esolangs> [[10]] https://esolangs.org/w/index.php?diff=125052&oldid=125051 * Yourusername * (+49) /* 3 program */
14:19:40 <esolangs> [[Stackack]] N https://esolangs.org/w/index.php?oldid=125053 * Yourusername * (+586) Created page with "Stackack (STACK stACK) is a programming language that uses stacks and stacks and stacks and stacks == Stack == ~a stack is defined as new stack stack1 = new stack ~to add an item, do stack.place stack1.place("stacks are awsome") ~to remove an item, do stack.ta
14:23:29 <esolangs> [[A+B Problem]] https://esolangs.org/w/index.php?diff=125054&oldid=124925 * Cleverxia * (+143)
14:25:17 <esolangs> [[SplitLang]] N https://esolangs.org/w/index.php?oldid=125055 * Yourusername * (+653) Created page with "SplitLang is a programming language that uses splitting, or forking == Split command == #going to line 2 split: #wait what, there is another me on line 4 #ok I guess ill go here, line 3 split2: #hi other code pointer on line 2 #i will also go to line 5 == Joi
14:28:44 <esolangs> [[SplitLang]] https://esolangs.org/w/index.php?diff=125056&oldid=125055 * Yourusername * (+1155)
14:30:42 <esolangs> [[A+B Problem]] https://esolangs.org/w/index.php?diff=125057&oldid=125054 * Cleverxia * (-2580) /* JSFuck */
14:33:38 <esolangs> [[A+B Problem]] https://esolangs.org/w/index.php?diff=125058&oldid=125057 * Cleverxia * (-6037) /* JSFuck */
14:33:55 <esolangs> [[A+B Problem]] https://esolangs.org/w/index.php?diff=125059&oldid=125058 * Cleverxia * (-17) /* JavaScript */
14:38:08 -!- Sgeo has joined.
14:48:05 -!- amby has joined.
14:49:51 -!- Noisytoot has quit (Excess Flood).
14:52:38 -!- Noisytoot has joined.
14:57:11 <esolangs> [[DCI]] N https://esolangs.org/w/index.php?oldid=125060 * Cleverxia * (+855) Created page with "[[DCI]] (Decrement then Copy [if successful]) is an [[OISC]]. ==Specifications== *address 0 is always 1. *IP is mapped to 1. *the commands are memory mapped from addresses 2 to infinity. the values beyond the commands are initially 1. **IP=0 means address 2, etc. *decremen
15:00:11 <esolangs> [[Flow Uncontrolled]] N https://esolangs.org/w/index.php?oldid=125061 * Qawtykit * (+1264) Created page with "'''Flow Uncontrolled''' is a language that requires self modification to do pretty much anything. ==Arguments== The language has three instructions, written like Python function calls. The instructions all have at least 1 argument. Arguments can be strings,
15:00:11 <esolangs> [[OISC]] https://esolangs.org/w/index.php?diff=125062&oldid=124842 * Cleverxia * (+129) /* List of OISCs */
15:52:05 <esolangs> [[Ferntape]] M https://esolangs.org/w/index.php?diff=125063&oldid=125029 * RainbowDash * (+1) oops that is not a stack thats a queue
16:20:55 -!- __monty__ has joined.
16:58:04 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=125064&oldid=125039 * Qawtykit * (+24)
17:00:06 -!- chiselfuse has quit (Ping timeout: 260 seconds).
17:01:24 -!- chiselfuse has joined.
17:01:34 <esolangs> [[Flow Uncontrolled]] https://esolangs.org/w/index.php?diff=125065&oldid=125061 * Qawtykit * (+79)
17:04:38 -!- chiselfuse has quit (Remote host closed the connection).
17:06:25 -!- chiselfuse has joined.
17:16:11 <esolangs> [[Bracket]] https://esolangs.org/w/index.php?diff=125066&oldid=124350 * PaxtonPenguin * (+19)
17:17:53 -!- Everything has joined.
17:46:27 -!- Koen_ has joined.
17:48:07 -!- Joao[3] has joined.
17:50:00 <esolangs> [[Ferntape]] M https://esolangs.org/w/index.php?diff=125067&oldid=125063 * RainbowDash * (+0)
18:11:56 -!- drummyfish has joined.
18:13:15 <drummyfish> Hello, is there an esolang that lets you write the program in any other language? What I mean is a language in which the first line of source code specifies the programming language and the rest is just code in that language.
18:15:32 <zzo38> Maybe you can use the shebang line
18:16:23 <Joao[3]> Shebangs can even use any program
18:16:47 <Joao[3]> You can't run other CPU architectures though
18:17:56 <drummyfish> Hmm, didn't think of that :D
18:18:11 -!- Hoolootwo has quit (Quit: ZNC 1.8.2+deb2+b1 - https://znc.in).
18:19:34 -!- Hooloovoo has joined.
18:23:14 <esolangs> [[Flow Uncontrolled]] https://esolangs.org/w/index.php?diff=125069&oldid=125065 * Qawtykit * (+1332) more examples yay
18:25:39 <esolangs> [[Flow Uncontrolled]] M https://esolangs.org/w/index.php?diff=125070&oldid=125069 * Qawtykit * (+45) lol
18:49:24 -!- drummyfish has quit (Quit: Client closed).
18:52:22 -!- Joao[3] has quit (Quit: Bye!).
19:21:21 -!- tromp has joined.
19:32:54 <b_jonas> `olist 1300
19:32:56 <HackEso> olist <https://www.giantitp.com/comics/oots1300.html>: shachaf oerjan Sgeo FireFly boily nortti b_jonas
19:38:30 -!- tromp has quit (Read error: Connection reset by peer).
19:38:42 -!- rodgort has quit (Quit: Leaving).
19:53:26 -!- Koen_ has quit (Remote host closed the connection).
20:00:35 -!- rodgort has joined.
20:10:19 <b_jonas> ok, now I wonder what would happen if three beholders stared at each other in a 3-cycle, each trying to magically cancel the next one's magic. would the game end in a draw from an infinite loop immediately? or does D&D have layering rules for this?
20:13:17 <b_jonas> also two beholders staring at each other with their magic-cancelling eye-beam is a bistable flip-flop that you can toggle using a third beholder staring at one of them, right? and you can use one beholder staring at two others to copy the negation of a signal, or two beholders staring at one for a nor gate, so you could build whole computers from beholders.
20:14:17 <b_jonas> admittedly it's not a *practical* way to build a computer
21:13:52 -!- SGautam has joined.
22:54:24 -!- __monty__ has quit (Quit: leaving).
23:17:13 <Noisytoot> is the anti-magic eye-beam itself magical (and therefore affected by others) or not?
23:20:40 <esolangs> [[Joke language list]] https://esolangs.org/w/index.php?diff=125071&oldid=124902 * None1 * (+54) /* General languages */
23:23:22 <b_jonas> Noisytoot: I think it's magical but I'm not sure.
23:23:46 <b_jonas> there's a spell Antimagic Field that has the same temporary magic-suppression effect though on a different shape
23:23:50 <esolangs> [[User:None1]] https://esolangs.org/w/index.php?diff=125072&oldid=124923 * None1 * (+55)
23:25:48 <b_jonas> specifically Antimagic Field suppresses spell-like abilities or supernatural abilities of monsters, and it's unlikely that the antimagic eye-beam is not one of those
23:27:03 <esolangs> [[Say]] M https://esolangs.org/w/index.php?diff=125073&oldid=125049 * None1 * (+37) /* Syntax */
23:28:16 <b_jonas> hmm wait
23:29:28 <b_jonas> maybe the antimagic eye beam suppresses the other antimagic eye beam, but only in its volume, so it's not like you can just antimagic a beholder and his whole eye-beam is suppressed, only the part of the eye-beam that is in the antimagic field that's suppressed
23:30:24 <b_jonas> in that case suppressing an anti-magic eye-beam with another anti-magic eye-beam would be effectively useless unless you somehow find creatures whose anti-magic eyebeams are somehow observably different
23:32:04 <b_jonas> that would be sad, because then you couldn't build logic circuits from it
23:34:57 <b_jonas> if the computer worked it would probalby be a PSPACE-oracle, such that you can set it up for any PSPACE problem, it draws the game if there's no solution to that problem, but you can read a solution if there is one
23:35:37 <b_jonas> so with enough beholders you could break our encryption schemes
23:36:33 <b_jonas> it'd still be an unreasonably high number of beholders, just not exponential, only a number that's a polynomial in the execution time of decoding the encryption
←2024-03-20 2024-03-21 2024-03-22→ ↑2024 ↑all