00:00:00 whoops 00:00:02 uh 00:00:04 oh no 00:00:06 what did I do 00:00:17 uh 00:00:18 fix it 00:00:19 someone 00:00:41 should I unlearn that? 00:01:12 hello? 00:01:21 -!- Lilly_Goodman has joined. 00:01:50 `revert 00:02:04 rm: cannot remove `/home/hackbot/hackbot.hg/multibot_cmds/env/.hg/store/data/canary.orig': Is a directory \ Done. 00:02:21 `? `? 00:02:22 ​`? ¯\(°​_o)/¯ 00:02:45 `? ` 00:02:48 ​` is the prefix to greatness. 00:02:53 phew 00:03:26 rdococ: Here's an evil game idea 00:03:53 rdococ: There are two players running identical programs psedOSes 00:04:27 rdococ: The goal is to hack your enemy to the point that they're unable to play any further, and to continuously patch your computer to block incoming attacks 00:04:38 The code is badly-written and uncommented, and the docs are pretty poor 00:05:01 It's a monstrosity :) 00:05:11 so yo have to edit their program to do stuff? 00:05:55 rdococ: And your own program 00:06:00 and patch your own 00:06:04 crazy 00:06:05 rdococ: It's constrained by simulated compile time 00:06:17 but does it have to be simulated? 00:06:32 (Every line you add is an extra 5 seconds before the changes take hold) 00:06:36 do they have access to multiple programs? 00:06:40 rdococ: It does, if we want the computers to not die 00:06:43 rdococ: How so? 00:06:50 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:06:57 rdococ: What do you mean "Multiple programs"? 00:07:14 you could edit one program of the other's computer, then edit another program while they're trying to patch the one you edited first 00:07:36 rdococ: I think you might be able to 00:07:39 -!- Lilly_Goodman has quit (Ping timeout: 264 seconds). 00:08:12 what about negative data 00:08:16 rdococ: There'd be "log::pt", which is a file documenting changes. You have to refresh it every so often. 00:08:25 rdococ: Oh, absolute value 00:08:32 Removing 10 lines is just as bad as adding 10 00:08:43 It wouldn't be line-by-line though, it'd be a sort of "AST measurer" 00:08:54 -!- Lilly_Goodman has joined. 00:10:25 why not actually simulate the program code in a sandbox environment? 00:10:37 rdococ: It would. 00:10:45 it'd be fun if each program had different languages 00:10:50 rdococ: YEEEEEEEEEEEEEES. 00:11:08 rdococ: We need to get on this 00:11:22 we could even have some esoteric ones 00:11:41 rdococ: Yes, that was a plan 00:11:44 (as easter eggs) 00:11:51 I think we should call it H4X1N470R-MP 00:12:01 also, hacking programming languages 00:12:13 what are lose conditions? 00:12:15 rdococ: Hacking programming languages? 00:12:22 rdococ: When you are no longer able to play 00:12:33 rdococ: Probably when all user input is disabled for the client 00:12:41 Well, the user-proper 00:12:49 Not sure how to test for that though... 00:13:25 hmm 00:13:47 rdococ: I mean, I can think of one way (recursive AST scanning), but it'd be buggy 00:23:35 <\oren\> suppose a program was defined solely by stating what it cannot do 00:25:26 then an empty program can solve the halting problem 00:25:40 <\oren\> or might do something elsr 00:26:01 <\oren\> an empty program is allowed to compile into any program whatsoever 00:26:51 -!- oerjan has joined. 00:28:37 <\oren\> then you have some formal language for specifying program behaviour in terms of logical statements, each of which is always required to be false. 00:30:24 a normal language would be one specifying true statements 00:30:43 right? 00:31:52 not exactly but 00:37:03 -!- Lilly_Goodman has quit (Ping timeout: 264 seconds). 00:37:31 HELLŒRJAN. 00:37:37 -!- hppavilion[1] has quit (Ping timeout: 252 seconds). 00:40:42 boħily 00:42:01 /ħ/ isn't a fun sound hth 00:44:37 -!- Sgeo_ has joined. 00:46:03 -!- Sgeo has quit (Ping timeout: 240 seconds). 00:46:31 boily: it's quantum! 00:47:20 hmm 00:47:29 talking about logical problems 00:48:45 -!- Sgeo__ has joined. 00:49:29 talking about the logical problems that don't talk about themselves 00:50:03 -!- Sgeo_ has quit (Ping timeout: 240 seconds). 00:58:16 -!- tromp_ has joined. 01:02:42 -!- tromp_ has quit (Ping timeout: 260 seconds). 01:09:10 -!- jaboja has joined. 01:13:12 -!- Lilly_Goodman has joined. 01:15:37 is this problem false? 01:15:47 normal computer: CRASH 01:16:35 quantum computer: There is a 60% chance that the problem is true, and a 39% chance it is false. 01:18:36 no 01:19:06 and a 1% chance that you're trying to crash me 01:20:12 rdococ: no. this is not problem false 01:20:52 the NLP module has learned to parse in the other way when the paradox arises 01:22:06 will you say no to this question? 01:22:30 normal computer: Fal--I mean tr--fa--tr 01:24:59 fungot: do you even paradox bro? 01:24:59 boily: you want a high-quality fnord program in general. the general idea 01:25:16 fungot: that is enlightening. tdh. 01:25:17 boily: this is an example from the wiki? looks suddenly sparse.) thanks for your answer. now you might have more luck rebinding space to enter when using the variable name 01:25:46 * boily rebinds the Sacrificial Space. “Fnord! Fnord! Fnord!” 01:29:57 `? fnord 01:30:02 ​? ¯\(°​_o)/¯ 01:30:40 huh. I thought we had a fnordwisdom in there. 01:30:46 ... 01:30:53 wait. 01:31:09 * boily facepalms 01:31:31 -!- mihow has quit (Quit: mihow). 01:31:37 THIS WENT BETTER THAN EXPECTED 01:32:34 embarassingly so. 01:32:51 -!- mihow has joined. 01:39:21 hmm 01:39:31 bonnenuily? 01:40:06 bontopiasoir! 01:40:13 * oerjan sits down to watch the temporal antipode effect 01:40:16 indeed. it's getting quite late, I say. 01:40:31 it's quite convenient 01:40:36 i can always know when he's going to bed 01:40:49 temporal antipode? 01:40:51 what's that 01:40:52 bonne nuitopia! 01:41:00 `? quintopia 01:41:03 quintopia is our resident tl;dr generator. He is flooded by thundercats and thunderdogs. He is the temporal antipode of boily despite living on the same continent. 01:41:20 summer is only a few months away 01:41:29 speak to me of summer ♪ 01:41:32 i'll go back in time 2 hours and overlap him a bit 01:41:38 -!- boily has quit (Quit: COMMITMENT CHICKEN). 01:41:52 oh I get it 01:42:00 wait 01:42:03 temporal antipode? 01:42:08 so opposite time? 01:42:12 oh 01:42:14 he's nocturnal 01:42:15 duh 01:42:31 even though it's 2:42 am where I am 01:42:51 which could be in africa 01:43:03 but is probably in britain 01:43:04 or on mars 01:43:04 -!- XorSwap has quit (Quit: Leaving). 01:43:10 what is rdococland? 01:43:14 it could be in britain too 01:43:21 rdococland? 01:43:33 good idea for a name to an esolang 01:44:06 yes but what real country would it be in 01:44:10 what city would it house 01:44:11 hmm 01:44:14 on mars 01:44:16 no 01:44:31 in magic yay world 01:44:37 colorful 01:45:13 rdococulous 01:45:37 fungot: is rdococ an AI or is there some other reason e's evading the question 01:45:37 oerjan: anmaster must see. 01:45:39 I know it sounds duckoo but it's troo 01:45:55 Vorpal: fungot says you must see this hth 01:45:55 oerjan: and no, that would explain why the video output isn't working properly 01:46:16 fungot: am I an AI? 01:46:16 rdococ: sorry, didn't read properly. a question of whether the loop was loopzored", i wouldn't expect car and cdr returned copies, hmph. 01:46:41 fungot: I said, am I an AI emulating a human brain? 01:46:41 rdococ: i like to use _, then __, then ___, et cetera; and no record type descriptor operations such as vector-ref vector-set!. 01:46:47 ... 01:46:48 what country do you currently reside, person currently to emself as rdococ? 01:46:57 rdococland 01:47:23 I told you, I reside in an esolang 01:47:30 i'll just pretend you live in the same country as the server you are connected to for ease 01:47:43 what server am I connected to 01:47:53 adams (budapest) 01:48:08 rdococ: shouldn't that be an esoland, really 01:48:13 oerjan: lol 01:48:18 speak to me of esolangs 01:48:36 see? I'm not from britain at all. I'm from rdococland. 01:48:45 the esoland 01:49:00 @time rdococ 01:49:01 which is located in budapest 01:49:12 hmph 01:49:14 it is? 01:49:17 I thought it was on mars 01:49:40 sorry, there are still a few bugs in me 01:49:48 no, on mars you find london and o'wobble. that's what i recall from Blackadder, anyway. 01:49:59 what? 01:50:15 it may have been the very last downer episode 01:50:30 he tries to get himself certified insane 01:50:47 by claiming he's from mars 01:51:12 alas, his superior is too smart/stupid 01:51:42 -!- Lilly_Goodman has quit (Ping timeout: 244 seconds). 01:52:53 -!- oerjan has set topic: Note: people with cloaks will be treated as if they're from Budapest | The international hub of esoteric programming language and font design | http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/?C=M;O=D | The kitten typesetting channel. 01:52:59 oerjan: is your palmaris longus present/discernible? 01:53:27 ironically, b_jonas doesn't have a cloak 01:53:42 huh 01:53:43 weird 01:54:43 -!- Lilly_Goodman has joined. 01:55:03 quintopia: is it that big vertical one on the wikipedia picture? if so, yes 01:55:35 https://twitter.com/johnregehr/status/715089198819241984 01:55:42 if i flex my hand just right, anyway 01:57:26 right on 02:14:38 HOla necesito una mega ayuda 02:15:17 Lilly_Goodman: nosotros no ayudamos en espanol 02:16:03 quintopia es que quiero saber como decir la hora en ingles 02:16:31 the time 02:17:33 google translate 02:17:54 tu eres en el canal incorrecto, sabes? 02:19:15 !bienvenido Lilly_Goodman 02:19:24 does that not work 02:19:30 ` 02:19:45 quintopia: we've tried long ago 02:20:04 quintopia quiero decir en ingles... son las nueve y media 02:20:09 quintopia gracias 02:21:35 Lilly_Goodman: ir a un canal de habla espanola por favor 02:23:11 and it is nowhere near 9:30 here 02:23:59 ir a what 02:25:00 -!- Lilly_Goodman has quit (Ping timeout: 250 seconds). 02:26:14 -!- Kaynato has joined. 02:29:07 -!- Lilly_Goodman has joined. 02:31:01 hola alguien me ayuda a decir que son las nueve y media... en ingles??????????? 02:33:30 hola a what 02:33:38 -!- ChanServ has set channel mode: +o oerjan. 02:33:59 +oerjan 02:34:36 ayuda 02:34:44 -!- oerjan has set channel mode: +b *!*canaima@*.dyn.movilnet.com.ve. 02:34:44 -!- oerjan has kicked Lilly_Goodman Tomar una pista. 02:35:06 -!- oerjan has set channel mode: -o oerjan. 02:35:36 rude 02:35:44 izabera: she(?)'s been refusing to take a hint for over a week 02:36:49 that doesn't make it less rude 02:37:18 -.- 02:37:27 why so many non english stuff 02:37:33 unless you're referring to "Tomar una pista" which i have no idea what means except it's what G.T. gives for "take a hint" 02:37:56 i meant the ban 02:38:04 my brssim of dddipr rexhsaiuxzsted 02:38:40 izabera: i've been tempted for a week. she _refuses_ to speak in english, or to go anywhere people can understand her. 02:39:06 does she speak C? 02:39:07 (well, she apparently doesn't know english well enough.) 02:39:17 or Prolog? 02:39:48 ?- pun(programmingLanguage, linguisticLanguage) 02:39:48 Maybe you meant: v @ ? . 02:39:58 also, those who _have_ tried to speak in spanish (mostly with G.T. which is horrible) have not been able to get any indication she's interested in our actual channel _topics_. 02:40:19 does she even know what this channel is about? 02:40:56 rdococ: well she's seen our `bienvenido message in spanish. i'm not sure she's at the point where she understands what it means. 02:41:52 haha "people with cloaks will be treated as if they're from Budapest" 02:42:13 oerjan: sounds like she uses google translate 02:43:20 izabera: she's either a strange troll or too maladapted for us to handle. i'm not sure. 02:43:37 rdococ: are you saying her spanish isn't right? 02:43:53 I was thinking she's faking it to be honest 02:44:08 since she didn't get the bienvenido message 02:44:13 rdococ: she hails from a venezuelan ip so it seemed logical it is her native language. 02:44:23 k 02:44:50 rdococ: could be though. however i meant "didn't get" as in pays no attention to it, as if she doesn't know what programming means. 02:45:09 hmm 02:45:10 okay 02:45:17 `? rdococ 02:45:19 RDOCOCLIKESTOMAKELANGUAGESLIKETHIS 02:45:32 `learn rdococ Apparently from Budapest, but probably not. 02:45:38 Relearned 'rdococ': rdococ Apparently from Budapest, but probably not. 02:45:57 `learn rdococ is apparently from Budapest, but probably not. 02:45:59 Relearned 'rdococ': rdococ is apparently from Budapest, but probably not. 02:46:35 hmm 02:46:45 is there a programming paradigm that has not been done yet 02:47:00 oh what about 02:47:03 program-oriented 02:47:17 PrOgram-Oriented 02:47:57 paradigm-oriented, clearly. 02:48:07 (unless Oz is that) 02:48:10 how would that even work 02:48:14 i dunno 02:49:29 izabera: also, she said she had been banned from #canaima-social(?) so she's presumably grating even to those who _do_ understand her. 02:49:50 i've been banned from a dozen channels 02:50:02 I think I have been banned from a few 02:50:07 >_> 02:50:12 OKAY 02:50:19 whut 02:51:28 ok i get it, getting banned is no proof of anythin (except maybe that you're weird but we all are here.) 02:51:32 *+g 02:52:26 or that they're shit channels. 02:53:51 defocus is a shit channel? 02:54:03 THOSE WERE ALTERNATIVES 02:54:20 oh my god -.- 02:54:26 I'm weird? 02:54:31 * oerjan perhaps shouldn't do joke shouting at this point 02:54:41 rdococ: like a platypus hth 02:54:53 what? I knew you weren't really angry 02:55:04 good, good 02:55:13 BUT I'M WEIRD? 02:55:19 Yay! 02:56:03 * rdococ yawns 02:56:03 yw 02:56:51 [wiki] [[User:Rdococ]] M https://esolangs.org/w/index.php?diff=46701&oldid=46670 * Rdococ * (+14) yay added BASICER to my list 02:57:46 what do you think of BASICER? 02:58:10 -!- tromp_ has joined. 03:00:03 -!- lambda-11235 has joined. 03:03:15 -!- tromp_ has quit (Ping timeout: 276 seconds). 03:03:31 -!- heroux has quit (Ping timeout: 248 seconds). 03:03:41 I like the idea of a bas icer. Is that like a cake decorator who only does single layer cakes? 03:04:21 rdococ: I am curious, what paradigm is Daoyu 03:04:24 -!- heroux has joined. 03:05:41 kaynato: dunno 03:05:51 proof: no, basicer 03:05:59 prooftechnique: my esolang 03:06:17 I know, I was making a very oblique joke 03:06:28 *hth 03:06:44 ha ha 03:06:46 base icer 03:07:04 I was thinking like bas relief, but yeah, the principle is the same 03:07:52 Have I gotten a chance to show you the language I have made? 03:08:04 what is it? 03:08:15 BASRELIEF, the language you go to when you're just too fed up with BASIC 03:09:02 Daoyu: https://esolangs.org/wiki/Daoyu 03:09:12 I'm trying to think of a way to implement conditionals with only GOTO just to make BASICER complete :D 03:09:28 prooftechnique: computed goto? 03:10:09 I don't think BASICER's goto can do that. 03:10:11 GOTO 100*(a>b)+200 03:10:13 ok 03:10:50 -!- tromp_ has joined. 03:11:23 wut 03:11:38 I guess they kind of already exist, if you take the user as an oracle 03:12:01 there are no variables, how do you expect conditionals 03:12:08 arthur-merlin model, with the user as merlin 03:13:56 *protocol 03:14:23 @rdococ: is there a possibility you can help me with some C memory problems? 03:14:23 Unknown command, try @list 03:14:38 why are you asking me 03:15:09 You seem to be an experienced authority figure 03:15:16 I do? 03:15:28 I...suppose? 03:15:41 :s 03:16:14 well, I'm about to fall asleep, and I don't know all that much, ask someone else 03:16:50 Alright, thanks 03:16:53 but thanks for the compliment 03:17:31 channel.Sleep(awkward silence) 03:17:35 *chirp* 03:18:58 i'm sure there's some authority on C here. 03:19:08 i mean, there are IOCCC winners here. 03:19:26 this may or may not help in this case. 03:19:38 * oerjan pokes tromp_ and Gregor 03:19:55 (the latter only out of principle) 03:20:28 (and i'm not sure the former appreciates it either) 03:20:36 * rdococ snores loudly 03:20:52 Most surprisingly portable is a great honor 03:24:56 -!- shikhin has quit (Read error: Connection reset by peer). 03:25:24 -!- fungot has quit (Ping timeout: 246 seconds). 03:25:45 -!- sewilton has quit (Ping timeout: 246 seconds). 03:27:43 -!- Lymia has quit (Ping timeout: 246 seconds). 03:27:43 -!- fractal has quit (Ping timeout: 246 seconds). 03:27:43 -!- dingbat has quit (Ping timeout: 246 seconds). 03:28:54 -!- incomprehensibly has quit (Ping timeout: 246 seconds). 03:32:03 -!- jameseb has quit (Ping timeout: 246 seconds). 03:32:03 -!- nitrix has quit (Ping timeout: 246 seconds). 03:32:03 -!- glogbot has quit (Ping timeout: 246 seconds). 03:32:09 -!- esowiki has joined. 03:32:13 -!- esowiki has joined. 03:32:14 -!- esowiki has joined. 03:33:09 -!- esowiki has joined. 03:33:13 -!- esowiki has joined. 03:33:14 -!- esowiki has joined. 03:34:09 -!- esowiki has joined. 03:34:11 -!- glogbot has joined. 03:34:13 -!- esowiki has joined. 03:34:14 -!- esowiki has joined. 03:34:56 -!- sewilton_ has changed nick to sewilton. 03:35:27 -!- dingbat_ has changed nick to dingbat. 03:35:34 -!- tromp_ has quit. 03:36:13 ack 03:36:16 -!- nitrix- has quit (Changing host). 03:36:16 -!- nitrix- has joined. 03:36:20 -!- nitrix- has changed nick to nitrix. 03:36:31 -!- incomprehensibly has joined. 03:37:52 -!- tromp has joined. 03:39:05 -!- tromp has quit (Remote host closed the connection). 03:39:53 -!- tromp has joined. 03:47:35 [wiki] [[Special:Log/newusers]] create * Kc kennylau * New user account 03:47:46 [wiki] [[///]] https://esolangs.org/w/index.php?diff=46702&oldid=40418 * Kc kennylau * (+4) /* Binary to unary conversion */ 04:01:19 [wiki] [[Binary to unary conversion]] N https://esolangs.org/w/index.php?oldid=46703 * Kc kennylau * (+1729) Created page with "A '''binary to unary conversion''' program is a program that can convert a given number in binary form to a unary form. It is mainly used to showcase [[Markov algorithm]] ([ht..." 04:01:21 [wiki] [[Retina]] https://esolangs.org/w/index.php?diff=46704&oldid=45838 * Kc kennylau * (+110) 04:01:59 [wiki] [[Binary to unary conversion]] https://esolangs.org/w/index.php?diff=46705&oldid=46703 * Kc kennylau * (+28) 04:02:57 [wiki] [[Binary to unary conversion]] https://esolangs.org/w/index.php?diff=46706&oldid=46705 * Kc kennylau * (+92) /* Retina */ 04:03:17 [wiki] [[Retina]] https://esolangs.org/w/index.php?diff=46707&oldid=46704 * Kc kennylau * (+103) 04:07:03 -!- tromp has quit (Ping timeout: 244 seconds). 04:28:33 -!- Kaynato has quit (Ping timeout: 240 seconds). 04:32:35 -!- mihow has quit (Quit: mihow). 04:47:00 @tell hppavilion[1] http://dl.acm.org/citation.cfm?id=96559.96570 has &lgr; for some reason. I have no clue what that entity means <-- it's a lambda hth 04:47:00 Consider it noted. 04:51:06 @tell rdococ so there is no turing complete machine with only one register? <-- fractran. 04:51:06 Consider it noted. 05:01:18 -!- ais523 has joined. 05:03:48 -!- fractal has joined. 05:04:32 -!- tromp has joined. 05:09:22 -!- lambda-11235 has quit (Quit: Bye). 05:23:14 -!- tromp has quit (Ping timeout: 260 seconds). 05:23:49 https://api.left-pad.io/?str=test&len=12&ch=%22 05:23:55 it got fixed :-D 05:32:29 ais523, that's clearly a semver violation, they should put a version number somewhere. I suggest in the domain name just after .io 05:32:58 is it a semver violation if you don't /have/ a version number? 05:37:07 is it a semver violation if you use one of the noncompliant examples from the spec? 05:37:19 ais523: api.0.1.left-pad.io 05:37:27 note that it is for the version 1.0 06:20:01 -!- tromp has joined. 06:22:28 -!- hppavilion[1] has joined. 06:26:27 -!- tromp has quit (Ping timeout: 260 seconds). 06:27:25 -!- hppavilion[1] has quit (Ping timeout: 252 seconds). 06:40:02 -!- tromp has joined. 06:45:45 -!- tromp has quit (Ping timeout: 268 seconds). 06:51:57 -!- lleu has joined. 08:21:49 -!- J_Arcane has quit (Ping timeout: 252 seconds). 08:42:08 -!- tromp has joined. 08:47:33 -!- tromp has quit (Ping timeout: 240 seconds). 08:49:42 -!- Effilry has changed nick to FireFly. 09:00:05 -!- ais523 has quit. 09:15:11 brilliant! the ziped multiple html download of the POSIX spec from opengroup.org is so posixy it has two filenames that are equal case insensitively (_exit.html and _Exit.html) so you can't extract all of it on non-unixy file systems. 09:27:06 b_jonas: they may very well have the same contents, too 09:27:24 http://pubs.opengroup.org/onlinepubs/009695399/functions/exit.html describes those and exit 09:29:14 `fetch http://pubs.opengroup.org/onlinepubs/009695399/functions/_exit.html 09:30:01 2016-03-31 09:29:34 URL:http://pubs.opengroup.org/onlinepubs/009695399/functions/_exit.html [25309/25309] -> "_exit.html" [1] 09:30:01 * oerjan emulates fred astaire 09:30:05 `fetch http://pubs.opengroup.org/onlinepubs/009695399/functions/_Exit.html 09:30:08 2016-03-31 09:29:49 URL:http://pubs.opengroup.org/onlinepubs/009695399/functions/_Exit.html [25309/25309] -> "_Exit.html" [1] 09:30:24 `` diff _?xit.html 09:30:36 No output. 09:30:39 `` diff _?xit.html 09:30:42 No output. 09:30:49 b_jonas: yep 09:31:01 `` rm -v _?xit.html 09:31:03 removed `_exit.html' \ removed `_Exit.html' 09:36:00 -!- jaboja has joined. 09:41:53 -!- jaboja has quit (Ping timeout: 244 seconds). 10:00:34 -!- jaboja has joined. 10:06:27 * oerjan thinks today's mezzacotta comic is strangely coherent. 10:09:14 i would recommend it to fungot, but e's not heeeeeeeeeeeeeAAAAA 10:26:19 mezzacotta? 10:28:51 http://www.mezzacotta.net/ 10:38:32 -!- oerjan has quit (Quit: Later). 10:44:07 -!- tromp has joined. 10:46:15 -!- boily has joined. 10:49:46 -!- tromp has quit (Ping timeout: 252 seconds). 10:51:11 doesn't look that impressive 11:04:22 -!- jaboja has quit (Remote host closed the connection). 11:12:16 -!- dingbat has quit (Quit: Connection closed for inactivity). 11:20:16 -!- ^v has quit (Ping timeout: 264 seconds). 11:22:00 -!- boily has quit (Quit: ALMOST CHICKEN). 11:22:50 -!- ^v has joined. 11:22:51 -!- Deewiant has quit (Ping timeout: 244 seconds). 11:23:28 -!- Deewiant has joined. 11:46:32 [wiki] [[Special:Log/newusers]] create * Midnightas * New user account 11:52:08 -!- Reece` has joined. 11:56:11 [wiki] [[Pylongolf]] N https://esolangs.org/w/index.php?oldid=46708 * Midnightas * (+451) Created page with "= Pylongolf = Pylongolf is a simple stack-based language created by [http://midnightasgames.ga MidnightasGames]. == Adding to stack == Adding to the stack works differently t..." 11:56:25 -!- jameseb- has changed nick to jameseb. 12:05:22 -!- augur_ has quit (Read error: Connection reset by peer). 12:05:42 -!- augur has joined. 12:23:07 -!- ak48 has joined. 12:24:50 -!- ak48 has quit (Quit: node-irc says goodbye). 12:26:01 -!- Sgeo__ has quit (Ping timeout: 252 seconds). 12:29:25 -!- AnotherTest has joined. 12:40:03 -!- ^v has quit (Ping timeout: 248 seconds). 12:40:17 -!- augur has quit (Read error: Connection reset by peer). 12:40:55 -!- augur has joined. 12:41:03 -!- augur has quit (Read error: Connection reset by peer). 12:41:46 -!- augur has joined. 12:46:13 -!- tromp has joined. 12:46:57 -!- ^v has joined. 12:51:37 -!- tromp has quit (Ping timeout: 250 seconds). 13:09:34 am I the only one who didn't make a brain**** derivative when I first joined? 13:35:29 -!- Guest6809 has joined. 13:41:19 -!- p34k has joined. 13:48:41 no 13:48:53 i didn't do it either 13:50:48 -!- lambda-11235 has joined. 13:51:32 rdococ: I still have to resist it VERY hard, because there's a good one I know but I want to make sure it's never made. I'll have to figure out how to do it elegantly without brainfuck, but I haven't yet. 13:53:03 I'll probably have to adapt it to underload if possible. 14:04:34 rdococ: I have not made any esolangs, yet :v 14:06:34 did you made... any prooving technique 14:11:42 The only technique you need is "trust me" :D 14:18:56 oh, the jedi trick? 14:19:17 prooftechnique: but what do you do with those users who are immune to mind tricks? 14:19:48 I bet we have some of those on this channel 14:20:42 Then you just invoke descent theory and everyone gives up 14:29:15 [wiki] [[Evil]] https://esolangs.org/w/index.php?diff=46709&oldid=30837 * Kc kennylau * (+165) 14:35:24 Question. On windows 10, how do I configure the system to not turn off the monitor so quickly when on the lock screen? 14:35:35 [wiki] [[Evil]] https://esolangs.org/w/index.php?diff=46710&oldid=46709 * Kc kennylau * (+105) /* 0 to 255 using only a, e, u, z (To be completed) */ 14:36:15 -!- J_Arcane has joined. 14:36:46 I tried to change the "Power Options" in control panel, but that only lets me change how quickly the monitor turns off when the login isn't locked. 14:39:01 Ah, I see 14:39:26 I tried a google search, and I found some webpages mentioning strange registry entries. 14:39:48 Although most of them are about Windows 8 and they don't seem directly applicable. 14:42:21 -!- spiette has joined. 14:42:46 also found another webpage with a different solution that might work: https://support.microsoft.com/en-us/kb/2835052 14:43:32 hmm 14:45:15 I have trouble trying to turn up the brightness on my monitor 14:45:26 no matter what setting I set, it always looks the same 14:48:16 -!- tromp has joined. 14:50:01 -!- lambda-11235 has quit (Quit: Bye). 14:54:34 -!- tromp has quit (Ping timeout: 240 seconds). 14:57:02 -!- bender| has joined. 15:04:40 -!- Kaynato has joined. 15:06:53 is there a number system where 1/0 = infinity? 15:07:41 -!- AnotherTest has quit (Ping timeout: 250 seconds). 15:09:56 rdococ: not if you want the field axioms to be satisfied, I think 15:13:07 hmm 15:13:52 (x/y)*y = x 15:13:54 so 15:14:02 (x/0)*0 = x 15:14:15 x/y = x * (1/y) 15:14:24 that means x/0 = x * (1/0) 15:14:42 well, there will have to be multiple infinities 15:17:23 -!- Reece` has quit (Read error: Connection reset by peer). 15:22:32 -!- ^v has quit (Ping timeout: 260 seconds). 15:23:16 I always wondered why people keep talking about pi 15:23:22 I prefer the square root of 2 15:23:37 it is the everything number 15:24:36 or i 15:24:41 because it's the number of my dreams 15:25:41 -!- ^v has joined. 15:32:04 I want to make a mathematical system which doesn't calculate things normally so I can do square root of -1 without adding a special case 15:33:25 which I could do 15:33:34 in string substitution 15:33:53 sqrt ($x * $x) = $x 15:34:17 sqrt($x) * sqrt($x) = $x 15:34:20 I think 15:35:46 hmm 15:35:54 how would I make a super-turing complete programming language 15:39:39 adding an oracle is the standard way of doing that 15:40:15 if f(x) does not terminate then ... 15:40:51 but can we break that does not terminate super-complete instruction into smaller ones? 15:41:26 for example, are there other problems that turing complete machines can't solve? 15:42:44 Well, most subsets of the natural numbers are uncomputable... so yes. 15:42:51 The tricky bit is to define one. 15:43:35 well 15:43:38 the issue is 15:43:50 in any system that sounds logical 15:45:24 Would an oracle for the n-th digit of the halting probability (for, say, binary lambda calculus) solve the halting problem... I'm afraid it does? 15:48:44 hmm 15:49:31 how do we divide the halting problem into smaller instructions? basically, a super turing complete language where you need more than one instruction to solve the problem 15:51:50 infact, why not just specify that it computes everything in a finite time 15:51:55 then it's super-turing complete 15:53:56 "everything" 15:56:09 yes 15:56:31 programs that don't halt halt anyway 15:56:38 * int-e is actually hoping for a concrete definition of an oracle that's not computable but cannot solve the halting problem for TMs. 15:56:53 * rdococ wonders what an oracle is 15:57:23 an external entity that answers interesting questions. 15:58:08 are you sure that the halting problem is even well defined? 15:59:34 They're used in computability theory and also in complexity theory. For example a SAT oracle would take a boolean formula and immediately say whether it's satisfiable or not. So people talk about complexities relative to an oracle... P^{NP} would contain problems that can be solved in polynomial time and a polynomial number of queries to an NP oracle (which you can think of as a SAT oracle... 15:59:40 ...because SAT is NP-complete). 16:00:16 rdococ: yes, it is well-defined for Turing machines. 16:00:29 hmmm 16:00:55 hey, turing complete machines can solve it for finite state machines 16:03:11 the "if f(x) halts" construct is not well-defined if you allow recursion, due to its circularity... f := loop while f halts. 16:03:39 I don't understand this. In the rust standard library, why is std::process::Command.spawn not an unsafe function, when it starts a process with an arbitrary executable and so can indirectly cause arbitrary memory access on your process too. 16:04:24 now who would do such things... :P 16:05:01 also, what distinguishes the spawned processes from any other processes that are already running on the system? 16:05:15 by that reasoning, all code is unsafe. 16:05:37 (which is quite close to the truth, but not a useful distinction to make... lacking the distinction) 16:05:56 int-e: sure, if you run unsafe code _once_, and it's not actually safe, then you can get undefined behavior _later_. 16:06:12 but the point is that running only safe code shouldn't be able to do thtat 16:06:24 b_jonas: note that I don't know what kind of safety Rust is trying to model 16:06:34 so opening files or starting processes should count as unsafe 16:06:42 int-e: that is described in the rust book and manuals 16:06:47 * int-e doesn't even know this with complete certainty for Haskell... where he's a bit of an expert. 16:06:47 the safety model that is 16:07:13 well, haskell is sort of different 16:08:15 function f() { while f halts { } } 16:08:20 does the function halt? 16:08:26 the function halts if it does not halt 16:08:34 b_jonas: I was merely trying to clarify that I was voicing an opinion not based on fact but at best on common sense. 16:09:05 hmm 16:09:08 so what about this 16:09:09 rdococ: I think I just wrote that, with slightly different syntaxc 16:09:10 x 16:09:26 make evaluation not go through the whole thing, but just one step - for example 16:09:41 evaluate((3 + 2) + 1) = 5 + 1 16:09:43 not 6 16:10:13 hmm 16:10:52 pairs of functions that cancel each other 16:11:06 successor(predecessor(x)) = predecessor(successor(x)) = x 16:11:22 sqrt(x^2) = sqrt(x)^2 = x 16:11:59 sqrt(x^2) = |x| 16:12:26 sqrt(-1^2) = 1 16:12:27 true 16:12:40 > -1^2 16:12:41 -1 16:12:48 > (-1)^2 16:12:49 1 16:13:46 x * sqrt(y) = sqrt((x^2) * y) 16:13:49 right? 16:13:56 if x >= 0 16:14:02 hmm 16:14:29 (or y = 0) 16:14:37 so it works if y < 0? 16:14:49 -!- J_Arcane has quit (Ping timeout: 252 seconds). 16:14:58 1 * sqrt(-1) = sqrt((1^2) * -1) 16:15:10 it gets messy if you allow complex numbers 16:15:58 we could make a computer system that treats impossible numbers as if they were normal - basically a way to check if expressions evaluate to the same value without evaluating them 16:16:17 brb 16:18:09 Because of branches... and arbkitrary choices for "principal values". (The same is true for real numbers, but there the mess can be reduced to just discussing signs.) 16:18:10 -!- bender| has quit (Read error: Connection reset by peer). 16:18:30 `? arbkitrary 16:19:03 arbkitrary? ¯\(°​_o)/¯ 16:23:25 fungot, are you arbkitary? 16:27:08 i^2 = j^2 = k^2 means i = j??? 16:27:11 = k??? 16:27:30 no 16:27:59 rdococ: are you looking at quaternions? 16:28:36 maybe 16:28:48 but it breaks rules I find comfortable 16:29:08 rdococ: it's no different than 1^2 = (-1)^2 16:29:20 oh 16:29:21 okay 16:29:23 that makes sense 16:29:37 rdococ: if so, note that multiplication there isn't even commutative, so (i-j)(i+j) = i^2 + ij - ji - j^2 != i^2 - j^2... so i^2 = j^2 does not even imply i = j or i = -j. 16:30:20 (but the distributive laws continue to hold) 16:32:48 (in fact, i^2 + ij - ji - j^2 = 2k whereas i^2 - j^2 = 0) 16:41:20 <\oren\> urgh slow compiling 16:42:01 :/ 16:42:48 <\oren\> c++ seems to compile mmuch slower than an equivalent loc of c 16:43:25 -!- ais523 has joined. 16:43:32 it does 16:43:36 <\oren\> i wonder how D and rust compare 16:43:49 C++ needs to do semantic analysis during the parisng 16:43:51 *parsing 16:44:04 and expand templates during compilation 16:44:08 there's C, D, is there E? 16:44:16 \oren\: you know there are compiler options to modify how quickly you compile, and in particular with gcc, -O (same as -O1) is great for improving compilation speed compared to -O2 (which does more optimizations) 16:44:21 right? 16:44:21 Could I ask for some c help? 16:44:25 Kaynato: you can try ;) 16:44:32 I know there's F, perhaps G, idk about H or I, there is J, idk about K...well yet anyway 16:44:44 also, don't use ancient versions of compilers, because some of those really are slow 16:44:51 ^ 16:45:02 Ok, my program is crashing unexpectedly on typical input only of one sort 16:45:14 rdococ: there are languages for every ascii letter, probably more than one language for half of them 16:45:15 there's Lazy K. 16:45:18 If I alter the input with inconsequential anything, it doesn't crash 16:45:24 okay 16:45:28 what about Unicode letters 16:45:29 If I put it in gdb, it doesn't crash 16:45:36 rdococ: and there is a quite famous apl-like called K, and there was some crazy language called E somewhere 16:45:39 Kaynato: you have undefined behaviour somewhere, probably 16:45:50 Sometimes it just crashes 16:45:54 Kaynato: start by turning off optimizations 16:45:56 Other times calloc doesn't want to allocate 4 bytes 16:46:05 possibly run with ubsan 16:46:07 <\oren\> uninitialized varriables? 16:46:07 or valgrind 16:46:20 Optimizations are off, I am compiling for gdb 16:46:55 All variables areinitialized 16:47:12 use valgrind or ubsan 16:47:44 okay 16:47:45 what about this 16:47:46 © 16:47:50 <\oren\> also check for division by zero 16:47:55 circle with a c in it 16:48:14 I am using windows 16:48:39 rdococ: it's the name of a programming language specialized for use in the entertainment industry 16:49:04 Can I run valgrind on windows? 16:49:14 I doubt it 16:49:16 yeah 16:49:18 even if you could, it only runs Linux binaries 16:49:19 ubsan should work though 16:49:29 msan is Valgrind-like and probably works on Windows 16:49:43 (and msan and ubsan complement each other, they catch different classes of bugs) 16:49:45 <\oren\> which compiler are you using? 16:49:56 gcc 16:50:04 Ah, chrome's crashed 16:51:06 at some point you should start ruling out hardware problems, not sure whether you've reached it yet 16:51:35 -!- tromp has joined. 16:51:58 -!- dingbat has joined. 16:52:24 ouch... faulty RAM sucks 16:52:33 it's hard to debug 16:53:02 (but chrome crashing doesn't mean that much) 16:53:24 Kaynato: check if maybe your system's memory use is so high that programs run out of memory. 16:53:35 it is not 16:53:44 it's not the most likely of causes... and it tends to produce intermittend rather than reproducible errors anyway 16:53:49 or if the program you're running is allocating too much memory which is how it runs out. 16:53:52 I mean, I can run this and have it allocate even a few mb 16:53:54 int-e: yep 16:54:00 it's just on this specific program that calloc fails for some reason 16:54:03 intermittent 16:54:39 Kaynato: usually that's just a memory corruption bug elsewhere in the program, eg. indexing past an array or using a stale or uninitialized pointer 16:55:04 like a pointer to a freed object 16:55:53 -!- tromp has quit (Ping timeout: 244 seconds). 16:56:00 it's really strange, I'm using really simple code and it causes this, while complex code doesn't 16:56:12 I'll make a simpler example to see if the error is triggered 16:56:41 Ok, so I can run the output file just fine 16:56:52 But on the default of compile-interpret, it breaks 16:58:58 -!- hppavilion[1] has joined. 16:59:15 -!- mihow has joined. 17:01:06 sounds like you have a memory corruption bug somewhere 17:01:19 yep 17:01:46 how do I run ubsan? 17:07:09 Kaynato: try -fsanitize=address -fsanitize=undefined when compiling with gcc (you'll need a recent version of gcc) 17:07:23 that'll turn on asan (which I called msan earlier due to misremembering the name) and ubsan 17:08:07 then run your proram as normal 17:09:26 I'm not sure if this works on Windows yet; hopefully it does though 17:10:19 -!- Kaynato has quit (Ping timeout: 244 seconds). 17:10:32 oh, Kaynato probably didn't see my reply :-( 17:10:39 hmm 17:10:53 if I were to make an infinity, it would be a neutral number like 0 17:11:01 okay, if you call it a number 17:11:34 -!- Kaynato has joined. 17:12:35 Kaynato: try -fsanitize=address -fsanitize=undefined when compiling with then run your proram as normal gcc (you'll need a recent version of gcc) that'll turn on asan (which I called msan earlier due to misremembering the name) and ubsan I'm not sure if this works on Windows yet; hopefully it does though 17:13:19 -!- lambda-11235 has joined. 17:13:27 infinity is basically the 0 that's 1/0 17:13:40 infinity is like a second 0 17:14:24 Projective number line? 17:14:30 I heard of this projective circle thing that goes from 0 -> 1 -> 2 -> 3 -> infinity -> -3 -> -2 -> -1 -> 0 17:15:24 rdococ: right, that's basically projective geometry 17:15:28 it works in more dimensions than just 1D 17:15:47 and has some other fun properties, e.g. going past infinity and back from the other side makes an object into a mirror image of itself 17:16:21 so you can have complex projective numbers and cool extra transformations? 17:17:47 perhaps 17:18:01 I'm not sure if it works with complex numbers rather than just x/y coordinates, but it probably does 17:18:06 or, wait, no 17:18:08 it isn't an x/y 17:18:13 because infinity is a point, not a line 17:18:27 err, no it is a line 17:18:28 I think 17:18:30 I'm confused 17:18:38 hmm 17:18:48 x/y is the same thing as the complex plane 17:18:53 at least I think it is 17:18:55 in 2D projective geometry, there is one "point at infinity" for each angle a line can have 17:19:09 two parallel lines intersect at the point at infinity for their angle 17:19:16 so there is a line at infinity that contains all the points at infinity 17:19:20 can a triangle have one angle in infinity? 17:20:16 -!- hppavilion[1] has quit (Ping timeout: 252 seconds). 17:20:38 An angle of infinity is not particularly meaningful 17:20:58 Oh, misread 17:20:59 Sorry 17:21:39 ais523: Riemann sphere is the likely one you are thinking about for complex numbers 17:21:52 could be 17:22:07 I'm not an expert on projective geometry, I've hardly even seen references to it 17:22:35 rdococ: I don't see why you couldn't have a triangle formed out of two crossing lines, with the third at infinity 17:23:32 sleepy 17:32:05 ais523: because there's a whole line at infinity, and the two intersecting lines will intersect that one in different points. 17:32:46 int-e: yes, thus forming a triangle 17:33:02 one of the sides runs from one of the relevant points-at-infinity to the other 17:33:15 ais523: oh, it wasn't clear that the line at infinity would be one of the sides 17:33:16 the other two run from the points-at-infinity to a single point in "finite space" 17:33:20 ais523: that's fine then 17:35:26 oh, another parsing failure... 17:35:53 -!- oerjan has joined. 17:36:19 -!- lleu has quit (Quit: That's what she said). 17:39:33 @tell myname doesn't look that impressive <-- what do you mean, not impressive? all the panels share a theme despite not being just repetition of each other! (ok so the point is that it's usually far worse hth) 17:39:33 Consider it noted. 17:41:14 oerjan: this is a mezzacotta comic? 17:41:25 ais523: yeah 17:41:28 today's 17:41:56 that's actually… mildly funny, at least 17:42:04 you are right, it is unusually good for mezzacotta 17:42:14 * ais523 bakes it 17:42:51 yay 17:45:18 -!- Frooxius has joined. 17:45:54 -!- spiette has quit (Quit: :qa!). 17:46:58 An old stack based language I wrote a long time ago, https://github.com/lambda-11235/tstk. 17:47:20 am I the only one who didn't make a brain**** derivative when I first joined? <-- technically, have i ever? the one i added recently already existed with a different name. 17:48:32 If anyone's interested in looking at it. 17:48:46 i've certainly implemented a few, though. although i don't think i implemented brainfuck _itself_ until i did it in Fueue. 17:50:02 oerjan: did you invent small-finite-tape BF? 17:50:10 like, with a single-digit length? 17:51:10 lambda-11235: why does github show README.html unrendered... 17:51:30 oerjan: because it's not a Markdown file and github doesn't render anything but markdown 17:51:33 -!- zadock has joined. 17:51:57 ais523: cannot imagine so, there was already a proof by someone else that 5 were enough after all. 17:52:13 oerjan: I wrote it a long time ago, and for some reason I decided to use html for the README. 17:52:39 That was long before I joined GitHub. 17:52:46 -!- tromp has joined. 17:52:47 hm 17:53:10 b 17:53:15 bleh 17:53:21 backspace is next to return, as usual 17:53:29 B-) 17:53:43 hmm, why am I apologising for my typos, I used to just send them to #esoteric without caring 17:53:49 presumably I'm on better behaviour than normal 17:53:53 oerjan: Write a program to convert html to markdown, and call it markup. 17:53:58 ais523: and you invented reversible brainfuck before i needed it for jolverine 17:54:08 oerjan: I didn't realise you needed it 17:54:27 lambda-11235: doesn't pandoc do that? maybe it only goes the other way. 17:54:52 * oerjan doesn't really know pandoc 17:55:06 now you're making me want to work on rtfm again 17:55:16 ais523: jolverine is reversible and has a tape, so it seemed like the obvious thing to try... 17:55:29 (for the TC proof) 17:55:32 (the basic idea is that it statistically analyzes text documents to work out what notation they use for headings, titles, etc., then converts into other formats) 17:55:42 and then i had to prove rev. bf TC first 17:55:43 (I haven't even really started it yet, though) 17:57:06 you know, looking at that page 17:57:15 in retrospect I should probably define , to add the input to the current cell 17:57:22 rather than crash the program if the current cell is nonzero 17:57:45 presumably I'm on better behaviour than normal <-- hasn't that day passed 17:57:51 `? ais523 17:57:52 oerjan: Hold on, converting and tidying up the markdown. 17:57:55 oerjan: it was earlier this month 17:57:57 -!- tromp has quit (Ping timeout: 246 seconds). 17:58:04 however, I am sometimes well-behaved on other days too 17:58:04 Agent “Iä” Smith is an alien with a strange allergy to avian body covering, which he is trying to retroactively prevent from ever evolving. On the 3rd of March, he's lawful good. 17:58:19 shocking 17:59:33 ais523: next you need to merge rtfm with aimake hth 17:59:50 oerjan: it'd be possible 18:00:01 aimake uses POD for documentation atm (both its own and that of programs it's installing) 18:00:32 but that's partly because it ships with Perl, and partly because it's one of the few formats that has all the features that documentation really needs (the other is info and everyone hates info) 18:01:59 -!- idris-bot has joined. 18:02:11 i recall they changed the doc format for ghc last year. 18:02:35 although the new one _did_ lose a few features (deep nesting, i think) 18:02:51 but it was still considered a win. 18:03:02 oh, hmm, asan and msan both exist and do different things, and valgrind does both those things 18:03:15 (asan = check for addressability, msan = check for definedness) 18:05:23 from DocBook to ReStructuredText https://ghc.haskell.org/trac/ghc/wiki/UsersGuide/MoveFromDocBook 18:08:01 hm, email from norwegian tax authorities 18:09:23 oerjan: well at least you're actually norwegian, so it makes more sense that you receive the email than that, say, I do 18:09:49 the spam filter marked it as possibly spam :P 18:09:56 but there's no link in it so... 18:11:29 -!- shikhin_ has changed nick to shikhin. 18:11:32 ais523: it's an email everyone gets, that the tax forms are ready 18:13:09 (everyone they've got email for, that is. i _almost_ managed to not use the official login long enough that they stopped considering my email valid) 18:13:58 -!- spiette has joined. 18:14:47 oerjan: Converted to markdown. How's that? 18:15:10 yay 18:16:07 markdown annoys me 18:16:51 there are three jobs you really want for a format like that: a) capable of representing arbitrary formatting; b) looks like a regular unformatted text file; c) easy for someone unfamiliar with the format to edit 18:16:57 and it pretty much fails at all three 18:18:27 that's what they call an excellent compromise hth 18:20:08 I've been considering making my own, going all-in on b) and only aiming for the other two to the extend they don't interfere 18:20:24 was considering going so far as to allow people to write directives as sequences of spaces and tabs at the end of lines, Whitespace-style 18:25:36 schlock in a holding cell, what did I miss? 18:25:37 ais523: I would want something that goes for a. A kinda of markup language that's turing complete with arbitrary drawing capabilities. 18:25:42 ais523: I don't think perldoc has all the features that documentation needs. there's one feature I'm really missing 18:26:05 lambda-11235: like HTML+JS, but less insane? 18:26:07 b_jonas: go on 18:26:22 (probably have to wait for the next strip for an explanation... sigh) 18:27:01 well, at least with the current perldoc interpreters. it's possible that it could be fixed in the future by changing those. 18:27:11 ais523: I considered that, but yes, it needs to be more sane, and prettier to look at. 18:27:15 b_jonas: you still haven't told me what the feature /is/ 18:27:54 Like LaTeX, but easier to program and do graphics in. 18:28:04 you know how perl has =begin and =for directives to put renderer-specific parts in a perldoc, so you can say something like eg. =for *HTML \n to embed an image in HTML output 18:28:15 yes 18:28:20 =for aimake manualsection 6 18:28:37 The feature I'm missing is the same thing in negative, so that you can easily put fallbacks for other renderers 18:29:04 it's possible to do this for some renderers by putting the fallback text unconditionally and using some renderer-specific method to hide that text 18:29:04 a "=for everythingelse"? 18:29:11 ais523: no, more like a =for !HTML 18:29:26 that wouldn't be useful unless you could hide from two or more renderers at once 18:29:32 ais523: you can with =begin 18:29:40 ais523: non-starred =being blocks can be nested 18:29:56 obviously =for !HTML is the wrong syntax for it, because it's not backwards compatible 18:30:05 `? markdown 18:30:13 markdown? ¯\(°​_o)/¯ 18:30:35 `le/rn markdown/What will your markdown flavor be today? 18:30:46 Learned «markdown» 18:30:48 -!- zadock has quit (Ping timeout: 276 seconds). 18:30:55 we could use something like =for begin !\nHTML\n\n ... \n\n=for end ! 18:31:08 which would be ignored by existing renderers 18:31:19 so the text inside would be kept 18:31:58 you can still do specific hacks like =for HTML\n