00:00:48 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 00:00:53 -!- moonheart08 has quit (Ping timeout: 268 seconds). 00:02:51 -!- moony_ has quit (Read error: Connection reset by peer). 00:05:49 -!- FreeFull has quit. 00:22:39 -!- moony_ has joined. 00:27:16 -!- moony_ has quit (Ping timeout: 240 seconds). 00:35:34 -!- moony_ has joined. 00:39:57 -!- moony_ has quit (Ping timeout: 240 seconds). 01:08:15 -!- moony_ has joined. 01:31:33 `5 01:31:35 1/2:1168) * Sgeo remembers when he believed VRML could never have gravity. Now VRML is dead. (And has gravity) \ 271) I think I managed to make Stack Overflow work on gopher, now. \ 1038) <+kmc> we are amused <+kmc> the royal +v \ 123) Never ever use a quote which contains both the words "aloofness" and "gel" (verb). \ 208) This is good if you are a wheat plant but bad if you like eating wheat seeds 01:31:36 `n 01:31:37 2/2:. 01:31:45 oh no 01:31:54 I took a peek at Seclusion. 01:32:02 Now one of my favorite esolangs 01:33:56 Suprisingly compact for a turing tarpit 01:37:16 -!- imode has joined. 01:37:27 How does aloofness gel with quotes... 01:37:41 hi int-e 01:37:52 moornyng 01:38:15 `? int-e 01:38:15 int-e är inte svensk. Hen kommer att spränga solen. Hen står för sig själv. Hen gillar inte färger, men han gillar dissonans. Er hat ein Hipster-Spiel gekauft. 01:39:04 let's nuke all the nickname wisdom entries and start from scratch. 01:39:29 [[Esolang:General disclaimer]] https://esolangs.org/w/index.php?diff=67011&oldid=64350 * Moon * (+41) Was there ever a time where this contained useful content? 01:40:14 Answer: no 01:40:43 How does two watched literals work with backtracking? 01:41:38 The thing I imagine doing for 2WL is: You have a queue of literals that are forced to true. When you do unit propagation, you find new literals that are in unit clauses, and push them onto your queue. 01:42:04 But when you backtrack, do you just discard part of your queue depending on the backtrack level? I don't think that's what people do. 01:42:15 queue?! 01:42:20 Not a queue? 01:42:31 I don't see a queue. 01:42:55 You think you just set the literals to true directly? 01:43:14 I feel like you must have a queue or a stack or something. 01:43:26 Also, i've been considering setting up my own mediawiki wiki for general CS 01:43:33 things 01:43:44 (Damn you enter key I wasn't done) 01:44:04 shachaf: The trail is a stack to me. But it's not immediately connected to the watched literals. 01:44:15 The trail is just the regular stack, that's not what I mean. 01:44:32 I see no queues in 2WL at all. 01:45:13 Say you're in some state where you have the clauses (x | y) & (x | z) 01:45:45 You end up with ¬x. Now you have to infer y and z. Right? 01:45:57 Oh, that's where the queue is. 01:46:04 Then you need to find all the clauses that have ¬y and ¬z as their watched literals. 01:46:09 Yeah, fair enough. 01:47:11 And yes, I expect you discard the queue when you find a conflict. You don't touch the 2WL lists either; you have to ensure that every (non-unit) clause is on two lists as you process the literals. 01:47:28 I was wrong, VRML is not dead: http://create3000.de/x_ite/getting-started/ 01:47:40 I know you don't need to undo 2WL when you backtrack, which is a neat trick. 01:47:47 But do you just discard the entire queue? 01:47:55 sure 01:48:08 you've found a conflict... you don't need more 01:49:54 Let me see. Say you have the clause (¬y | x)... 01:49:55 Oh, I see. 01:50:06 (I expect you could keep going in hope of finding a nicer conflict clause? But the moment you find a conflict you violate the 2WL invariant that watched literals are not on the trail...) 01:50:24 You can just scrap the whole queue because this was all the propagation step, and the conflict was implied by the initial choice of ¬x. 01:50:48 There are no decisions made while the queue is nonempty, of course. 01:51:42 (Which probably doesn't matter, but you probably need to be careful not to put a literal and its complement on the trail, at which point conflicts become very much meaningless. It seems messy.) 01:52:17 You'll still want to keep the processed literals for conflict analysis. 01:52:36 I started implementing this queue as some kind of circular buffer thing but then I saw what minisat does: 01:52:47 They just store the queue on the trail itself, right after all the literals in the trail. 01:53:07 Then they just adjust the trail end index forward as they pop things off the queue onto the trail. 01:53:12 So much better. 01:53:37 Sgeo__: I'm afraid that things don't die anymore... they go out of fashion but linger on. People will just build compatibility layers like the one you linked to. 01:54:28 shachaf: Of course that is where you put the queue... which is why I didn't see it at first. 01:54:46 Right, it's really just the unprocessed part of the trail. 01:54:53 Technically it's not implementing the VRML spec faithfully. There's also an X3D spec that's a next version VRML, that's still being worked on. 01:55:01 But I didn't think of it that way at first! 01:55:08 https://github.com/create3000/x_ite/issues/50 01:56:17 Sgeo__: you seem to care a lot about VRML 01:56:46 I spent some of my childhood in Cybertown, which used VRML, and before then I read a book about VRML 01:59:35 `? chu space 01:59:36 A Chu space is just a matrix. Taneb invented them, then Chu stole his invention. 01:59:43 `? matrix 01:59:44 A matrix is just a matrix. People use them to communicate. Taneb invented them. 02:02:58 So the better way to think of this is that some suffix of the trail is "unpropagated" and still needs to be processed. 02:05:17 `? solidity 02:05:18 Solidity is an esolang for writing contracts. It has good support for secure linear algebra. 02:06:07 Man, one time I was trying to come up with a clever pun about finance and linear algebra relating to how liquidity behaves nonlinearly. 02:06:11 But I never made it work. 02:09:01 today on schlock mercenary: heavy punning 02:09:45 `5 w 02:09:48 1/1:bf//See: brainfuck \ portugoose//Peça ganso assado com natas. \ europe//Europe is the national anthem of the Republic of Kosovo. \ dereduntantation//Dereduntantation is the process of making things less redundant. It is typically done with either regexes or regular expressions. \ theory//To be theory is to be like a theorem, but inferior. 02:11:58 `cwlprits portugoose 02:12:00 boil̈y 02:12:12 that checks out 02:12:25 -!- xkapastel has quit (Quit: Connection closed for inactivity). 02:59:07 -!- oerjan has quit (Quit: Nite). 03:32:02 poultry 03:37:00 Is the solidity entry in any way connected to the matrix of solidity? 03:37:48 obviously hth 03:37:50 @tell oerjan today on schlock mercenary: heavy punning <-- I feel that "Hurtz" would make an excellent unit for punnery. 03:37:50 Consider it noted. 03:38:50 shachaf: Is it? I mean I'll admit that it is highly suggestive. But that doesn't prove a thing. 03:39:01 `quote solidity 03:39:03 239) enjoy being locked in your matrix of solidity 03:39:14 "secure linear algebra"? 03:40:37 Using multiplication by zero and other forms of cancellation for information hiding. 03:42:22 Information deletion is a really good method of information hiding. 03:43:14 -!- imode has quit (Ping timeout: 276 seconds). 03:43:48 lattice-based crypto is the other angle I thought of but it doesn't readily connect to finance 03:44:52 crypto stands for cryptocurrency so obviously it's always connected to finance hth 03:45:30 shachaf: you should take that message to ##crypto ... it's a good test for whether the ops are around. 03:45:56 I found this ridiculous article earlier... https://cointelegraph.com/news/bobby-lee-500k-bitcoin-price-flippening-of-gold-will-come-by-2028 03:46:19 speaking of crypto, got any hot ICO tips for me 03:47:32 Not really. I'm a casual observer at best. 03:47:33 i sure want to, uh, hodl 03:47:44 you *will* yolo 03:47:47 p. sure my coins are going to the moon 03:47:57 `coins 03:47:59 ​thisheacoin cacecoin millecoin olythcoin bloopcoin isabcoin concoin paviacoin ctnrmcoin vassiblecoin yatmoscoin arrorcoin tlwnncoin pogocoin cutakaelikencompcoin caivcoin explatcoin ezacoin osmetacoin purehcoin 03:48:06 YOLO is the only ground truth in all of crypto. 03:48:23 I'm investing in bloopcoin! 03:48:28 HODL is how you become a mule in the ongoing money laundering scheme. 03:48:59 https://www.kalzumeus.com/2019/10/28/tether-and-bitfinex/ was fascinating to read 03:49:20 money laundering? now you're talking cryptography 03:49:31 ("cryptography" also stands for cryptocurrency hth) 03:49:48 Yeah, troll. 03:50:02 You already know how to troll me, and that wasn't it. 03:50:53 `grwp fnord 03:50:54 fizzie:fizzie is not fnord with a monad but the king of #esoteric, see https://zem.fi/static/img/square_fizzie_320px_white.jpg \ indonesia:Indonesia is a large island country in Asia and the world's most populous muslim country. Its major export is rayon textile from the Indonesian fnord. 03:51:23 Oh no. 03:51:31 That's a twolerable number. 03:51:37 I think it's clear enough this is intended in good fun and not to cause any actual irritation? 03:51:41 If it did then I should stop. 03:52:56 Hmm. I don't know. Maybe I've seen a few too many "crypto" discussions on ##crypto to find it genuinely funny. 03:53:18 That makes sense. 03:56:25 My impression is that you also think most regular finance is sort of a scam, though. 03:57:26 Sorta. But it's regulated... and intertwined with basically everything. So it's far more predictable. 04:00:01 -!- Taneb has quit (Quit: I seem to have stopped.). 04:01:44 -!- Taneb has joined. 04:03:23 BTC is cute and small in comparison. Oh and I can lightly treat it as a joke because I'm not invested in it. You can identify the role and interests of individuals. Bobby Lee, for example, is co-founder and CEO of BTCC, a chinese bitcoin exchange. So predicting a bright future for BTC is in his interest. 04:09:19 Say, are the YAFGC "related comics" just a randomly generated list of previous episodes... 04:09:39 ...I noticed, for the first time, that the list changes when you reload the same page. 04:10:18 (I did notice before that they are usually not very related to the current strip.) 04:33:36 -!- Sgeo_ has joined. 04:36:26 -!- Sgeo__ has quit (Ping timeout: 240 seconds). 04:52:09 -!- imode has joined. 05:09:41 -!- moony_ has quit (Read error: Connection reset by peer). 05:09:57 -!- moony_ has joined. 05:14:26 -!- moony_ has quit (Ping timeout: 240 seconds). 05:16:34 -!- moony_ has joined. 05:38:12 -!- moony_ has quit (Ping timeout: 268 seconds). 05:39:10 -!- moony_ has joined. 05:46:10 `coins 05:46:13 ​doublecoin colacoin quecoin neccoin optealphilcoin goto++coin longsertcoin pofecoin l00tcoin puesspaghcoin galliiecoin ycoin athcoin sitioncoin concoin subjeccoin cutercoin dzicoin hactropolymoncoin whis=thacoin 05:47:29 Oh right. That's the ICO list shachaf wanted. 05:48:28 @thanks kmc 05:48:28 you are welcome 05:48:33 `thanks kmc 05:48:33 Thanks, kmc. Tmc. 05:49:02 fungot: 05:49:02 int-e: these unique items make us invincible! dance!! for ayla eat? oh...i feel faint. just as you touch, so throw away. thankful for that? for my, daughter! just like crono! 05:49:11 ^style 05:49:11 Available: agora alice c64 ct* darwin discworld enron europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp ukparl youtube 05:49:22 ^style irc 05:49:22 Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams) 05:49:33 fungot: 05:49:33 int-e: so some kind of byte code, i might even prefer it fast, you know 05:50:38 im curious about the enron dialect, from the released audio :) 05:50:58 "grandmas not gonna have any power this week" 05:59:32 -!- tromp_ has joined. 06:02:02 -!- tromp has quit (Ping timeout: 240 seconds). 06:09:51 -!- imode has quit (Ping timeout: 265 seconds). 06:12:48 [[Baba Is You]] https://esolangs.org/w/index.php?diff=67012&oldid=66147 * YamTokTpaFa * (+9) /* External Resources */ fixed categorization 06:15:38 [[ASCII]] https://esolangs.org/w/index.php?diff=67013&oldid=65107 * YamTokTpaFa * (+35) Added link to WP article 06:18:10 [[Nuts]] https://esolangs.org/w/index.php?diff=67014&oldid=65948 * YamTokTpaFa * (-15) name fixed 06:48:03 [[L33t]] https://esolangs.org/w/index.php?diff=67015&oldid=63848 * YamTokTpaFa * (+31) 07:14:33 -!- tromp has joined. 07:16:26 -!- tromp_ has quit (Ping timeout: 276 seconds). 07:42:24 -!- tromp_ has joined. 07:42:24 -!- tromp has quit (Read error: Connection reset by peer). 07:46:32 -!- nfd9001 has joined. 08:42:13 oerjan: anyway, I didn't mean that you should update Sárvik, that was just a sidetrack. I mean https://esolangs.org/logs/2017-01-29.html#l7j and the channel has acquired new active regulars 08:48:23 -!- sftp has quit (Ping timeout: 265 seconds). 08:56:52 -!- hppavilion[1] has joined. 09:03:01 -!- sftp has joined. 09:08:27 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 09:14:29 -!- b_jonas has quit (Quit: leaving). 10:04:15 -!- hppavilion[1] has joined. 10:18:04 -!- ArthurStrong has joined. 11:53:25 -!- hppavilion[2] has joined. 11:53:31 -!- hppavilion[2] has quit (Client Quit). 12:01:41 -!- arseniiv has joined. 12:11:21 -!- hppavilion[1] has quit (Remote host closed the connection). 12:20:13 oh nice, i didn't know fungot has an oots style 12:20:13 myname: pattern match on it with someone else for a second 12:20:24 okay. 12:23:11 fungot: Come on, don't be so rude. 12:23:11 fizzie: in perl you'd write "" instead of " ( display... 12:45:35 fungot: ... 12:45:35 int-e: i forgot to get rid of some cells exhibit. glad to be of any significance is in maine. 12:57:39 fungot: Try to come up with one of those weirdly relevant replies every once in a while, will you? 12:57:39 fizzie: you can store and retrieve the strings in the array :) you mean to brainfuck or befunge rot13? you would need to be made 12:57:50 I don't think that counts. 13:07:50 fungot doesn't do requests 13:07:50 int-e: that may have been a giveaway... busy. all that is involved with yasos is individual objects there's no concept of hygiene 13:08:51 Not relevant but pretty coherent. 13:14:41 -!- wib_jonas has joined. 13:16:18 " Try to come up with one of those weirdly relevant replies" => he did: https://esolangs.org/logs/2019-11-07.html#l1d 13:24:57 -!- moony_ has quit (Ping timeout: 240 seconds). 13:48:41 -!- imode has joined. 14:17:01 -!- kspalaiologos has joined. 14:28:17 -!- nfd9001 has quit (Ping timeout: 240 seconds). 15:05:11 -!- imode has quit (Ping timeout: 246 seconds). 15:44:41 -!- imode has joined. 15:58:51 ^style 15:58:51 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp ukparl youtube 15:59:03 I suspected it 16:01:13 for me, “to brainfuck or befunge rot13” is a find 16:01:37 fungot, how old your irc base again? 16:01:37 arseniiv: did i just read 16:02:06 fungot: yeah, you did, but you wrote too little 16:02:06 arseniiv: why ehird in particular? there must be. how do you have a bottle of liquid plumber 16:02:21 you got me 16:03:08 fungot: please inspire me at least 16:03:08 arseniiv: i never hold grudges against people whom i refer to them later. this is a test"). 16:03:27 this doesn’t help at all, though it consoles a bit 16:04:52 liquid plumber i guess is a specific flavor of soylent green 16:05:57 I think the years are included in the style description. 16:05:59 ^style irc 16:05:59 Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams) 16:06:04 Well, apparently not. 16:06:12 It's pretty old, though. 16:06:42 fungot: what do you know about the Restaurant? 16:06:42 arseniiv: stop it, i suppose that would work with scheme48 on windows? fnord, when audio driver problems will probably be 16:07:20 fungot: but I don’t want to stop, I’ve only just begun! 16:07:34 (oh?) 16:07:58 fungot: sorry, did I break you accidentally? 16:08:08 oh!!! 16:08:35 I’m sorry my dear 16:09:21 oh no, did fungot break? 16:09:21 imode: tracing it by hand for safety?" yes... yes they can.... at last 16:09:24 nope. 16:09:42 strange. Dear fungot, did you accidentally ban me? 16:09:42 arseniiv: i was writing replace for a fnord bus on empty roads, even fnord plays in the eu 16:09:49 rate limiting, maybe. 16:10:42 imode: are they that sophisticated? I’ll never stop wondering 16:10:53 * imode shrugs. 16:10:55 probably! 16:11:25 fungot: that being dealt with, would you at last give me a piece of advice? 16:11:26 arseniiv: i think i like pbrain and brainfork, there should be exactly be impressing me all the screen for an hour. 16:11:55 arseniiv: "vice"? 16:12:19 don’t think that’s a good advice at all 16:12:24 int-e: ? 16:12:47 you mean, that was simply an ad? 16:12:54 maybe 16:13:12 arseniiv: it was a piece of advice 16:13:45 or more accurately a piece of "advice". 16:14:00 ah 16:14:50 fungot: what’s your opinion o quoting styles? 16:14:50 arseniiv: http://en.wikipedia.org/ wiki/ steerpike' reminds me of the illusion 16:15:12 so you don’t have an opinion yourselves 16:16:54 -!- wib_jonas has quit (Remote host closed the connection). 16:21:05 -!- zeroFlow has joined. 16:21:30 -!- zeroFlow has quit (Client Quit). 16:27:28 -!- zeroFlow has joined. 16:27:49 Yes, there's a "at most N consecutive replies to the same nickname in a row" limit, with N somewhere around 3 to 4. 16:28:14 makes sense. 16:34:28 -!- imode has quit (Quit: WeeChat 2.6). 16:36:02 -!- heroux has quit (Ping timeout: 240 seconds). 16:39:36 -!- Melvar has quit (Quit: WeeChat 2.4). 16:40:03 -!- kritixilithos has joined. 16:50:36 -!- Melvar has joined. 16:51:41 fizzie: ah 16:56:23 [[Special:Log/newusers]] create * Ashtons * New user account 16:56:29 Fun. _mm_sll_epi16, _mm_sll_epi32 and _mm_sll_epi64 shift in bit units. _mm_slli_si128 shifts in byte units (there's an alias _mm_bslli_si128). _mm_slli_epi8 does not exist. 16:56:50 who comes up with these instruction sets... 16:58:00 [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=67016&oldid=66918 * Ashtons * (+225) added my intro 17:05:10 -!- Melvar has quit (Ping timeout: 268 seconds). 17:05:35 -!- Melvar has joined. 17:11:37 (These came up while optimizing http://paste.debian.net/1115796/ ... which I have no use for at all.) 17:25:00 -!- Frater_EST has joined. 17:51:37 -!- Frater_EST has left. 17:52:35 -!- heroux has joined. 18:35:34 -!- kspalaiologos has quit (Quit: Leaving). 18:44:30 -!- zeroFlow has quit (Quit: zeroFlow). 18:55:01 -!- FreeFull has joined. 18:55:08 -!- b_jonas has joined. 18:56:35 -!- kspalaiologos has joined. 18:57:46 int-e: yes, the ones that shift in bit units shift only within words (that are 16, 32, or 64 bit wide); the ones that shift in byte units shift the entire 128-bit register; the latter is mostly obsolete because we just use full permute instructions now, either way is just as slow; the former are also partly obsolete as we now have variable shift instructions that shift each word by a different amount as 18:57:52 given by the words of another register 18:58:17 there certainly are some overlap in the usage of these, but they are different enough instructions 18:58:24 that they're all called "shift" is a pity 19:06:25 -!- zseri has joined. 19:20:59 [[Nine]] N https://esolangs.org/w/index.php?oldid=67017 * CMinusMinus * (+1155) Created page with "'''Nine''' ('''N'''ext L'''ine''') is an esoteric programming language, created by [[User:CMinusMinus]]. ==Instructions== {| class="wikitable sortable" |- ! Instruction !! Act..." 19:24:11 [[Nine]] https://esolangs.org/w/index.php?diff=67018&oldid=67017 * CMinusMinus * (+141) 19:24:27 -!- zeroFlow has joined. 19:25:08 -!- kritixilithos has quit (Quit:  ). 19:25:56 [[Nine]] https://esolangs.org/w/index.php?diff=67019&oldid=67018 * CMinusMinus * (+17) 19:28:36 -!- zeroFlow has quit (Ping timeout: 240 seconds). 19:30:49 hey hey suppose we have a finite digraph (possibly with self-loops) and we start with I[0] the set of all sink vertices, then each time we set I[n+1] := I[n] ∪ (all vertices with outcoming edges only to vertices of I[n]). When I[n] settles (the graph is finite), what do we get? I suspect this set has a nice name 19:33:04 (though as I[n] ⊂ I[n+1], we can take even an infinite graph and just take a limit of I afterwards, maybe of an ordinal-valued sequence) 19:33:43 hm it reminds me induction 19:34:09 (I swear I didn’t name I after “induction”) 19:38:14 arseniiv: I don't think you get anything particularly interesting or nice 19:39:40 this occurs when I try to decide if an algebraic type is inhabited; the vertices are types and t → u when a value of u is absolutely needed to construct a value of t 19:39:43 arseniiv: there's a decomposition theorem for digraphs, where the digraph is made of strongly connected components aka strong components, any two node in the same strong component are reachable from each other both ways, and no two strong component is reachable from each other both ways, 19:39:55 so if you contract the strong component, you get a digraph without a loop 19:40:37 in your case, you start from sink vertices, which are exactly the sink strong components that have only one node, and then take all nodes (or all strong components) reachable from those backwards 19:40:48 hmm wait, that's not what you said 19:40:59 sorry, wait a moment 19:41:06 yeah, that’s more peculiar :) 19:41:11 "I[n+1] := I[n] ∪ (all vertices with outcoming edges only to vertices of I[n])" 19:41:34 for a vertex v to be added, we need that for all v → w, w be in I[n] 19:41:41 yes, that's fewer nodes 19:42:35 the set of nodes you get in the end won't even have directed loops among them 19:43:20 (my hypothesis that lim I consists precisely of all inhabited types, for the semantics given above) 19:44:13 arseniiv: no way 19:45:15 at least it should be a necessary condition? 19:45:24 arseniiv: consider data R where { {- uninhabited -} }; data S where { {- uninhabited -} }; data A = P R | Q S; 19:45:38 neither R nor S is absolutely needed to construct A, and yet A is uninhabited 19:45:53 b_jonas: ah, now I remember, thanks! 19:46:01 I considered that but forgot 19:46:13 now I think maybe I need to work constructor-wise 19:48:06 I’ll write if I succeed on this way 19:55:22 arseniiv: how many type system extensions do you have? is this still plain algebraic types, or do you have type parameters or even more? 19:55:55 b_jonas: plain ones, no parameters 19:56:09 I believe if you have just plain algebraic types, then you can find out precisely which types are inhabited 19:56:33 if you add enough type system extensions, eventually your compile time becomes Turing-complete, and then or before, you can only prove some of your uninhabited types uninhabited 19:56:49 that's still useful for optimizations, and it's not usually a problem that you can't prove an uninhabited type uninhabited, mind you 19:57:00 so it's still worth to have basic checks for that in a compiler 19:57:16 you may even remember when I talked to myself here about proving generalized Minsky machines TC for exactly those type definitions which give us infinitely many values 19:58:15 b_jonas: yeah, I agree with what you said too 19:58:30 arseniiv: that sounds plausible, because those types can simulate natural numbers, and counter machines with enough registers are turing-complete, 19:58:46 whereas if you only have types that have finitely many values, then your state space is finite 19:59:18 now I have sat and written a proof that indeed infinitude of values is equivalent to TCness, but now I want an icing on a cake showing how to decide if there are infinite values syntactically 19:59:42 high chance of rain tomorrow, says the weather prediction. ok. 19:59:48 yeah, precisely what I written out 19:59:55 (not about the rain) 20:00:12 decide if there are infinitely many values? yes, that's probably also possible 20:00:27 b_jonas: have your climate snow or rain usual at this time of the year? 20:01:12 it's sort of like deciding if a regular language is finite given an NFA 20:01:23 yes, it should rain 20:01:24 b_jonas: I think that limiting I set is the answer, even, but I haven’t yet continued with proving it in peace so I don’t yet know for sure 20:01:31 but two weeks ago was too dry 20:01:46 last week was better, I glad we got the rain finally 20:02:08 and in the evening too, when I'm on the street, which is always funnier 20:02:50 I used to say that I take pleasure in the uncomfortableness that other people experience in the heavy rain, but I decided I shouldn't phrase it like that, 20:03:02 and instead say that I'm happy that I'm lucky enough that the rain doesn't hurt me 20:03:26 and here is a rain-snow threshold, zeroes by night or by day depending on fortune 20:03:40 nah, it's too warm for that yet 20:03:43 I do quite like being a bit under a warm rain, that is in the summer maybe 20:04:06 though I don’t like drying things afterwards so I’m almost not doing that 20:04:33 sure, warm rain is even better, because the air here in Europe is dry enough that everything dries quickly 20:11:33 -!- ArthurStrong has quit (Quit: leaving). 20:49:17 -!- kingoffrance has quit (Ping timeout: 240 seconds). 20:49:35 -!- kingoffrance has joined. 20:52:59 -!- ddmm_ has joined. 20:55:08 Are people who worked on eso-os still alive? 20:58:53 -!- kingoffrance has quit (Ping timeout: 268 seconds). 21:11:25 -!- zseri has quit (Quit: zseri). 21:11:25 [[Nuts]] https://esolangs.org/w/index.php?diff=67020&oldid=67014 * YamTokTpaFa * (+12) 21:11:57 -!- b_jonas has quit (Quit: leaving). 21:18:22 [[RETURN]] https://esolangs.org/w/index.php?diff=67021&oldid=65571 * YamTokTpaFa * (+49) 21:19:49 [[DeathScript]] https://esolangs.org/w/index.php?diff=67022&oldid=44912 * YamTokTpaFa * (+49) 21:25:03 [[User:YamTokTpaFa/sandbox3]] https://esolangs.org/w/index.php?diff=67023&oldid=65154 * YamTokTpaFa * (+243) 21:49:59 -!- kingoffrance has joined. 21:55:53 -!- moony_ has joined. 22:06:43 -!- aloril has quit (Ping timeout: 268 seconds). 22:13:32 that approach worked in the end, though without a graph due to alternative requirements of constructors 22:20:25 -!- aloril has joined. 22:31:16 -!- moony_ has quit (Ping timeout: 240 seconds). 22:51:25 -!- hppavilion[1] has joined. 23:06:31 -!- Melvar has quit (Ping timeout: 250 seconds). 23:06:55 -!- Melvar has joined. 23:17:26 -!- Frater_EST has joined. 23:22:40 -!- xkapastel has joined. 23:22:59 -!- oerjan has joined. 23:35:21 @messages-foul 23:35:21 int-e said 19h 57m 31s ago: today on schlock mercenary: heavy punning <-- I feel that "Hurtz" would make an excellent unit for punnery. 23:36:31 `? solidity 23:36:32 Solidity is an esolang for writing contracts. It has good support for secure linear algebra. 23:46:50 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).