00:10:47 helloily 00:12:08 question: are there any sequences that give themselves after n>2 applications of run-length encoding (but after no fewer applications) 00:12:19 A short is 16 bits, right? 00:12:20 s/2/1/ 00:13:07 And Long is 64? So what's 32? 00:13:21 Or is short 32 on systems where long is 64, and 16 where long is 32? 00:13:33 Then what's 16 on systems where long is 64? 00:14:07 i think short is always 16 00:24:30 quintopia: Then what's 32 on a 64-bit system? 00:24:43 medium? xD 00:25:09 I want to propose a new data type 00:25:16 It's called the "unnecessary" 00:25:43 It's equal to 65,536 bits. 00:29:06 Eh. Word it is. 00:29:44 -!- jaboja has joined. 00:30:11 How about a "scientific" data type 00:30:14 128 bits 00:58:45 hppavilion[1]: A short is 16 or more bits. 00:58:55 hppavilion[1]: In common implementations it's 16 unconditionally. 00:59:04 pikhq: Ah 00:59:24 An int is also 16 or more bits, and in common implementations it's 32 unconditionally. 00:59:41 long is 32 or more bits, and generally 32 or 64. 00:59:47 And long long is always 64 or more. 01:00:01 (but in common implementations always 64) 01:02:26 pikhq: I ask because I'm working on TypeMaker 01:04:49 I decided that, in the typemaker stdlib, bool is actually just a 1-bit unsigned integer 01:05:33 So you can (pretending this is valid syntax) do 5+True, and it equals 6 01:11:18 Huh. 01:12:25 Put another way, typical (short, int, long, long long) tuplets are (16, 32, 32, 64) and (16, 32, 64, 64) -- the former for "32-bit systems" and 64-bit Windows, the latter for 64-bit non-Windows. "Small" systems (and old MS-DOS compilers) can be (16, 16, 32, 64) or possibly just (16, 16, 32) if they don't do long long. 01:16:06 Not that those are the only possibilities, just the common ones. I think I recall a Motorola DSP56k C implementation where it's (24, 24, 48, not supported). 01:17:35 (And a 24-bit char.) 01:21:00 I was pretty specifically just describing the standard + common implementation choices. But, yeah. 01:22:02 Though I know there's no point in doing so now, I'd *like* to see a DOS-targetting C compiler that outputs code in real mode that does (16, 32, 32, 64) and flat memory addressing. 01:22:24 It'd be pointless but humorous. 01:23:32 Yeah, I just liked to see them summarized like that. 01:24:22 The TI compiler for the TMS320C54x has (char, short, int, long, long long) set of (16, 16, 16, 32, kinda-sorta 40). 01:24:53 I suppose if you wanted to be *really* silly you could write a C compiler that runs in real mode while supporting EMS and similar for data. 01:24:58 I don't think it can do arithmetic for long long, but it uses that for some intrinsics that make use of the 40-bit accumulators. 01:26:29 Y'know, so you can do things on a IBM PC with an expansion board installed. 01:27:31 Are there Pope Numbers? By analogy to Cardinal Numbers? 01:32:05 And, of course, Priest Numbers? And Acolyte Numbers? And any-other-catholicy-word Numbers? 01:33:13 Hm... 01:33:18 A generalization of sets 01:33:33 Such that this generalization's equivalent of the Cardinals 01:33:42 Is a proper superset of the reals 01:33:50 Or at the very least, the rationals 01:34:00 \oren\: What do you think? 01:34:30 -!- jaboja has quit (Ping timeout: 272 seconds). 01:35:37 Or maybe the Gausses 01:45:47 Writing real mode DOS program isn't completely useless, I think. Some people might use it, possibly with FreeDOS or DOSBOX instead of MS-DOS, though. 01:46:47 zzo38: The main thing that makes it useless is the set of people who would use it have at least a 386, so are quite satisfied by DJGPP. 01:46:51 (But there are problems with DOSBOX; some things are not implemented properly, both hardware and software emulation have a few things wrong. I think one is CGA high-colour mode, which has never been used until recently anyways) 01:47:15 Yeah, DOSBOX has a few issues, largely because DOSBOX primarily targets games. 01:47:28 And so if it's not used by an old school DOS game they mostly don't care. 01:48:51 Then they need to make the version that they do care ("DOSBOX Professional Edition"?), such as by the forked version, that does it more. 01:49:02 But even some stuff having to do with game is not quite working properly 01:49:15 Or, could be useful to have with some games, such as quicksave/quickload features 01:49:31 I would want to have a debugger included too though 01:54:02 -!- mauris_ has joined. 01:54:10 -!- mauris has quit (Ping timeout: 260 seconds). 01:59:08 01:59:24 hppavilion[1]: really, phrases like "cardinal numbers", "ordinal numbers", "surreal numbers", and so forth are just mnemonics. 02:00:09 There's this thing called the "number galaxy" which describes all of the different types of numbers there are. 02:00:18 "Galaxy" is an overstatement; there are only 20 of them. 02:00:46 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 02:01:01 Oh no, he's gone. I can no longer lie to him. 02:02:16 @tell hppavilion[1] I bet your sin() and cos() take their arguments in radians. 02:02:16 Consider it noted. 02:08:43 -!- andrew has joined. 02:15:49 What is your opinion of my idea of TVMIDI? 02:47:36 -!- jaboja has joined. 02:59:54 -!- andrew has quit (Remote host closed the connection). 03:01:40 -!- andrew has joined. 03:17:51 hezzo38. 03:18:07 what's a TVMIDI? 03:24:35 -!- augur has quit (Ping timeout: 260 seconds). 03:26:30 A way to control such device as TV cable box or satellite box with MIDI 03:33:12 -!- augur has joined. 03:37:35 -!- augur has quit (Ping timeout: 240 seconds). 03:39:15 Is it possible to tell 7-Zip to compress a file from stdin but give it a different name in the archive? 03:44:46 I get a E_NOINTERFACE error when I try. 03:50:10 -!- augur has joined. 03:53:13 -!- boily has quit (Quit: DISSIMILAR CHICKEN). 03:54:35 -!- jaboja has quit (Ping timeout: 240 seconds). 03:58:51 * Elronnd wonders when #esoteric turned into ##unixTechSupport 04:16:24 -!- andrew has quit (Ping timeout: 245 seconds). 04:24:35 -!- Patashu has quit (Ping timeout: 276 seconds). 04:25:30 -!- Patashu has joined. 04:32:27 -!- andrew has joined. 04:44:22 -!- jaboja has joined. 04:55:46 -!- heroux has quit (Ping timeout: 240 seconds). 05:15:01 -!- jaboja has quit (Remote host closed the connection). 06:34:26 -!- oerjan has joined. 06:46:28 @tell hppavilion[1] I tried `x, y += sin(direc), cos(direc)` which didn't work <-- imo sin and cos are switched hth 06:46:29 Consider it noted. 06:51:25 I figured out how to do what I asked; I found a PHP program to do that so I used that. 06:54:50 @tell quintopia question: are there any sequences that give themselves after n>2 applications of run-length encoding (but after no fewer applications) <-- almost certainly... 06:54:50 Consider it noted. 06:55:50 @tell quintopia unless you mean _finite_ sequences - a well-known theorem of the look-and-say sequences is that 22 is the only non-exploding one. 06:55:50 Consider it noted. 06:59:02 > let ls = map (show . length <> take 1) . group in iterate ls "1" 06:59:05 Couldn't match type ‘[Char]’ with ‘Char’ 06:59:05 Expected type: [String] -> [String] 06:59:05 Actual type: [Char] -> [String] 06:59:09 gah 06:59:30 > let ls = concatMap (show . length <> take 1) . group in iterate ls "1" 06:59:33 ["1","11","21","1211","111221","312211","13112221","1113213211","31131211131... 06:59:55 gah that's not long enough to see the repetition 07:00:47 * oerjan swats lambdabot for its short answers -----### 07:01:23 Look and say sequence is, each one is the run-length-encoding of the previous one. I have figured out how to prove that numbers greater than 3 does not occur and that "333" does not occur. 07:02:59 zzo38: then i suggest the next step is to show that every sequence will eventually have only numbers starting with 1 or 3, or only numbers starting with 2. 07:03:19 that's enough to tell you atoms ought to exist. 07:03:51 the rest is just checking every possible case, i think 07:06:27 ^ul ((::**)~^)((((:(((((((((((_)(9))(8))(7))(6))(5))(4))(3))(2))(1))(0)(!^))~*^^S!)(:a(~^)*~(()(~(~(:a~*):^))(a))~*^^)):^(()~)~**~^(:)~((a(~^)*~**)~a)~a(**~:((:)~(*)**)~a*~(^))**a(~*^^^!!^)***(~)~a(~a*^:)**a(:)**~^!!!a(~^)*~**)~a((, )S:^)**^):^ 07:06:29 3, 13, 1113, 3113, 132113, 1113122113, 311311222113, 13211321322113, 1113122113121113222113, 31131122211311123113322113, 132113213221133112132123222113, 11131221131211132221232112111312111213322113, 31131122211311123113321112131221123113111231121123222113, 132113213221133112132123123112111311222112 ...out of time! 07:07:01 oh that starts with 3 07:07:13 ^ul (()~^)((((:(((((((((((_)(9))(8))(7))(6))(5))(4))(3))(2))(1))(0)(!^))~*^^S!)(:a(~^)*~(()(~(~(:a~*):^))(a))~*^^)):^(()~)~**~^(:)~((a(~^)*~**)~a)~a(**~:((:)~(*)**)~a*~(^))**a(~*^^^!!^)***(~)~a(~a*^:)**a(:)**~^!!!a(~^)*~**)~a((, )S:^)**^):^ 07:07:15 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, 31131211131221, 13211311123113112211, 11131221133112132113212221, 3113112221232112111312211312113211, 1321132132111213122112311311222113111221131221, 11131221131211131231121113112221121321132132211331222113112211, 3113112221131112311311121321123113213 ...out of time! 07:07:19 OK, although I am not sure what the "atoms" are, that ought to exist? 07:08:29 zzo38: see https://en.wikipedia.org/wiki/Look-and-say_sequence#Cosmological_Decay 07:16:37 @tell quintopia looking at the l&s sequence starting with 1, i'm pretty sure that the 1113122 prefix recurs every 3 steps and will grow to an infinite sequence that does the same. 07:16:37 Consider it noted. 07:19:21 > let ls = concatMap (show . length <> take 1) . group in let p = ls . ls . ls $ "1113122" ++ drop 7 p in p 07:19:23 "111312211312111322212321121113121112131112132112311321322112111312212321121... 07:19:38 @tell quintopia > let ls = concatMap (show . length <> take 1) . group in let p = ls . ls . ls $ "1113122" ++ drop 7 p in p 07:19:38 Consider it noted. 07:24:17 -!- Frooxius has quit (Quit: *bubbles away*). 08:04:48 -!- hppavilion[1] has joined. 08:28:01 wtfcdoes ls do 08:28:20 it's look and say 08:28:37 ah 08:29:31 > let ls = show . length <> take 1 <=< group in iterate ls "1" 08:29:33 ["1","11","21","1211","111221","312211","13112221","1113213211","31131211131... 08:29:41 even shorter 08:30:14 wtf are <=< and <> 08:30:17 nice <=< 08:30:29 :t (<=<) 08:30:31 Monad m => (b -> m c) -> (a -> m b) -> a -> m c 08:30:43 f <=< g = \x -> g x >>= f 08:30:43 it's kleisli arrow composition, or something! 08:31:01 <> is mappend, which is pointwise on functions 08:31:09 My god 08:31:14 The fixion explains everything 08:31:28 @pl (<=<) `asAppliedTo` unsafeCoerce 08:31:28 (<=<) `asAppliedTo` unsafeCoerce 08:31:30 ah, <=< is like a monadic version of . 08:31:47 i thought that was a thing. ;_; 08:32:14 :t asAppliedTo 08:32:15 (a -> b) -> a -> a -> b 08:32:38 wait, what 08:33:13 -!- andrew has quit (Read error: Connection reset by peer). 08:33:28 > asAppliedTo succ 1 2 08:33:30 3 08:33:38 > asAppliedTo succ undefined 2 08:33:40 3 08:33:49 it's similar to asTypeOf 08:34:12 it just drops an argument? 08:34:30 yes, but forces the two arguments to be the same type. 08:34:49 > asAppliedTo succ 0.0 2 08:34:51 3.0 08:35:29 > asAppliedTo succ 'a' minBound 08:35:31 '\SOH' 08:35:31 -!- andrew has joined. 08:39:51 basically it's a trick for resolving ambiguous types. these days most use the ScopedTypeVariables extension instead. 08:56:09 oh that's what the fixion is 09:05:13 * oerjan learns about the neutron electric dipole moment 09:09:05 interesting, it's unobserved but the upper bound is five orders of magnitude larger than the boring theoretical prediction. sounds within range in the future... 09:10:27 (boring because a larger one could help explain matter vs. antimatter) 09:23:47 "Valery Nesvizhevsky of the Institute Laue-Langevin and colleagues found that cold neutrons moving in a gravitational field do not move smoothly but jump from one height to another, as predicted by quantum theory." 09:25:44 A vague half-memory is telling me I was the person who first added asAppliedTo to lambdabot 09:44:00 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 09:51:18 -!- ^v has quit (Ping timeout: 260 seconds). 09:59:45 -!- kragniz has changed nick to a_kragmas_tree. 10:39:51 oerjan: whoa, sweet 10:45:54 coppro: which part? 10:46:31 the last line 10:47:27 yeah, it pretty much says that gravitation _is_ quantum, we just don't know how yet 10:48:11 how did they figure that? 10:48:47 i don't know, it's from https://en.wikipedia.org/wiki/Ultracold_neutrons#Observation_of_the_gravitational_interactions_of_the_neutron 10:50:11 there's a reference but it's not linked properly. 10:52:20 i found it while wikiwalking from today's xkcd. 11:44:18 -!- scoofy has joined. 12:07:13 -!- heroux has joined. 12:11:02 -!- FreeFull has quit (Ping timeout: 246 seconds). 12:32:03 -!- FreeFull has joined. 12:37:17 [wiki] [[RFOL]] http://esolangs.org/w/index.php?diff=45994&oldid=34003 * LegionMammal978 * (+1) /* Explanation (if ever were one needed) */ 12:50:42 -!- andrew has quit (Remote host closed the connection). 12:52:49 -!- Patashu has quit (Ping timeout: 272 seconds). 12:58:22 -!- TieSoul has joined. 13:30:08 -!- izabera has quit (Changing host). 13:30:08 -!- izabera has joined. 13:59:36 Merry Christmas guys 14:10:21 merry christmas 14:58:27 I wrote this for my uni's CS society: https://twitter.com/HackSoc/status/680315314941366272 15:05:16 ^bf ++++++++[>++++++++<-]>[>+>+<<-]>+>++++++++.<.++.-->+++.[->+>+<<]>++++++++++++++.++++++.-------.----->++.<<<.>>. 15:05:16 HACKY_XMAS 15:11:27 I just watched the Queen's Christmas Message for the first time. 15:11:37 Would it be impolite to say it was just a tiny bit boring? 15:14:00 It's one of those capital-T Traditions 16:04:48 -!- J_Arcane has quit (Ping timeout: 265 seconds). 16:10:31 [wiki] [[Pig]] http://esolangs.org/w/index.php?diff=45995&oldid=45861 * LegionMammal978 * (-90) /* Interpreter */ 16:22:34 -!- Sgeo|Hell has joined. 16:24:28 Apartment being renovated. Stuck at dad and step-mom house. I may have frowned at her when I saw her at the airport, she's pissed off. I wasn't expecting to see her, dad had previously said he didn't think she'd wake up early to meet me after I indicated I'd rather avoid seeing her 16:25:10 -!- boily has joined. 16:25:13 MERRY ESOTERICHRISTMAS! 16:25:42 Merry coming back to the USA to a nightmare mas 16:26:22 bohily. merreux juvidad! 16:27:02 Sgeo|Hell: eep 16:29:03 Sgeo|Hell, next year if you can pretend to be a university student you can come to my parents' instead 16:30:39 I just want to hear from someone objective I think. And also independence. That would be nice. 16:31:24 Sgeo|Hello. how many brimstone pits out of ten would you rate your Hell? 16:31:37 i don't know how to be objective about such things 16:36:02 * oerjan has never quite noticed whether Sgeo|Hell's family celebrates christmas or not 16:36:31 s/noticed/got quite clear on/ 16:36:53 also, i'm not sure whether that would make it better or worse. 16:38:49 -!- boily has quit (Quit: WeeChat 1.3). 16:40:09 -!- boily has joined. 16:40:33 * oerjan is suddenly reminded of one of his mother's memorable statements, which translates to approximately "You ought to be able to have fun with people you don't like." 16:41:36 -!- Sgeo|Hell has quit (Ping timeout: 252 seconds). 16:42:18 Sgeo pinged out. are they still alive? 16:42:50 -!- J_Arcane has joined. 16:42:58 oerjan: we're going to be celebrating christmas here at my parent's house. I don't know how many people will come, and I'll most certainly not know them all. 16:48:22 any crazy aunts or uncles 16:50:24 -!- mauris has joined. 16:51:34 -!- Sgeo|Phone has joined. 16:52:22 Family is Jewish, no Christmas celebrations. Also, webchat on phone is annoying, I think phone swaps out web pages frequently, hence my ping out 16:53:05 -!- mauris_ has quit (Ping timeout: 260 seconds). 16:54:05 oerjan: more like cousins with creative backstories. 16:57:21 now i want to find that old "jiddishkeit" test i once read... 16:59:06 i think it was back on usenet and i cannot find any trace on it. except i recall there was one question that had question options ranging to "hannukah bush" and "christmas tree" 16:59:54 *answer options 17:00:22 * oerjan also noticed hannukah was early this year 17:00:33 is it some kind of geek code test? 17:00:48 similar, maybe 17:01:40 Christmas is not just for Christians, although it is where the name comes from. It is a national holiday too. 17:02:20 boily: ooh adding geek code i found it http://www.netfunny.com/rhf/jokes/98/Apr/yiddishkeit.html 17:03:36 -!- Sgeo|Phone has quit (Ping timeout: 252 seconds). 17:06:42 * oerjan recalls having a .sig file 17:09:44 -!- Sprocklem has quit (Ping timeout: 245 seconds). 17:37:47 TIL there are Yemenite Reconstructionists. 17:40:19 i was wondering about that one 17:42:30 do you have multiples wives and/or husbands and/or fungots? 17:42:30 boily: that is good to remove). 17:42:44 ok, no fungots. 17:42:44 boily: to a max of 3 digits, i think that's actually a meme on a forum about 15 minutes to encounter an error? 17:43:08 999 luftfungots ♪ 17:43:08 boily: some demos at fnord were just some interesting ideas, but it would work much better then 17:47:55 -!- Lord_of_Life has quit (Excess Flood). 17:48:36 -!- Lord_of_Life has joined. 18:26:30 -!- hppavilion[1] has joined. 18:50:43 -!- AlexR42 has joined. 18:53:04 -!- Sprocklem has joined. 19:03:56 -!- Frooxius has joined. 19:17:01 Do you still have the .sig file? 19:24:28 I wanted to run my own NNTP server in order to invent Unusenet; all of the group names must start with "un" and then optionally a number and then a dot, and then the rest is in RDN format. If the number is included, it is used to specify how to find the primary server; if no number is specified then it means the primary server is unspecified. 19:29:30 -!- deltab has quit (Ping timeout: 260 seconds). 19:31:25 -!- deltab has joined. 19:38:22 -!- TieSoul has quit (Ping timeout: 260 seconds). 19:40:31 This is a Un-card suggested by my brother: In A Band With Others {1W} Enchantment - Aura ;; Enchant creature ;; Whenever enchanted creature attacks as part of a band containing additional creatures, its controller must sing a song during the entire duration of the attack. Combat damage is not dealt until song is complete. 19:44:36 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 19:46:32 zzo38: i have some old .sig files concatenated in .sig.old 19:48:08 hezzo38. you have a brother? 19:49:37 -!- boily has quit (Quit: GENERATIONAL CHICKEN). 19:59:16 @metar KGRR 19:59:17 KGRR 251953Z 32006KT 10SM FEW028 SCT250 08/M01 A3027 RMK AO2 SLP255 T00781011 20:00:00 Remind me what SLP255 means? 20:00:35 -!- Lymia has quit (Ping timeout: 240 seconds). 20:01:38 -!- trn has quit (Ping timeout: 255 seconds). 20:01:43 -!- hppavilion[1] has joined. 20:08:46 Yes I have brother 20:30:52 -!- oerjan has quit (Quit: Nite). 20:36:54 -!- Lymia has joined. 20:39:20 -!- trn has joined. 20:50:41 -!- mauris has quit (Ping timeout: 255 seconds). 20:58:12 -!- ^v has joined. 20:58:29 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 21:19:14 -!- Elronnd has changed nick to net. 21:19:24 -!- net has changed nick to Elronnd. 21:25:09 -!- infinitymaster has joined. 21:42:49 -!- dcentral has joined. 21:50:30 -!- dcentral has quit (Ping timeout: 272 seconds). 21:56:25 -!- hppavilion[1] has joined. 22:04:40 -!- infinitymaster has quit (Remote host closed the connection). 22:10:00 -!- AlexR42 has quit (Quit: My Mac has gone to sleep. ZZZzzz…). 22:10:22 -!- trn has quit (Quit: quit). 22:14:20 -!- trn has joined. 22:32:32 -!- haavard has joined. 22:59:59 -!- Patashu has joined. 23:25:57 tswett: current barometric pressure extrapolated to sea level is 1025.5 hPa 23:26:16 Ah, right. Sea-level pressure. 23:38:21 deltab: Are you a bot? That message looked bery botty 23:39:28 tswett: Here's an idea for a language. A full, TC-with-IO-and-shit language. Based entirely on matched brackets (not necessarily all parentheses) 23:39:57 hppavilion[1]: ey was answering my question. 23:40:00 Even better, a full-blown mathematical logic/calculus/whatever 23:40:01 Ah 23:40:16 "What does SLP255 mean?" "It means current barometric pressure extrapolated to sea level is 1025.5 hPa." 23:40:21 Oh 23:41:01 I wasn't logged in until the response, which looked like it was autofetched and formatted into a pre-made message 23:41:27 tswett: What do you think of the Bracket Logic idea? 23:41:44 Of course, it'd be declarative 23:44:59 There's probably be a preprocessor that lets you generate strings 23:46:31 Well... sounds a lot like Lisp or something. 23:46:46 But, y'know, without the things other than parentheses. 23:47:57 Anyway, here's an idea. 23:48:16 I am not sure how, but I've ended up in an argument in another channel about whether Unicode adding emoji is a bad thing or not 23:48:21 (I'm on the "not" side) 23:48:28 Take the Iota "i" operator. 23:48:45 tswett: OK. 23:48:56 (abc...) means (i a b c ...). 23:48:57 * hppavilion[1] robs the Museum of Eso and takes the Iota "i" operator 23:49:15 I follow 23:49:16 For now 23:49:23 So, for example, ((()())(()())(()())) means (i (i i i) (i i i) (i i i)). 23:49:47 I think I get it 23:49:54 Yes, I do 23:50:16 () -> i; (...) -> (i ...) 23:50:26 Yup. 23:50:29 Or something along those lines 23:50:44 That works, but I was thinking of a more parenthesis-rich language 23:51:12 Like... more than 100% parentheses? 23:51:17 (...), [...], {...}, <...>, (*...*), [|...|], etc. etc. etc. 23:51:28 Ah. 23:51:34 It could probably be reduced to pure parentheses, but I would avoid that 23:51:46 And I'd want to try to make it something new, instead of just OISP 23:52:01 (One Instruction Set Computer+LISP) 23:52:31 I mean, I guess that's looking for a little much, as I'm not a real mathematician yet xD 23:52:32 Well, make it so that () uses the S operator, [] uses the K operator, and {} uses the I operator. 23:52:45 Not to be confused with the Iota "i" operator. 23:53:05 tswett: But that's not "new", that's just combinatory logic with a slightly new (and, admittedly, probably better) syntax 23:53:14 True. 23:53:54 (You should write a short paper on []=S, {}=K combinatory logic. See if we can get it adopted into common use.) 23:53:55 -!- infinitymaster has joined. 23:54:18 tswett: My initial thought was to make {}=0, {{}}=1, etc. 23:54:30 But then I realized that that's not as much fun as what I /could/ do 23:54:54 I want to make a highly-extensible logic of some sort based entirely around matched brackets. THAT is my goal. 23:55:06 A compound logic/esolang