00:00:00 I like the naming scheme for your meeting rooms. 00:00:11 Well, we've got many. 00:01:30 I mean the confusing one. 00:02:31 I have my weekly 1:1s in Hell. 00:03:01 Soon you'll join this fellow in hell! -- the Wizard of Yendor 00:03:39 -!- hppavilion1 has joined. 00:10:31 could be worse, like a cafeteria named hell 00:13:17 Jafet: where you are not sure if that pink gelatinous blob is a) spam with too much gelatin in it, b) some sort of desert, c) something gone bad or d) both all of these and none 00:14:25 well, you'd get a tired movie quote every time your team has a deadline 00:17:40 redbelly might not be a good name then (is: rauðmagi) 00:25:23 -!- Lymia has quit (Ping timeout: 246 seconds). 00:31:53 -!- Lymia has joined. 00:34:20 -!- Lymia has quit (Read error: Connection reset by peer). 00:39:06 -!- Lymia has joined. 01:01:48 `wisdom 01:01:49 oerjan//Your wise ass-@messages-lord fanfic oerjan is a lazy expert in mercury computation. Also a Glaswede who dislikes Roald Dahl. He could never remember the word "amortized" so he put it here for convenience; but lately it's the only word he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 01:16:41 `wisdom 01:16:43 ehird//ehird is the person who Taneb definitely isn't. 01:16:54 `w 01:16:56 bø//Bø is not just one, but _two_ municipalities in Norway. And not just three, but at least _four_ farms. Ah ah ah ah ah! 01:17:10 Wowee! 01:17:36 `5 01:17:39 1/3:775) olsner: over the undertow! under the overpass! around the future and not just fnord for example. it's just the syntax \ 567) (Of Minecraft:) So basically I didn't understand what it was at all, I thought maybe you were meant to be like a worm and just sort of wriggle about underground. \ 33) [...] s 01:17:40 `n 01:17:40 2/3:ometimes i cant get out of bed becasue the geometry of the sheet tangle is too fascinating from a topological perspective \ 724) ais523: thats very zen really no, it's more or less the opposite of zen \ 640) pikhq: And of course Rick Perry, saying that there's something wrong with a country where gays can 01:17:42 `n 01:17:43 3/3: serve in the military but we don't elect a douchebag as president. 01:18:03 * erkin ponderous 01:18:16 `` doat | grep Perry 01:18:21 7212:2016-03-14 learn pbflist is update notification for the Perry Bible Fellowship webcomic. http://pbfcomics.com/ 01:18:28 I guess nitia added it. 01:18:33 The good old days. 01:20:06 hellorkin. 01:20:20 Long Live Nitia. May the Diæresis be with You. 01:20:50 hëllö 01:25:21 -!- Zarutian has quit (Quit: Zarutian). 01:42:10 -!- MDude has quit (Ping timeout: 268 seconds). 02:00:56 <\oren\> wtf, now austria was taken over my savoy? 02:01:06 <\oren\> *by 02:01:29 That's what happens when your builds are slow. 02:01:57 Have you ever noticed that "slow" and "scow" differ by only one letter? 02:04:23 -!- oerjan has quit (Quit: Nite). 02:04:31 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:22:18 -!- MDude has joined. 02:26:18 -!- boily has quit (Quit: BROKER CHICKEN). 02:54:00 Is there such a predecimal coin as 2 bob 1 pence? 02:55:22 You mean, currencies called bob and pence with a fixed exchange rate? 02:55:51 according to http://projectbritain.com/moneyold.htm a florin was called 2 bob hth 02:56:32 But that is only 2 bob, not 2 bob 1 pence, it is a bit short. I do know of a florin and it is a bit less 02:56:58 Oh, a coin with that value? 02:57:26 Yes, that is what I mean 03:36:52 -!- moony has quit (Remote host closed the connection). 04:16:17 -!- augur has joined. 04:27:03 <\oren\> The system in harry potter is all kinds of f'd up 04:27:36 <\oren\> 17 and 29? really? ugh 04:29:03 Prime numbers are more magic. 04:29:28 but are they MoR magic? 04:30:40 of researchers polled about P = NP: “126 (83%) believed the answer to be no, 12 (9%) believed the answer is yes, 5 (3%) believed the question may be independent of the currently accepted axioms and therefore impossible to prove or disprove, 8 (5%) said either don't know or don't care or don't want the answer to be yes nor the problem to be resolved.” 04:40:55 <\oren\> I think the answer is currently no, but it is possible that such problems can be solved by a computer of a different kind 04:42:11 P = NP isn't a question about what computers that you can build can do, it's a question about Turing machines. 04:42:50 <\oren\> right. so I think it might be possible to construct a computer with more theoretical power than a turing machine. 04:43:45 I'm not convinced we can construct a computer with infinite memory :P 04:43:51 <\oren\> at which point P = NP would be rendered a less interesting question 04:44:00 That seems likely (though I doubt you can build a nondeterministic turing machine), but it's irrelevant to P=NP. 04:44:15 I think it's an interesting question anyway. 04:44:33 oh, exactly one of the respondents did not want it to be resolved 04:44:40 job security, I guess 04:44:47 Can you believe people don't even know whether P=PSPACE? 04:44:55 Computer scientists are clueless. 04:45:06 they're to egotistic to take the I out of the picture 04:45:12 *too 05:15:14 At least we're certain P is a subset of PSPACE! 05:15:57 (but if P=PSPACE then P=NP) 05:17:59 POOCHTIME ⊆ POOCHSPACE 05:18:25 POOCHTIME ⊆ SMOOCHTIME 05:40:54 -!- augur_ has joined. 05:42:30 -!- augur__ has joined. 05:42:31 -!- augur_ has quit (Read error: Connection reset by peer). 05:42:35 -!- augur__ has changed nick to augur_. 05:43:09 -!- augur has quit (Read error: Connection reset by peer). 06:15:42 Do you like the shorter implementation of Myth that I made up? Do you like my suggestion of the variant also? 06:19:40 Also, is the link for 140 bytes contest even valid? 07:25:14 -!- impomatic has quit (Quit: http://corewar.co.uk). 08:27:09 -!- AnotherTest has joined. 08:42:09 sdfasdf 08:45:06 good point 08:45:22 shachaf: Where does SPOOCHTIME come into play? 08:52:56 -!- erkin has quit (Quit: Ouch! Got SIGABRT, dying...). 08:59:20 -!- SirDarius has joined. 09:09:11 Is that a combination spoon/pooch? 09:18:08 shachaf: I didn't play but if there is a way I suspect I know what it is. (naq vg'f npghnyyl n znc... whfg cynprq va n jnl gung lbh unir frireny zvahgrf gb pbzcyrgryl sbetrg nobhg vg) 09:18:41 and if that's it it's something that I might have missed forever anyway. 09:19:57 Yes, that's it. 09:20:11 No spoilers saying it now since you'll certainly check. 09:21:13 I suppose saying it existed was kind of spoilers. 09:33:33 it's okay. 09:36:14 I should've expected this, rather than thinking that the developers are a bunch of assholes, but I opted for the latter :P 09:37:03 But memorizing the path is still annoying. 09:41:29 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 09:45:15 I'm considering to use pen and paper. 09:52:57 What you need is someone next to you who can focus on remembering the path. 09:53:19 One time I got lucky and the correct path was all the way to the right and then all the way up. 09:53:30 But then I did badly on a bunch of other puzzles. 10:15:25 -!- augur_ has quit (Remote host closed the connection). 10:31:33 -!- oerjan has joined. 10:32:48 so much for sleeping 10:51:33 -!- augur has joined. 10:54:58 -!- augur has quit (Remote host closed the connection). 11:01:48 -!- augur has joined. 11:26:00 shachaf: I'm also planning on just restarting if the path is not a zigzag :P 11:32:08 @unlambda ``@i`|cT 11:32:09 T 11:32:14 fancy 11:33:35 -!- boily has joined. 11:38:38 `wisdom 11:38:42 I golfed down my code 5 further bytes 11:38:45 styrofoam//styrofoam is Taneb's only weakness. 11:38:55 booda fternoily 11:39:07 b_jellonas. aiming for the most golf code? 11:39:17 bon matœrjan! couldn't sleep? 11:39:32 i stayed up too late 11:39:42 boily: not necessarily, but I want to golf it while keeping the underlying beauty of how the evaluation step is just pack-unpack-pack-unpack 11:39:53 boily: http://codegolf.stackexchange.com/a/112163/6691 11:39:57 and then woke up after 5 hours or so 11:40:17 you could probably get a somewhat shorter solution that doesn't try to use this method, but like arrays or bitwise stuff or something 11:40:25 why isn't my unlambda code working when my previous test did :( 11:40:37 if you do, you should post it separately 11:43:49 -!- augur has quit (Remote host closed the connection). 11:45:14 [wiki] [[Deadfish i]] https://esolangs.org/w/index.php?diff=51305&oldid=30640 * GermanyBoy * (+243) added link to implementation 11:45:33 damn, what's @ 11:46:08 int-e: read character 11:46:56 Ah. 11:46:59 (then apply argument to i if you succeeded) 11:47:08 (or to v otherwise.) 11:48:09 i'm trying to debug my code in TIO, but something's wrong even though the central part is already tested. 11:49:31 [wiki] [[Deadfish i]] https://esolangs.org/w/index.php?diff=51306&oldid=51305 * GermanyBoy * (+148) added note about interpreters 11:58:39 now i cannot get the already tested part to work :( 12:01:11 :( 12:02:19 oerjan: typical 12:09:23 -!- dok has quit (Ping timeout: 264 seconds). 12:09:30 ok the part tested before that still works. 12:13:20 `? password 12:13:22 The password of the month is n9y25ah7 12:13:53 `learn The password of the month is OSBDemoLap9W53! 12:13:56 Relearned 'password': The password of the month is OSBDemoLap9W53! 12:15:47 what? really? 12:17:21 where do the passwords of the month come from? 12:19:16 oh duh i forgot the self application 12:19:29 i have no idea where the latest one came from 12:19:37 boily: well, for the last two, one was a tweet by Sean Spicer, and the other comes from a CIA document leaked by Wikileaks. 12:20:47 (I guess that means I should be sorry for all residents who are government contractors or employees with security clearance in the US) 12:21:24 ...didn't help. 12:22:25 -!- LKoen has joined. 12:23:32 oerjan: well what *are* you trying to do? 12:23:49 i'm trying to parse a digit in unlambda. 12:23:55 into a church numeral. 12:23:56 ah, eww. 12:24:21 the part of my code that counts v's until the next i argument is working. 12:24:45 the part that _skips_ v's until the next i argument, then passes to the first part _was_ working previously. 12:24:56 or so i thought my test showed. 12:25:55 (once i have those, it should be a simple matter of wrapping `?9`?8 ... around it. 12:31:15 -!- boily has quit (Quit: BRASS CHICKEN). 12:31:56 -!- impomatic has joined. 12:33:29 ok it's working again. i'm not entirely sure what i changed in the test code, i may have confused i's and v's. 12:38:36 gah now i'm forgetting the @ 12:39:33 yay, it parsed a 4 12:40:53 @unlambda ``@i````?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii.*i 12:40:54 * 12:40:59 argh 12:41:05 oh 12:41:19 @unlambda ``@i````?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii.*i7 12:41:19 ******* 12:41:23 there you go 12:42:31 next step: parsing a whole number 12:42:35 -!- oerjan has quit (Quit: Later). 13:07:21 -!- dok has joined. 13:26:00 -!- sebbu2 has quit (Ping timeout: 240 seconds). 13:49:53 -!- Zarutian has joined. 14:06:39 * Taneb aaaaaaaaah 14:07:05 I've just unofficially heard that I'm going to be offered PhD funding 14:07:58 Taneb: NICE! congrats 14:08:02 where and in what topic? 14:08:38 I mean, roughly where and in roughly what topic, you don't have to give the detailed phd research program you have to submit here, only a very short version 14:12:15 Newcastle University, applying graph theory for compilers targetting many-core architecture 14:13:21 Sounds scary, which is normal for a PhD research topic. Thanks. 14:13:56 With the guy who wrote this: https://blogs.ncl.ac.uk/andreymokhov/graphs-a-la-carte/ 14:14:00 (warning: Haskell) 14:14:36 you make Haskell sound scary 14:14:48 when in reality it's just lens :-P 14:15:21 (I mean that's what is scary, to me...) 14:41:31 Taneb: thanks for the link though I'm really more interested in the predecessor post :) 14:42:13 Ah, I meant to link to that one 14:53:18 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”). 14:56:18 -!- `^_^v has joined. 14:57:44 fun little exercise 14:58:23 (this one: "prove that ε is the identity of + from the minimal set of axioms above. [...] Also prove that + is idempotent") 15:43:30 -!- Marcela_Gandara1 has joined. 15:52:23 -!- Phantom_Hoover has joined. 15:59:29 adsf 16:03:17 -!- Marcela_Gandara1 has quit (Ping timeout: 260 seconds). 16:06:41 hm 16:07:40 could you give an FSA or PDA-level language a surreal "forever" construct/zeno construct/infinity construct that would allow it to run countably infinitely many instructions in finite time, and would it gain a computational level as a result? 16:09:03 fsa it would be useless because fsas all halt or recur anyway 16:09:14 could be interesting with a pda 16:11:09 offhand i can't immediately tell from google whether halting is decidable for PDAs 16:18:14 -!- Zarutian has quit (Quit: Zarutian). 16:34:07 I think the FSA equivalent to the zeno construct would be allowing an infinite number of states 16:34:39 which, does, indeed, make it TC, I believe 16:36:36 and allowing an uncountably infinite number would probably make it super-TC 16:38:46 [wiki] [[Zeno]] https://esolangs.org/w/index.php?diff=51307&oldid=51301 * Rdococ * (+30) yaya 16:40:16 hm 16:40:22 what about hyper-lazy evaluation 16:40:59 expressions are never evaluated, even when needed. they are only evaluated when they need to be printed to the screen. 16:41:32 -!- mtve has joined. 16:41:37 -!- sebbu has joined. 16:58:57 I think the FSA equivalent to the zeno construct would be allowing an infinite number of states 16:59:09 this is basically just turning it into a turing machine 17:00:39 which, does, indeed, make it TC, I believe 17:03:21 -!- SirDarius has quit (Quit: Leaving). 17:04:46 sure, my point is more that it's not a very interesting way of making it tc 17:05:58 true 17:06:28 I really want a more intriguing way to make a TC language super-TC, other than adding a surreal forever construct 17:10:57 -!- DHeadshot has joined. 17:16:58 int-e, I ended up proving that in Agda 17:21:39 proving what 17:24:41 Phantom_Hoover, given the axioms that + is commutative ans associative, (G, →, ε) is a monoid, → distributes over +, and x → y → z = x→y + x→z + y→z, prove that ε is the identity of +, and that + is idempotent 17:24:47 (taken from https://blogs.ncl.ac.uk/andreymokhov/an-algebra-of-graphs/ ) 17:31:02 -!- Lord_of_Life has quit (Excess Flood). 17:32:39 -!- hppavilion1 has joined. 17:32:59 -!- Lord_of_Life has joined. 18:00:28 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 18:04:51 -!- oerjan has joined. 18:05:01 -!- hppavilion1 has joined. 18:53:05 -!- ais523 has joined. 19:02:44 hmm, Isabelle makes this almost pointless 19:04:23 http://int-e.eu/~bf3/tmp/Graph.thy.png 19:04:54 (those "metis" lines were generated by sledgehammer... no manual collecting of facts was involved) 19:06:45 (the Graph.thy file is there too but it's not very readable with the text encoded unicode symbols) 19:07:43 * oerjan solved that exercise in a vim window 19:07:56 I used emacs ;) 19:08:04 HERESY 19:08:44 http://int-e.eu/~bf3/tmp/graph.trs is what I produced manually 19:09:09 (it's a .trs file because I tried to use a completion tool on it but the one I used failed) 19:09:18 argh no newlines in IE 19:09:47 the source view was better 19:09:47 hmm, no content-type, I may be able to fix that 19:10:54 int-e: why do you hate infix notation tdnh 19:11:25 now it's text/plain would that be better? 19:11:38 no, it's still prefix 19:11:51 then I don't know what the problem is. 19:12:07 ... 19:12:12 oerjan: I don't hate infix, I just wanted to stick to the TRS format... and then suddenly I was adding 5 terms. 19:12:31 so I gave in at that one point :P 19:13:58 shachaf: after all that practice yesterday I beat the mountain king in two attempts today 19:15:11 your first two lemmas are the same as my first two lines, at least 19:15:16 517+105. +100 was the rpyvcfr, I thought it fitting to do that right after that race. 19:15:27 (after i cleaned it up) 19:17:23 but then i did idempotency from that 19:17:32 also I proved +(0,0) = 0 last. 19:17:46 um that's your second lemma 19:17:56 chronologically 19:18:12 ok. because that made the rest trivial. 19:19:24 although i had z = e + z + z earlier. 19:20:32 hm Taneb said + was commutative, did you ignore that? 19:20:56 well it's listed 19:22:04 it's possible that I didn't think of using it somewhere 19:22:15 but I did not consciously choose to ignore it 19:22:34 well you have both left and right identity lemmas 19:22:46 yes. 19:22:53 didn't think of it too much :P 19:22:56 avout 19:22:58 about 19:23:15 WELL PROVED, ANYWAY 19:23:22 :P 19:23:35 hi 19:24:11 now that you mention it, it's funny that the two proofs in isabelle come out so differently 19:26:23 anyway, commutativity is indeed not needed to prove those three laws. fun. 19:28:17 nor is the associativity of the arrow? fancy. 19:30:36 associativity of the arrow follows from the remaining laws. fun. 19:30:58 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 19:34:40 int-e: Sounds like you have more jams than I do. 19:34:46 int-e: Are you going for all the jams? 19:34:52 Ah. (x --> y) --> z = (x --> y) --> (E --> z), and then you can do decompositions... 19:35:21 shachaf: I don't know yet. But I've googled maximum scores now... I might just try. 19:35:57 Do you have a second +? 19:36:04 no. 19:36:28 I think I was at ~500+70 19:36:43 Did you listen to the eclipse lecture? 19:36:59 partly 19:37:05 I cooked dinner 19:37:39 What did you cook? 19:40:02 please ignore the proof attempt, proving (x --> y) --> z = (x --> y) --> z may not be so interesting after all. 19:40:15 shachaf: nothing fancy, some pasta with sausages 19:41:16 Fresh pasta? 19:44:06 never mind the associativity, I had messed up the decomposition law... formalization doesn't prevent typos :-( 19:45:37 I didn't make it myself if that's what you mean. 19:46:53 I didn't spend much time in the kitchen either ;) 19:49:12 -!- augur has joined. 20:16:07 [wiki] [[Natyre]] N https://esolangs.org/w/index.php?oldid=51308 * Keymaker * (+2697) Time for this one to see the daylight... A new type of counter machine language. 20:16:58 [wiki] [[User:Keymaker]] https://esolangs.org/w/index.php?diff=51309&oldid=46759 * Keymaker * (+69) Listed Natyre. 20:19:28 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 20:21:14 [wiki] [[User:Keymaker]] https://esolangs.org/w/index.php?diff=51310&oldid=51309 * Keymaker * (+68) Forgot something... 20:24:04 -!- ais523 has quit (Remote host closed the connection). 20:25:14 -!- ais523 has joined. 20:34:06 @unlambda ``@``` `d``s`k`s``s`ks``s`kk``?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii`s`k``s``s`ksk```s``s`kski``s``s`ksk``s``s`kski i .* i4 20:34:07 unlambda: Unknown operator '4' 20:34:07 CallStack (from HasCallStack): 20:34:07 error, called at Main.hs:45:38 in main:Main 20:34:25 hm now what 20:35:07 @unlambda ``@i``` `d``s`k`s``s`ks``s`kk``?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii`s`k``s``s`ksk```s``s`kski``s``s`ksk``s``s`kski i .* i4 20:35:08 ************** 20:35:29 1*10 + 4 20:37:03 @unlambda ``@i``` `d``s`k`s``s`ks``s`kk``?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii`s`k``s``s`ksk```s``s`kski``s``s`ksk``s``s`kski ```s``s`kski``s``s`kski .* i2 20:37:03 ****************************************** 20:37:10 4*10+2 20:45:07 -!- DHeadshot_ has joined. 20:45:28 -!- DHeadshot has quit (Ping timeout: 240 seconds). 20:50:23 -!- hppavilion1 has joined. 21:03:20 At 2.122e+10 YHz, a sound travelling through air would (in an ideal environment) have a wavelength at the Planck Length 21:03:34 Anything higher pitched than that and physics would break (I'm pretty sure). 21:03:53 (I mean, obviously you'd just mess up the air eventually, but that's in theory) 21:07:00 remember that the frequency also is proportional to the single particle energy 21:07:21 so the sonon is going to be earth-shattering. 21:08:00 hm it must be called something else. 21:08:28 ah phonon 21:14:21 <\oren\> I wonder what frequency is the physical maximum 21:15:20 <\oren\> at a certain point vibrating object would be supersonic 21:15:33 -!- wob_jonas has joined. 21:16:13 ais523: I posted that modified obfu stuff I was talking about the last Friday. http://codegolf.stackexchange.com/a/112163/6691 21:16:25 The pack-unpack-pack-unpack thing 21:23:58 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 21:28:38 Though I prefer the original obfu post to this golf version. 21:46:01 -!- Perenelle has joined. 21:46:40 -!- Perenelle has quit (Client Quit). 22:13:52 -!- erkin has joined. 22:14:57 hm program is not returning the right number, but it _is_ calling the right I/O functions in the right order. 22:15:14 * oerjan learning how to printf debug unlambda 22:15:58 it's easy for a primitive function, just put `d`.D where D is your chosen debug character. 22:16:02 -!- hppavilion1 has joined. 22:17:35 i need to find a way to print the recursion argument... it _should_ be a church numeral so it's just a matter of where to put the dang thing 22:29:25 -!- augur has quit (Remote host closed the connection). 22:30:02 -!- augur has joined. 22:30:52 ok, all but the first iteration gets passed a 1 22:33:16 oerjan: are you writing unlambda by hand? or compiling from a more readable language? 22:34:20 -!- augur has quit (Ping timeout: 246 seconds). 22:38:25 by hand 22:38:50 oerjan: do you at least use some sort of interpreter in unlambda and writing most of the code in an interpreted language? 22:39:01 no. 22:39:10 ok 22:39:11 i am sort of trying to golf it 22:39:26 which is miserably failing on pure length terms 22:39:32 you can still help golfing with an optimizing compiler 22:42:31 then i'd have to write one and i've never really done that. i have a sort of slightly-optimizing abstraction eliminator which i'm not really using because it's missing subtleties. 22:43:05 write an interpreter then? 22:43:13 22:44:39 i'm not good at telling programs how to make judgement calls. 22:45:50 also, unlambda isn't good for parsing, that's sort of my _problem_ here... 22:46:47 right now, i'm trying to debug a program for parsing a simple ]-terminated number 22:57:06 -!- boily has joined. 22:58:06 `wisdom 22:58:10 soap//Soap is the main ingredient for the iridescent visions that internet startups sell to investors. 22:58:22 `cwlprits soap 22:58:31 int-̈e 23:02:17 -!- `^_^v has quit (Quit: This computer has gone to sleep). 23:03:00 bood midnily again 23:04:46 bons⅝irjan. 23:04:59 did you sleep between? 23:05:28 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 23:09:26 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 23:17:06 -!- DHeadshot_ has quit (Ping timeout: 240 seconds). 23:18:23 about 4 1/2 hours 23:19:26 -!- DHeadshot has joined. 23:19:55 hm curious, the calculation is performed but not passed on to the recursion... 23:22:02 there is no recursion. 23:22:20 indeed, unlambda strictly only has self application. 23:22:39 huhwhat 23:22:45 `? oerjan 23:22:46 Your wise ass-@messages-lord fanfic oerjan is a lazy expert in mercury computation. Also a Glaswede who dislikes Roald Dahl. He could never remember the word "amortized" so he put it here for convenience; but lately it's the only word he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 23:23:40 `dowt oerjan 23:23:48 0:2012-02-16 Initïal import. \ 673:2012-08-27 run echo "Your evil overlord oerjan is a lazy expert in future computation. Also a lying Norwegian." >wisdom/oerjan \ 2649:2013-04-13 sed -i \'s/$/ And hates Roald Dahl./\' wisdom/oerjan \ 2650:2013-04-13 sed -i \'s/\\. And/ who/\' wisdom/oerjan \ 4652:2014-06-06 oerjan is the most shachafed person. 23:24:48 `swrjan s,.*ord,evil overlord, 23:24:50 oerjan//Your evil overlord he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 23:24:58 `revert 23:24:59 Done. 23:25:03 `swrjan s,.*lord,evil overlord, 23:25:05 oerjan//Your evil overlord fanfic oerjan is a lazy expert in mercury computation. Also a Glaswede who dislikes Roald Dahl. He could never remember the word "amortized" so he put it here for convenience; but lately it's the only word he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 23:25:18 `swrjan s.fanfic .. 23:25:20 oerjan//Your evil overlord oerjan is a lazy expert in mercury computation. Also a Glaswede who dislikes Roald Dahl. He could never remember the word "amortized" so he put it here for convenience; but lately it's the only word he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 23:26:02 the ciiiircle of something 23:26:36 wait. there's a `swrjan command now?!? 23:27:13 `slwd oerjan//s/ "/ “/;s/" /” / 23:27:14 oerjan//Your evil overlord oerjan is a lazy expert in mercury computation. Also a Glaswede who dislikes Roald Dahl. He could never remember the word “amortized” so he put it here for convenience; but lately it's the only word he can ever remember. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it. 23:27:30 `revert 23:27:31 Done. 23:27:40 oerjan is evil but not to the point of evilquotes 23:28:36 itym beautyquotes hth 23:29:03 -!- tromp has quit (Read error: Connection reset by peer). 23:29:14 well i am a wikipedian 23:29:41 -!- tromp has joined. 23:30:02 Oh, would you like to fix some Wikipedia articles for me? 23:33:48 -!- Zarutian has joined. 23:34:56 yay found it 23:35:07 no do it yourself hth 23:35:44 the dogs now howl 23:35:59 ``````sii``s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`d``s`k`s``s`ks``s`kk``?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`s``s`ksk`k``s`k`ss``s`kkk`kii`s`k``s``s`ksk```s``s`kski``s``s`ksk``s``s`kski`k``s`d 23:36:00 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `````sii``s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`kd``s`k`s`kk``s``s`ks``s``s`kskk`k`d``s`k`s``s`ks``s`kk``?0`?1`?2`?3`?4`?5`?6`?7`?8`?9```sii``s`k`s`kc``s``s`ks``s`kk``s`ks``s`kk``s`kd``s`kk``sii`k``ss`k`k````sii``s`k`s`k`s`kc``s``s`ks``s`k`s`ks``s`k`s`kk``s`k`s`ks``s`k`s`kk` 23:36:05 `k`s`@?]k`ki.*i42] 23:36:06 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: k`s`@?]k`ki.*i42]: not found 23:36:08 oops 23:36:24 oh, and it didn't fit either 23:36:24 -!- hppavilion1 has joined. 23:36:31 very well 23:37:24 a working number parser in a mere 418 bytes of unlambda 23:37:47 (did i mention i was theoretically golfing) 23:41:52 -!- wob_jonas has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 23:44:48 -!- DHeadshot has quit (Ping timeout: 258 seconds). 23:45:42 -!- wlp1s1 has changed nick to [ic]. 23:45:47 -!- [ic] has changed nick to wlp1s1. 23:53:56 -!- oerjan has quit (Quit: Nite). 23:55:37 -!- hppavilion2 has joined. 23:56:09 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 23:57:27 -!- hppavilion1 has joined. 23:58:17 -!- Marcela_Gandara1 has joined. 23:59:44 I know what first, second and third world as phrases was reffering to but what do they mean now?