00:07:06 Humble Bundle weekly sale has Multimedia Fusion 2 00:07:18 Isn't that known for being the piece of garbage that IWBTG was created with? 00:07:32 funny. starting three weeks ago I had a couple of failed logins to my github account. that's when I took over lambdabot... 00:10:02 fungot: was it you? 00:10:02 olsner: until then: c for me. 00:15:08 -!- lambdabot has quit (Quit: I die, but from the ashes I shall rise!). 00:17:40 * int-e twiddles his thumbs. 00:19:21 -!- lambdabot has joined. 00:19:30 > vcat $ text . return <$> ['a'..'c'] 00:19:37 a 00:19:44 b 00:20:27 heh. 00:20:35 > 1 00:20:36 1 00:20:40 > vcat $ text . return <$> ['a'..'c'] 00:20:41 a 00:20:41 b 00:20:41 c 00:21:33 @check \x y -> (x>1) ==> (x**y > (y::Double)) 00:21:34 +++ OK, passed 100 tests. 00:21:36 @check \x y -> (x>1) ==> (x**y > (y::Double)) 00:21:38 +++ OK, passed 100 tests. 00:21:40 @check \x y -> (x>1) ==> (x**y > (y::Double)) 00:21:41 +++ OK, passed 100 tests. 00:21:49 @check \x y -> (x>1) ==> (x**y > (y::Double)) 00:21:50 *** Failed! Falsifiable (after 1 test and 1 shrink): 00:21:50 1.1008359605244717 7.0 00:23:37 @check \a b c d -> or [a,b,c,d] 00:23:38 *** Failed! Falsifiable (after 20 tests): 00:23:38 False False False False 00:27:42 -!- pikhq has quit (Ping timeout: 252 seconds). 00:29:15 -!- pikhq has joined. 00:31:00 int-e++ 00:32:01 > text "" -- I don't think that I will ever fix that one though. 00:32:02 Terminated 00:32:29 aww 00:34:13 -!- yorick has quit (Remote host closed the connection). 00:38:46 -!- L8D has left. 00:42:01 could functional languages be said to be like unto concatenative languages where composition takes the place of concatenation? 00:42:33 isn't the definition of concatenative languages that composition = concatenation? 00:42:46 MAYBE 00:44:07 so is there a way to describe the set of all languages where one can directly connect two programs together and know the resulting program will be a working program that does the two things the original two did in order? 00:44:40 "connect" being a language-dependent concept 00:45:15 this is rather the point, a language is concatenative if its concept of 'connection' is just composition 00:46:19 no? 00:46:34 yes? 00:46:39 a language is concatenative if its concept of 'connection' is concatenation 00:47:13 it seems to be pure functional if its concept of 'connection' is composition (with concatenative languages being a special case) 00:47:40 what does 'connection' even mean if not 'concatenation modulo trivial syntax differences' 00:48:46 Phantom_Hoover: piping stdout to stdout requires nontrivial syntax change to formulate it as a concatenation 00:48:55 *to stdin 00:49:51 that... seems to have nothing to do with what i asked and makes little sense besides 00:51:02 it's an example of a way to connect programs without concatenating them 00:52:00 isn't there some language whose data model is streams which are transformed? 00:52:29 -!- SingingBoyo has joined. 00:53:36 either way i don't see any proof of your claim that concatenation is the only way programs can meaningfully be connected in sequence 00:54:55 -!- Sorella has quit (Remote host closed the connection). 00:56:57 what are you even 00:57:09 YouTube ads just decided I speak another language 00:57:11 concatenation is a syntactic construct, not a semantic one 01:01:57 Should be possible to fake a keyword-like vararg system without typeclasses in Haskell, I think 01:02:06 are your previous messages related 01:02:44 Lorem ipsum dolor sit amet 01:02:59 (Sorry, was just trying to avoid a message actually related to anything) 01:03:27 -!- carado has quit (Ping timeout: 252 seconds). 01:06:10 Phantom_Hoover: there are visual languages where the 'connections' are drawn as links it could be quite annoying to translate that syntax into concatenation (i don't know how trivial you mean by trivial) 01:07:29 yes; those languages just don't have any syntactic construct corresponding to 'concatenation' 01:07:59 this is why quintopia's entire idea here seems very confused 01:08:10 I'm not sure what going on because both what you and quintopia say makes perfect sense 01:10:18 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 01:11:39 " what does 'connection' even mean if not 'concatenation modulo trivial syntax differences'" seems to be asking for connections that are expressed through other syntactic ways than concatenation/juxtiposition 01:14:43 so quintopia offered pipes as a syntactically different way of connecting functions 01:14:48 well the term itself was so vague i was trying to work out if quintopia was talking about something weird and specific 01:16:23 you mean semantically different; the confusion between that and syntactically different is i think the confusion that has lead to this whole conversation 01:17:08 you could easily have a language where concatenation simply piped input 01:18:16 why do I mean semantically different? 01:18:49 because the only syntactic difference between piping and concatenation is that one of them uses a space and the other one uses a | 01:21:34 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:24:59 -!- trout has changed nick to variable. 01:29:39 doesthiswork: thanks for your support. PH's responses there seemed nuts to me too. 01:30:05 not the content, but the expressed confusion and emotion 01:35:29 -!- nisstyre has joined. 01:36:10 possibly relevant wikipedia article https://en.wikipedia.org/wiki/Sayre's_law 01:36:20 he thought that by "cocept of connection" you meant what the wires mean, while I think you meant "how you indicate where the wires go" 01:39:25 it hurts my head to read the exchange with two slightly different meanings at once 01:41:27 -!- Frooxius has quit (Quit: *bubbles away*). 01:44:09 doesthiswork: interesting interpretation 01:47:08 I might have interchanged the views I believed you each to have, 01:48:42 i'm not even sure which i meant 01:49:48 but it's clear to me that with piping you are, in a sense, connecting a printf to a read, both of which might appear in the middle of the programs, which doesn't make sense as concatenation either semantically or syntactically 01:50:35 however, if every instruction in a language was of the form "read-eval-print" then that language would probably be concatenative 01:52:38 so quasiquote and lambda calculus both work by substitution, are really the same thing? 01:53:43 http://hackage.haskell.org/package/pipes yo 01:54:15 -!- ais523 has quit (Ping timeout: 246 seconds). 01:54:48 i'm not sure i understand quasiquote 01:55:05 quasiquote is a macro 01:55:43 like it creates an environment that creates behavior like #define would in C? 01:55:50 afair it doesn't introduce any bindings 01:56:16 oh 01:56:24 -!- Sorella has joined. 01:56:27 ?? are we rediscovering combinatory logic? 01:56:28 Plugin `compose' failed with: Unknown command: "" 01:56:40 it's a macro that turns piping syntax into composition syntax? 01:56:42 @botsnack 01:56:42 :) 01:56:55 `(this is a ,test) expands to something like (cons 'this (cons 'is (cons 'a test))) 01:56:56 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: (this: not found 01:57:08 -!- Sorella has quit (Changing host). 01:57:08 -!- Sorella has joined. 01:57:20 (`whatever is an abbreviation for (quasiquote whatever) 01:57:21 ) 01:57:42 okay 01:57:57 like 'a abbrebiates (quote a) 01:58:08 *v 01:58:53 are you writing lisp code 01:59:09 because the quasiquote thing i was looking at was a thing for haskell 01:59:11 it allows you to quote some stuff and leave holes for values to be substituted in 01:59:17 oh. it's a macro in scheme. 01:59:47 i assumed that was what doesthiswork is referring to. 01:59:49 hmm that seems vaguely useful 01:59:56 oerjan: yes 01:59:58 yep it is 02:00:45 the ones in haskell are also sort of macros, since they use template haskell. but they do something different. 02:01:37 [x|whatever...|] passes the _string_ "whatever..." to the function x, which can then return arbitrary haskell templates. 02:02:11 yeah it's a confusing (mis)use of the term "quasiquote" 02:02:25 the normal TH quotes [| ... |] already have the behavior of Scheme's quasiquote 02:02:32 which is to say, you can splice inside them 02:02:49 kmc: but you can't put [| |] inside [| |] 02:02:54 and you define many quasiquote functions, which allows you to parse essentially arbitrary syntax inside the | ... |], except you cannot put |] in there. 02:02:59 a quasi quasi quote 02:03:15 Sgeo: yeah what's with that? is TH itself not part of the Haskell AST which TH operates on? 02:03:39 was it just deemed un-useful due to the rigid 2-stage implementation of TH in GHC? 02:04:30 re other quasiquoters not handling |], the way Factor syntax words handle end of input isn't with special token, but... just finishing its take-in of input, I think 02:06:29 scheme also has the splicing variant of unquote... if you (define test '(a b c)) then `(x y ,test) => (x y (a b c)) but `(x y ,@test) => (x y a b c) 02:07:58 hmm. ((lambda (x) `(,x ',x)) '(lambda (x) `(,x ',x))) 02:08:08 yes, a fun quine. 02:08:13 good shit 02:08:32 and "do nothing at this stage" is ,@'(test) 02:08:47 :D 02:08:56 if you hate joy and do like srfis you can do (#1=(lambda (x) `(,x ',x)) '#1#) 02:09:26 int-e: what's the name of that combinator again 02:09:41 gcl turns that into ((LAMBDA (X) (LIST X (LIST 'QUOTE X))) '(LAMBDA (X) (LIST X (LIST 'QUOTE X)))) :-/ 02:09:58 well hey that's still a quine 02:10:00 quintopia: huh? 02:10:26 Bike: yes, but it looks kind of boring :) 02:10:28 Y 02:10:33 woops 02:10:40 shrug, it's what the quasiquoting means anyway 02:10:45 oh right 02:10:48 y 02:10:50 duh 02:10:54 quintopia: Omega = omega omega, where omega = \x . x x? 02:11:20 My Braintrust implementation should probably have been written in Scheme... maybe 02:11:33 this piece of ice on my window is almost penis shaped 02:11:54 jack frost wants you to know how he feels 02:12:05 https://gist.github.com/Sgeo/fe54715fc61d1d98f4cc 02:12:07 anyway, I'm way past bedtime. good night 02:12:19 look at that huge primSource line :/ 02:12:20 now performing ampallang 02:12:48 Sgeo: hah that's some good shit 02:13:37 I should try rewriting with lens at some point 02:13:44 But I'm still stuck with a huge-ass line 02:14:08 ampallang complete 02:15:11 ampallang? 02:15:32 semi secret language invented by amputees 02:29:07 oof http://en.wikipedia.org/wiki/Ampallang is not that, and is also quite NSFW 02:35:21 I think that in a Famicom program you could store compressed level data (especially if it includes variable-length pieces) in CHR ROM rather than PRG ROM (as long as you don't need to display anything during loading), and it would make it much faster since you don't need all fancy programming for 16-bit address increments and that other kind of stuff. 02:38:06 kmc: that section of wikipedia is quite informative 02:38:39 why can't you display anything during loading then? 02:38:53 and why don't you need fancy programming 02:39:13 * kmc looks up how CHR ROM works 02:40:21 kmc: CHR ROM (and CHR RAM) must be accessed only by the PPU, and while it is displaying anything it will be busy so you will be unable to access CHR ROM/CHR RAM. 02:40:27 ah 02:40:37 The PPU has automatic address increment so you don't need to implement it yourself. 02:40:41 ooh 02:44:43 When you read/write $2007 (the PPUDATA port), it will read/write the associated CHR ROM/RAM and then automatically increment the address. There is a flag you can set to tell it to add 1 or to add 32. 02:52:01 oh i should make a blitter shouldn't i 02:53:25 what for 02:53:36 why not 02:55:19 though i don't think the fpga ram has bit addressing 02:57:38 oh, that reminds me, if i have a discrete probability distribution, represented as an array of floats between 0 and 1, is there a good branchless way to pick one randomly 02:57:51 or will any microoptimization i do be eaten by the process of random number generation anyway 03:00:48 i vaguely think shachaf knows something about that 03:01:01 i guess the obvious branchy way is to store a cumulative distribution and binary-search it? 03:02:00 yeah 03:02:11 i might be overthinking this since it's unlikely there will be more than five options for me 03:02:22 if you are okay with accuracy down to 1/n then you can store an n-element array of outcomes w/ duplicates and pick one randomly 03:04:26 it's quite likely some of the probabilities are on the order of 1/1000000, eheh 03:05:13 -!- doesthiswork has quit (Quit: Leaving.). 03:28:41 -!- Zerker has joined. 03:30:01 -!- ^v has joined. 03:53:58 Is there the possibility to work Washizu-style partnerships in games other than mahjong? 03:54:20 Perhaps in Super Mario Bros. 03:57:37 what style of partnership is that 03:59:28 In Washizu mahjong, each team has one "leader" and one "supporter". The supporter's turn comes immediately after that team's leader's turn, and only the leader's score at the end counts (although since this is mahjong, the supporter's scores are still used to calculate who gets bonuses for first place, second place, etc) 04:01:57 -!- ^v has quit (Read error: Connection reset by peer). 04:06:27 -!- ^v has joined. 04:23:35 Anyone feel like shutting down a data center? http://saidescanso.uv.es/ 04:24:28 why would i want to do that 04:25:58 -!- nisstyre has quit (Remote host closed the connection). 05:00:14 -!- pikhq has quit (Ping timeout: 240 seconds). 05:00:26 -!- pikhq has joined. 05:06:27 please tell me that has some kind of authentication in place 05:15:07 -!- Phantom_Hoover has joined. 05:18:00 -!- Sorella has quit (Remote host closed the connection). 05:21:39 -!- oklopol has quit (Ping timeout: 260 seconds). 05:55:41 -!- Zerker has quit (Quit: Colloquy for iPad - Timeout (10 minutes)). 06:08:40 -!- ^v has quit (Remote host closed the connection). 06:25:07 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:33:38 -!- Sprocklem has quit (Read error: Operation timed out). 06:47:09 -!- ruddy has joined. 07:01:00 -!- FreeFull has quit. 07:09:09 Unfortunately, it does. 07:12:38 I have implemented multiplication of two 16-bit signed numbers to a 16-bit result by making a table for multiplying 4-bit numbers and then splitting the inputs into nybbles and doing ten table lookups and shifting and adding the results. Is this OK, or are there faster ways (that don't involve lookup tables larger than 16K)? 07:12:56 `relcome Jafet 07:12:59 Jafet: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 07:17:41 zzo38, (a*16+b) * (c*16+d) = (a*c)*256 + (a*d)*16 + (b*c)*16 + b*d? 07:18:08 lifthrasiir: Yes, like that, is what I mean. 07:18:13 obvious optimizations include making three copies of tables for a*b, a*b*16 and a*b*256. 07:18:32 (whether it does optimize things or not is another story though) 07:18:47 The CPU is 8-bit data though, not 16-bits. 07:19:59 Bike: http://en.wikipedia.org/wiki/Alias_method 07:20:39 -!- oerjan has quit (Quit: leaving). 07:21:37 -!- nisstyre has joined. 07:21:44 zzo38, another possibility includes using a variant of Karatsuba multiplication, i.e. (a*16+b) * (c*16+d) = (a*c)*256 + ((a+b)*(c+d) - a*c - b*d)*16 + (b*d). 07:22:07 if accessing the multiplication table is slow enough it will work 07:24:04 though I suspect accessing the table is not that slow 07:28:54 I don't think it is that slow either. 07:29:15 Anyways (a+b)*(c+d) might result in overflow 07:34:59 Isn't it? 07:36:55 Also, unlike what you have, since they are sixteen-bit numbers, there will be sixteen multiplications, although six of them are omitted since they would be shifted beyond the range of the result, so only ten multiplication lookups are done. 07:38:59 awesome, karatsuba (when a 23 year old student) invented his algo less than a week after hearing kolmogorov conjecture it was impossible 07:39:30 then kolmogorov published it without karatsuba's knowledge but put karatsuba's name on it? 07:42:44 zzo38, hmm, you are right, it will require a bit larger table with at least 10-bit elements. 07:45:26 Although maybe it will help to have another table for the low 4-bits of the result shifted left by 4, and another for the high 4-bits of the result shifted right by 4. 07:47:57 i like how he is spelled "karazuba" in the german wikipedia but the algorithm is still spelled "karatsuba" 07:52:28 Doing this results in three tables, and eliminates a lot of ASL and ROL instructions, and saves having to initialize two bytes of RAM, and probably saves approx. fifty cycles. 07:52:46 Is there anything else that can be done though? 08:06:52 -!- muskrat has quit (Ping timeout: 260 seconds). 08:57:38 -!- zzo38 has quit (Remote host closed the connection). 09:04:09 "The International Monetary Fund IMF is compensating all the scam victims $1.9USD each, and your email address was found in the scam victim's list. This Western Union office has been mandated by the IMF to transfer your compensation to you via Western Union Transfer." 09:04:47 A whole $1.9 ! 09:05:09 Wow 09:05:12 1.9 USD-dollars 09:05:17 You must be rich now or something 09:05:26 -!- nisstyre has quit (Quit: Leaving). 09:05:56 You much did they scam you for ;) 09:06:47 Presumably $1.9 is the take averaged over the mailing list. 09:07:20 That's actually two days' salary, so it's not bad. 09:07:43 -!- muskrat has joined. 09:08:09 What? 09:08:14 Salary for what? 09:08:37 And for two days 09:08:52 Well, I keep hearing about people who live on less than $1 a day. 09:08:58 If you trick someone into paying you a bus trip you'll get three times that much in half an hour 09:09:39 Jafet: Yeah 09:09:59 But I'm pretty sure you can get more than 1$ by asking people for money on the street 09:11:00 Don't you guys have uhm 09:11:10 some social system that pays money to people without income? 09:11:27 unemployent compensation? 09:11:31 *ment 09:11:33 That might not work if the other people on the street have less than $1. 09:11:50 Hu 09:12:28 I imagined the US as a rich country 09:12:36 that sounds like an underdevelopped country 09:13:24 it's a land of contrasts 09:13:27 like every other fucking place 09:14:04 True 09:14:40 Underdeveloped countries, like Arkansas? 09:14:51 but there are federal organisations and systems that should prevent such things 09:15:07 If I were unemployed I would be entitled to an unemployment compensation 09:15:14 It's not much 09:15:24 but it's still way way way way more than 1$ a day 09:16:32 It's not enough to own a car, go on vaccation etc. 09:16:37 but still 09:17:33 we have that too 09:17:42 it's organized on a state-by-state basis but partly funded by the federal govt, I think 09:18:12 Everybody who works pays a tax for does who can't work 09:18:18 *those 09:20:51 kmc: Then how come that people have to live for 1$ a day 09:21:19 Except they don't work on purpose, then you loose your unemployment compensation 09:21:31 unemployment benefits can end in various ways, yeah 09:21:43 and there are lots of other programs like welfare and food stamps (or whatever those are called now) 09:21:49 but there may also be reasons why people don't end up on them 09:22:09 I'm however not sure what happens you have to pay for some expensive medical treatment 09:22:19 which is not covered by health insurance 09:22:42 I'm not sure if the government here would pay that 09:22:44 you dodge bill collectors for the rest of your life, basically 09:22:52 maybe declare bankruptcy 09:23:14 I think bankruptcy is typical 09:23:17 Yeah 09:23:20 I think like half of bankrupcties are because of medical issues 09:23:29 or you just don't get the treatment because the doctors know they won't get paid 09:23:32 and then you die 09:23:46 gee it's almost like this fucked up system is a huge drain on the national economy 09:23:58 and therefore even the most cold-hearted among us should support reforming it 09:24:00 oh well 09:24:45 My opininon is, that the government should have some kind of fund which allows even unemployed people to live a decent life 09:25:02 It won't be an easy/luxorious life whatever 09:25:05 but still somewhat decent 09:25:10 i agree 09:25:12 basic income 10:05:07 -!- Bossbear has joined. 10:05:12 hi 10:05:20 `relcome Bossbear 10:05:25 Bossbear: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 10:05:27 D^5=mc^2 10:05:33 if you say so 10:05:50 what is so esoteric 10:05:51 (where D is the fifth root of E) 10:05:56 yes 10:06:13 Squared is the best MC 10:06:14 calculate d for the sun and you get just past neptune 10:06:21 D^2 gets to the heliosphere 10:06:44 call albert, i have an improvement 10:07:19 Bossbear: set controls for the heart of the sun 10:07:38 is that the heart of the sunrise? 10:07:56 -!- kmc has set topic: NOTHING IS BEYOND OUR REACH | Set the controls for the heart of the sun | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 10:08:33 http://www.youtube.com/watch?v=oDqG9agd5wc 10:09:29 want more esoteric equations? 10:09:38 not really 10:09:38 yes 10:09:42 damn you PH 10:09:45 what's the determinant of the matrix of solidity 10:09:57 You've laid some kind of trap! 10:10:12 phi + phihat =1 and phi x ohihat = -1 10:10:22 phi is velocity and phi is time 10:10:35 o shows the limits of form 10:10:41 nothing is a myth 10:10:51 1 refers to balance between infnite series 10:11:01 can you stop 10:11:06 all equations come from 2 waves 10:11:11 time and velocity 10:11:21 want more? 10:11:25 no 10:11:36 i just defined relaity for you 10:12:21 you are a transcedent form into an emergent system, there is no random in the preexcsting system since rality is math 10:12:28 -!- ChanServ has set channel mode: +o elliott. 10:12:35 -!- elliott has kicked Bossbear no. 10:12:36 -!- Bossbear has joined. 10:12:38 why can you not spell reality 10:12:42 -!- elliott has kicked Bossbear don't use autorejoin. 10:12:42 -!- Bossbear has joined. 10:12:45 random occurs when a foreign mathematical form is introduced 10:12:57 -!- elliott has set channel mode: +b *!*bossbear@*.dllstx.fios.verizon.net. 10:12:57 -!- elliott has kicked Bossbear using autorejoin after I told you not to. 10:12:58 -!- elliott has set channel mode: -o elliott. 10:13:06 lol 10:13:07 aw i didn't get a chance to try to buy shrooms from them 10:15:37 I wouldn't have kicked them if their equations amused me more 10:15:46 just saying 10:16:28 perfectly valid 10:17:28 good 10:17:58 I have to be awake and competent in an hour and a half 10:18:02 Myabe I shouldn't go to sleep now 10:18:22 you seem neither competent nor entirely awake as it is 10:18:41 Phantom_Hoover: ok come on, that was uncalled for 10:19:04 i meant the fact he typoed 'maybe', not his general state 10:20:53 -!- Sorella has joined. 10:21:28 -!- Sorella has quit (Changing host). 10:21:28 -!- Sorella has joined. 10:34:27 Why are seasons considered to start at what is arguably their most extreme point? 10:36:08 what... do you mean 10:36:46 in terms of the solar cycle they don't: the equinoxes and solstices are all in the middle of seasons 10:37:29 Sgeo: because Earth acts as a buffer so weather (temperature and flora) has a delay relative to the sun 10:37:43 Googled "When does winter start": Saturday, December 21. Pretty sure that's the winter solstice. 10:37:46 b_jonas: hmm 10:38:34 "But it should not be confused with "the first day of winter" or "the start of winter" (Lidong in the East Asian calendars)." 10:38:54 "In astronomical reckoning, the solstices and equinoxes ought to be the middle of the respective seasons, but, because of thermal lag, regions with a continental climate which predominate in the Northern hemisphere often consider these four dates to be the start of the seasons as in the diagram, with the cross-quarter days considered seasonal midpoints." Huh, news to me. 10:39:16 (Maybe we don't have a continental-enough climate?) 10:39:46 i think we've all learnt that seasons are incredibly arbitrary and not to be trusted 10:39:56 int-e: that's even more scary 10:40:03 it generates the rules automatically? wow 10:40:42 I'll definitely look at it 10:51:04 int-e: as for eliminating leading zeros, I just use wrappers around the (0:) and (1:) constructors in my impl of binary 10:51:58 i think we've all learnt that time is not to be trusted 10:52:11 learnt and learn'd 11:02:31 -!- carado has joined. 11:05:53 `relcome carado 11:05:55 carado: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 11:06:15 thanks o/ 11:08:02 -!- SingingBoyo has quit (Ping timeout: 250 seconds). 11:18:30 -!- Frooxius has joined. 11:18:54 b_jonas: yes, I could handle leading zeros in the implementation of 'n', but I have other plans :) 11:32:27 int-e: what does the zeckendorf subtraction you generated do on an underflow? loop infinitely? 11:33:43 -!- nooodl has joined. 11:34:50 b_jonas: Yes. I was happy with a partial function (actually it shouldn't be hard to detect that situation anyway, but I have not given it much thought.) 11:37:42 challenge: find a way of justifying cos as the category-theoretic dual of sin 11:38:41 b_jonas: and in fact this is related to handling leading zeros properly; right now, whenever the remaining input is an empty list, but there are still carries to deal with, it just replaces it by [0]. 11:38:59 b_jonas: so indeed it will loop forever. 12:07:45 Jafet: oh, thanks! 12:21:49 -!- Sgeo has quit (Read error: Connection reset by peer). 12:29:48 -!- aloril has quit (Ping timeout: 246 seconds). 12:43:14 -!- aloril has joined. 12:59:45 int-e: ok. I guess a complete suite could have comparison functions. 13:00:50 -!- boily has joined. 13:00:53 -!- boily has quit (Client Quit). 13:01:10 -!- boily has joined. 13:01:19 -!- metasepia has joined. 13:01:37 ~metar CYUL 13:01:37 CYUL 091242Z 07014KT 3/4SM R06L/P6000FT/D R06R/P6000FT/D -SN BKN004 OVC012 M05/M07 A3013 RMK SF5ST3 PRESFR SLP205 13:01:44 good -SN morning! 13:01:58 ~metar EFHK 13:02:28 Good apparently nonexistent afternoon. 13:02:57 ~metar EFRO 13:03:12 I guess Finland was all a figment of someone's imagination. 13:04:06 --- Station not found! 13:04:06 EFRO 091250Z VRB01KT 9999 1200SW BCFG NSC M21/M23 Q1023 13:04:31 Oh. 13:04:57 It's just the Helsinki airport that has disappeared, then. 13:05:44 (Also: BCFG is probably some kind of a context-free grammar.) 13:09:10 Rejoice! The Tyranny of the Helsinki Hallucination has Ended! 13:09:49 (apparently BCFG is patchy fog ← http://www.wdisf.com/BCFG-stands-for-patchy-fog-metar-code.htm) 13:10:24 Of course, it must be short for batchy fog. 13:10:28 ~metar --help 13:10:28 --- Station not found! 13:11:05 int-e: no search yet. will appear in the Most Vaporous New Version of Metasepia. 13:11:22 (meanwhile, you can file an issue on github → https://github.com/pfcuttle/metasepia) 13:12:08 ~metar LOWW 13:12:09 LOWW 091250Z 29022KT 9999 -RA FEW025 BKN045 07/04 Q1023 NOSIG 13:15:13 There's low, and then there's LOWW. 13:15:44 loww basis theorem 13:16:12 hellexandello. 13:17:17 gooddoily 13:17:47 ~metar INN 13:17:47 --- Station not found! 13:18:09 ~metar LOWI 13:18:09 LOWI 091250Z 26004KT 9999 FEW120 BKN300 02/M04 Q1031 NOSIG 13:18:56 meh. I guessed the wrong end of the country. 13:19:11 I guess IATA code lookup is also pending on the Vaporous Version too? 13:20:11 it was requested, memorized, guiltened, and thought about. now that I have the Mega Database of Everything, that will be an easy task. 13:20:34 (also, ocharles wrote a convincing article on the persisten lib.) 13:23:30 Ok. I think I managed to decipher that. :) 13:25:52 -!- Sorella has quit (Remote host closed the connection). 13:28:48 -!- Sorella has joined. 13:29:23 -!- Sorella has quit (Changing host). 13:29:23 -!- Sorella has joined. 13:38:14 -!- muskrat has quit (Quit: Leaving). 13:39:36 -!- qlkzy_ has joined. 13:40:28 `relcom qlkzy_ 13:40:29 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: relcom: not found 13:40:34 `relcome qlkzy_ 13:40:37 qlkzy_: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 13:55:32 -!- qlkzy_ has changed nick to qlkzy. 14:02:16 -!- Slereah has quit (Ping timeout: 264 seconds). 14:24:32 -!- `^_^v has joined. 14:30:47 -!- Timwi has joined. 14:30:58 Good day everyone 14:31:30 good morning! 14:31:44 Mornin; 14:32:08 What’s up? Anything exciting going on in here? :) 14:32:47 welcome, to #esoteric. anything is possible on #esoteric. ♪ 14:32:54 (sung to the voice of zombo.com) 14:33:51 -!- conehead has joined. 14:34:31 I take that as a ‘nothing’ :-D 14:35:28 mornings (EST) are usually very calm. you could peruse the PDF available in the /topic. when Excitenment begins, you'll know :D 14:36:12 kmc: pink floyd listener? 14:36:56 -!- mrhmouse has joined. 14:37:14 found a grammar boo-boo in the PDF 14:37:46 Timwi: where? 14:38:14 page 5, “vizitu la Viki-o” should be “vizitu la vikion”, or at the very least “vizitu la Viki-on” (i.e., accusative) :-p 14:39:04 I'll be correcting that right away! 14:39:35 Egad, I just made a contribution :-p 14:42:04 updated to the latest HackEgo revision, along with your grammar fix. 14:43:35 `bot 14:43:36 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bot: not found 14:44:46 This PDF is ... 14:44:49 ... weird to say the least... 14:45:05 wisdom takes a while to appreciate 14:45:19 * boily chuckles to himself ^^ 14:46:35 You guys are strange 14:47:14 Phew, I'm still not mentioned in there :) 14:47:59 Timwi: But in any case, thanks for the compliment. 14:48:04 int-e: don't worry, the moment will come. muah ah ah. 14:49:23 int-e: yw 14:51:21