00:05:04 `rwelcome Gracenotes 00:05:06 ​Gracenotes: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of esoterica, try #esoteric on irc.dal.net.) 00:06:07 yey im walcome 00:06:24 still haven't picked a teapot color :/ 00:07:09 how about roll a die 00:08:36 `run echo '#' | rainwords 00:08:38 ​# 00:10:18 there are a few concerns. I want it to look nice, show off the tea color well, and also hide tea stains relatively well. 00:10:55 both of the latter two are impossible to achieve at the same time 00:11:22 what if the color on the outside changed when heated (as if by spilled tea) 00:12:15 they're more to do with inside color, though 00:16:05 it's also about making a statement. nice and pleasant blue marine, or startling yellow/orange, or positively royalist deep red? 00:20:57 plus, how will it look when it is slightly worn? for best results here, it needs to maintain its modern look without falling into 80s-era flimsy-art-deco territory 00:22:15 maybe you should find a professional. 00:23:17 I thought #esoteric had professionals 00:23:28 professional tea set locators, i mean. 00:23:44 Is that people who locate professional tea sets? 00:23:52 Even an amateur could do that. 00:24:19 a professional professional tea set locator. 00:24:32 oh, tea set locators are just for spoiled tech workers with too much disposable income... oh. 00:24:44 * oerjan imagines a black and white checkerboard teapot 00:24:56 -!- carado has quit (Ping timeout: 256 seconds). 00:25:57 Gracenotes: you could pay them back by briefly working as a professional professional professional tea set locator disambiguator. Or farm that work out to shachaf for a small fee if you're feeling lazy. 00:26:50 i take big fees 00:38:03 I hope you have a portfolio of professional professional tea set locators you've found 00:38:26 Not that I don't trust Bike's referral... 00:53:20 -!- Bike has quit (Ping timeout: 268 seconds). 00:58:20 -!- sprocklem has quit (Remote host closed the connection). 00:59:52 -!- Bike has joined. 01:06:09 -!- heroux has quit (Read error: Operation timed out). 01:10:38 -!- heroux has joined. 01:21:28 kmc: i like the idea of #[layout="C"] 01:22:01 for controlling struct layout? 01:22:12 yes 01:22:21 as opposed to the kind of ad-hoc thing that's going on right now 01:22:31 i thought that was implementation-defined in C 01:22:51 it is 01:23:00 and that means "by the ABI" 01:23:32 oh, so that would make it have the target ABI's layout, gotcha 01:23:54 Yes, I mean compatibility with an ABI. 01:24:00 Which is what it does now anyway. 01:29:03 -!- sprocklem has joined. 01:46:17 -!- quintopi1 has quit (Ping timeout: 246 seconds). 02:18:34 TV Tropes has a article for "Sequence Breaking", but is there some that the proper (intentional) solution involves apparent sequence breaking? 02:19:18 shachaf: I like that idea too 02:19:26 I think the more Rusty syntax would be #[layout(C)] but not sure 02:19:43 Sounds good. Someone suggested that in the channel. 02:19:51 Using the maze graphic example, it could be a game where there is a invisible trap inside of the maze, so the only solution is to go around. 02:20:00 Maybe I'll send an email to the list about it. 02:20:07 ok 02:21:22 These example of "Sequence Breaking", "Not The Intended Use", etc could possibly be done in the deliberate way where the way which appears to be what should be the proper way won't even work anyways. 02:23:29 zzo38: it sounds like an obvious novelty to try so there are probably such games. (but i don't know which as i'm not much of a computer gamer) 02:24:56 They might be possible in other games too such as Dungeons&Dragons, though. 02:25:02 Not only computer games necessarily. 02:25:19 well obviously a good GM/DM could try to do such things 02:25:59 in either case i suspect some of the difficulty is making it not so hard to realize that the players just get frustrated and annoyed 02:27:00 *realize, 02:30:47 Well, I, as the player, am not frustrated and annoyed by such thing; it is the more common rules which I don't like much (for example one book says that the frost giant shouldn't have fire traps because the players aren't prepared; I disagree, the giant will put in such traps deliberately in order to prevent someone from entering if they think they are prepared!) 02:36:56 http://shachaf.net/curry.rs.txt 02:37:48 nice 'n' readable 02:47:59 Do some computer games have checkpoint traps? 02:49:19 -!- Scarlet_Spiral has joined. 02:51:51 Bike: your prose is nice 'n' readable!! 02:52:02 yes 02:52:39 what's happenin 02:53:52 Yacenotes 02:55:31 Inyofacenotes 02:58:32 -!- Scarlet_Spiral has left. 03:19:11 -!- oerjan has quit (Quit: Gnat). 03:23:00 -!- copumpkin has quit (Ping timeout: 246 seconds). 03:23:36 -!- copumpkin has joined. 03:29:41 yes it's orrible 03:53:33 -!- Bike has quit (Ping timeout: 264 seconds). 03:55:20 -!- Bike has joined. 03:55:54 -!- nooodl has quit (Ping timeout: 264 seconds). 04:07:57 I fell asleep 7 hours ago 04:08:02 I did not want to do tht 04:08:52 @time Taneb 04:08:52 Local time for Taneb is Tue Jul 23 05:08:56 04:09:11 ah, well, either try to back to sleep more or drink lots and lots of caffeine 04:09:56 later in the day, that is 04:10:59 I had a dream I was programming in something like Python? idk 04:11:12 sounds dull. 04:11:32 says the guy who probably has biology dream 04:11:33 s 04:11:42 yes. all orgies all the time 04:21:30 I was using this Python-like language to turn Pine trees into lumber 04:21:38 Using the pine.toLumber() instruction 04:22:16 good 04:22:31 Thus DESTROYING BIOLOGY! ahahahaha 04:24:05 oh no 04:26:40 i had a dream where i was a bicycle 04:26:51 it was refreshingly unbiological 04:30:57 -!- Frooxius has quit (Ping timeout: 248 seconds). 04:56:19 that does sound nice 04:56:26 what kind of bicycle were you 05:00:00 Can you win ADOM with one hit point (or just make your PV like negative one million; there are some attacks that bypass PV though) 05:04:51 -!- Bike has quit (Ping timeout: 246 seconds). 05:05:50 ^style agora 05:06:03 fungot: dude, where'd you go? 05:06:32 -!- Bike has joined. 05:06:42 fungot, that shining sun of my life, has plunged into the inky darkness of the ocean of the abyss of the valley of the shadow of death. 05:08:26 -!- Bike_ has joined. 05:10:24 -!- Guest70600 has quit (Quit: Guest70600). 05:10:45 -!- sacje has joined. 05:11:36 -!- Bike has quit (Ping timeout: 256 seconds). 05:21:09 -!- Bike_ has quit (Ping timeout: 264 seconds). 05:21:44 -!- tertu has joined. 05:22:13 -!- Bike has joined. 05:24:02 -!- augur has quit (Remote host closed the connection). 05:25:07 How can this custom "encryption" algorithm be made somewhat harder to "break"? try involving a key somehow 05:25:33 -!- augur has joined. 05:26:04 isn't that the guy who was in here spamming his bullshit 05:28:35 probably 05:29:06 `run ls bin/ | grep past 05:29:08 pastalog \ pastaquote \ paste \ pastefortunes \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ pastlog 05:29:21 i don't know what any of these do. 05:29:27 `pastlog dlackili 05:29:30 `pastalog 05:29:58 2010-07-24.txt:07:53:45: * Sgeo had a lot of pasta tonight 05:29:58 2013-07-22.txt:04:22:53: so which of the clues points to DES3 dlackili 05:30:11 cool 05:30:14 `pastalog 05:30:20 2011-02-11.txt:19:13:35: Gregor: i only ask because copypasta is difficult on my phone :P 05:32:53 `pastalog 05:32:59 2013-04-17.txt:17:09:58: bin/pastalog: ASCII text 05:33:07 imagine... a log made of pasta 05:33:11 `paste bin/pastalog 05:33:13 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/pastalog 05:33:41 when I saw HackEgo quoting nooodl I assumed that was also the output of pastalog 05:33:45 "@cliffcheney I am nearing Cairo Univ. hearing constant machine gun fire" the future is so weird. 05:33:49 kmc: haha 05:34:05 Bike: o_O 05:34:14 ? 05:34:23 who's shooting at whom 05:34:44 beats me, but i mean they did just have a coup 05:34:51 coup everday 05:34:57 maybe some MB org being ripped apart 05:35:27 'The top US military officer says any decision to use force in Syria could cost America billions, and that care must be taken to "preserve a functioning state".' WHERE WAS THIS GUY IN 2003? 05:35:33 Probably relevant: http://www.aljazeera.com/news/middleeast/2013/07/201372216452414482.html 05:35:48 remember when a bunch of people said that about Iraq and they were dismissed as traitors 05:36:21 well, the thing about syria is that everybody above the level of mccain understands how shitty iraq went. 05:36:37 joke about politicians being able to learn 05:37:18 -!- Sgeo has quit (Read error: Connection reset by peer). 05:37:19 I think it may be a bit late to preserve a functioning state in Syria 05:37:39 "It has been reported that people on both sides have guns. Normally we do not see violence so early in the day" being an al jazeera reporter must be sad 05:38:11 the syrian state is still functioning 05:38:20 just, not in the entirety of syria 05:38:51 s/how shitty iraq went/how shitty iraq is going/ 05:38:59 has gone? 05:39:22 -!- sprocklem has quit (Remote host closed the connection). 05:39:47 oh, actually, you know there's an Islamic State in Iraq in syria now 05:39:50 p. great names 05:40:37 oh, shit, they've actually renamed themselves. it's "Islamic State in Iraq and Syria" now :/ 05:40:46 er, and the levant. 05:43:50 -!- variable has quit (Ping timeout: 240 seconds). 05:52:08 I can smell cornflakes 06:00:19 kmc: I'm getting the feeling all the people asking to break their exciting new cipher in ##crypto are actually the same person. 06:11:01 -!- Bike has quit (Ping timeout: 276 seconds). 06:12:09 -!- sacje has quit (Ping timeout: 264 seconds). 06:17:26 -!- Bike has joined. 06:22:00 This DIY motor is p. awesome. http://youtu.be/Esphle_MsXI 06:24:18 -!- dlackili has joined. 06:25:00 How can a simple Homebrew cipher involving XOR/GCD/Euclid's algo in haskell? 06:25:31 Good question. How can it? 06:26:19 so what's the deal with odd zeta constants. 06:26:27 we, like, don't know if zeta(5) is irrational? imo, what the fuck. 06:26:55 I am not sure 06:28:41 Bike: hey i heard we don't know whether pi^pi^pi^pi is an integer 06:28:43 is that true 06:28:52 by we i mean you personally btw 06:29:04 i do not know that, no. 06:29:10 gcd a b = a `xor` b, where binary (a `xor` b) = "hithisismyresult" 06:29:25 hi result 06:29:27 hi mnoqy 06:29:40 GCD + Final A and B in Euclid's Algorithm XOR some value -> plaintext 06:29:41 "you know i don't think gcd works like taht" 06:29:45 hi shachaf 06:30:04 forward to the smlist update tomorrow y/n 06:30:07 looking 06:30:26 Anyone made a simple encryption algorithm/cipher before? 06:30:33 yes 06:30:41 Bike: What sort? 06:30:44 turns out you can't do it by throwing together random shit, though! 06:30:46 Was it breakable? 06:30:54 Bike: uh, yes you can 06:31:06 of course it was breakable, do i look like a genius to you 06:31:14 Bike: Can I see it? 06:31:17 Bike: oh wikipedia says it's not known 06:31:34 shachaf: yes. i also don't know. 06:31:42 dlackili: it was just a caesar cipher. 06:31:58 > pi ^ pi ^ pi ^ pi 06:32:01 Could not deduce (GHC.Num.Num b1) 06:32:01 arising from a use of `GHC.Real.^' 06:32:01 fr... 06:32:05 "Particularly, it is not known if the positive root of the equation 4x = 2 is a rational number" 06:32:07 fucking. 06:32:14 er, where 4x is ⁴x 06:32:17 i.e. x^x^x^x 06:32:20 help 06:32:24 tetration is hard. 06:32:28 :t (^) 06:32:30 (Integral b, Num a) => a -> b -> a 06:32:37 try ** hth 06:32:37 hm 06:32:45 > pi ^ (pi ^ pi ^ pi ^ pi) 06:32:46 Could not deduce (GHC.Num.Num b2) 06:32:46 arising from a use of `GHC.Real.^' 06:32:46 fr... 06:32:52 well i guess that answers that question! 06:32:53 I am thinking of using XOR/AND/pi in my encryption algorithm for a puzzle 06:33:01 TRY ★★ HTH 06:33:06 shachaf: the joke is, 06:33:12 > pi ** pi ** pi ** pi 06:33:13 Infinity 06:33:29 ok i got that locally but that's because i'm on a shitty 32 bit machine. 06:33:32 Anyone got any cool algorithm ideas? 06:33:34 > (pi ** pi ** pi ** pi) :: CReal 06:33:35 0.0 06:33:40 checkmate 06:33:42 er 06:34:05 > let pi = pi :: CReal in pi ** pi ** pi ** pi -- i am the worst 06:34:09 mueval-core: Time limit exceeded 06:34:14 ugh 06:34:31 now i can't tell which things are jokes anymore 06:34:33 >7^777 :: CReal 06:34:41 > 7^777 :: CReal 06:34:42 437700548734202700764895770266348348092832914249674791140665053626929347534... 06:34:58 > 777777777777777777 * log 7 / log 2 06:34:59 2.18349827271147e18 06:35:12 shachaf: the only joke was haskell not figuring if ⁴pi was an integer. the ret is incompetence. 06:35:15 rest 06:35:29 oh 06:35:37 imo more jokes, less incompetence 06:35:47 :( 06:35:56 gcd a b = a `xor` b, where binary (a `xor` b) = "hithisismyresult" 06:35:58 haskell has ^ and ^^ and ** 06:36:04 COuld that be an encryption routine? 06:36:12 dlackili: a bad one 06:36:23 Bike: How so? 06:36:51 hey Bike, why do mirrors reflect things left-to-right and not up-to-down 06:37:02 well to start with it doesn't even make sense. is that supposed to be, like, haskell 06:37:09 shachaf: don't fucking stalk me 06:37:15 ? 06:37:47 now i'm confused :'( 06:37:52 oh right it's not even known if pi plus e is irrational 06:37:54 fuck math 06:38:27 Bike: Haskell/pseudocode 06:38:39 well, it's unclear. 06:38:50 maybe all haskell code is pseudocode because haskell isn't used in the real world 06:38:52 is "where" supposed to be english or pseudocode? why are you defining gcd wrongly? what's a and b 06:40:11 i'm not defining GCD… it's just an equation 06:40:19 like x*y = x + y 06:40:35 and "where" is english or logic, you choose 06:40:55 Bike: what's the context of the "stalk" thing 06:41:00 mirrors 06:41:13 that question comes from a source completely unrelated to you 06:41:19 what 06:41:27 what 06:41:37 i was talking about that literally today. 06:41:46 so was i 06:41:57 So anyone have any encryption algorithm ideas in haskell? 06:42:05 but i'm p. sure you weren't involved........... 06:42:12 :t (**) 06:42:13 Floating a => a -> a -> a 06:42:17 :t (^^) 06:42:18 (Fractional a, Integral b) => a -> b -> a 06:42:22 ok whatever. 06:42:34 @let tetrate x 0 = 1; tetrate x n = x ** tetrate x (n - 1) 06:42:35 Defined. 06:42:43 > tetrate 2 3 06:42:44 ? 06:42:46 My brother once told me that he asked someone for additional objects in a computer game he was making, and one of the suggestions was "invisible bomb that kills you so much that you have to restart the entire game". 06:42:47 mueval-core: Time limit exceeded 06:42:51 > tetrate 2 3 06:42:56 mueval-core: Time limit exceeded 06:43:09 am i missing something here. 06:43:13 yes 06:43:19 you're missing a good haskell evaluation bot 06:43:22 all we have is lambdabot :'( 06:43:25 woe. 06:43:33 Bike: What is that 06:43:35 whoa, dude 06:43:37 isn't elliott in charge of it now? i can pointlessly and unwarrantedly blame him, right 06:43:40 > tetrate 2 3 06:43:43 16.0 06:43:44 whoa is me 06:43:54 alright now for the important 06:43:55 Bike: nothing pointless or unwarranted about it 06:43:58 > tetrate pi 4 06:44:01 he took over with the promise of making it better 06:44:01 Infinity 06:44:12 guess that proves it. 06:44:18 > tetrate (pi :: CReal) 4 06:44:22 0.0 06:44:23 thanks CReal 06:44:30 should i even guess what's going on there. 06:44:55 p. not 06:45:01 good 06:45:23 where were you even talking about the mirror thing 06:46:09 A hill based cipher in haskell 06:46:21 elsewhere 06:46:24 someone else asked me months ago 06:46:33 someone else asked me years ago 06:47:04 Bike: "such that" would have been better than "where" 06:51:12 @hoogle hyper 06:51:13 package hyperdrive 06:51:13 package hyperloglog 06:51:13 package hyperpublic 06:51:37 hey hyperloglog 06:51:41 that package is p. cool isn't it 06:54:13 http://wiki.tcl.tk/3468 06:54:16 Interesting 06:54:34 Is that possible in Haskell? 06:55:28 @let hyper 0 _ b = b + 1; hyper 1 a 0 = a; hyper 2 _ 0 = 0; hyper _ _ 0 = 1; hyper n a b = hyper (n - 1) a (hyper n a (b - 1)) 06:55:29 Defined. 06:55:35 > hyper 1 7 19 06:55:39 26 06:55:57 @faq 06:55:57 The answer is: Yes! Haskell can do that. 06:56:46 How? 06:59:04 Would be interested to see a Haskell implementation of it 07:00:08 -!- tertu has quit (Ping timeout: 245 seconds). 07:02:51 dlackili: Maybe you should "hask" in #haskell. 07:03:29 23:55 -!- dlackili [dcfdcefc@gateway/web/freenode/ip.220.253.206.252] has joined #haskell 07:03:30 Bike: lol that was punny ;) 07:03:32 23:55 How could this be done in haskell? http://wiki.tcl.tk/3468 07:03:50 elliott: Behold my power. 07:04:19 Bike: your power is so amazing it took effect before you said it 07:04:25 Exactly. 07:04:38 the sulphur is now fully exposed to the power of the bicycle 07:04:48 -!- MindlessDrone has joined. 07:04:57 people are going to correct me for misquoting now :'( 07:05:17 I have no idea what you were quoting. 07:05:43 shachaf: Haskell seems uninterested :P 07:05:52 #haskell* 07:06:05 We all are. 07:06:10 Oh 07:06:15 lol :( 07:12:58 -!- variable has joined. 07:18:31 -!- dessos has quit (Quit: leaving). 07:19:06 -!- dessos has joined. 07:26:20 kmc: did you read Breakfast of Champions 07:27:05 -!- intosh has joined. 07:27:46 from ##c: 03:13 < dlackili> How could this be implemented in C? http://wiki.tcl.tk/3468 07:28:53 How could this be implemented in brainfuck 07:29:24 This person has been doing this in ##crypto, too, of course. 07:29:32 After being banned under other nicks or something? 07:31:31 https://gs1.wac.edgecastcdn.net/8019B6/data.tumblr.com/bb1e8e1a773b87b1f0220a1e1993c830/tumblr_mpde0t3k031rvh71go1_1280.png 07:32:13 a++ url 07:32:37 That’s one of the least horrible horrible URLs. 07:33:07 a-- 07:51:57 -!- MindlessDrone has quit (Quit: MindlessDrone). 08:27:37 I might want to see a proper full-length review of my computer games (and Dungeons&Dragons recording story, etc) (and including TV Tropes if applicable). 08:31:00 In Super ASCII MZX Town Part I, there is a feature which allows you to change the display of the player's position to always a happy face or to a variable (health, ammunition, torches, or torch light remaining). This feature exists in Part II, too. Do you see what I am getting to with this? Probably not, but if you do then please notify me! 08:31:50 -!- sacje has joined. 08:33:29 In the second to last level of Part I, there is a multiplication puzzle where you have to push numbered blocks onto dots in order to make a proper multiplication, you walk up to the door to try to open it and it opens if the multiplication is valid (it checks; the solution isn't hard-coded). 08:35:52 In the second to last level of Part II, there is a similar multiplication puzzle, although you have to instead push the space-bar when it is correct, in order to open the door, but there are more numbered blocks than dots and no matter how a subset of them are arranged there is no solution (I wrote a program to find solutions, and it found none). 08:35:57 Do you see what I mean yet? 08:37:20 (Note: For the player display feature, it will display a happy face if the register's value is 100 or more; otherwise it displays a digit which is one tenth of the register value (rounded down). For example, if you have 42 points of ammunition and you set it to display ammunition, it will display 4. You can still know it is the player by its distinctive color, though.) 08:37:33 (I think I have seen a similar feature in another game.) 08:45:51 Hmm 08:45:53 Hmmmmmm 08:45:55 Hmmmmmmmmmmmm 08:48:36 Apparently mcmap is 0.6% Rust 08:48:59 -!- conehead has quit (Quit: Computer has gone to sleep.). 08:53:07 Hmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm how much apparently iron is % Rust? 08:57:13 -!- Bike has quit (Ping timeout: 245 seconds). 08:57:32 -!- Bike has joined. 09:06:52 You might know the logic puzzle where a man is caught and they say if what he says is true he will be hanged and what he says is false he will be shot. 09:07:46 The answer is "I will be shot", right? 09:08:25 That is their answer, but I don't think so. They don't say that if you do not say something true you will not be hanged, and if you do not say something false you will not be shot. 09:08:37 Anyways if they are let free then the statement is a lie... 09:09:07 If they hang him and then shoot him while he is hanging on the rope, that resolves the paradox and satisfies the conditions, I think. 09:10:04 Taneb: Do you think I am correct? 09:10:53 You raise some good points 09:11:34 And shooting him while he is being hanged does resolve the paradox 09:12:04 And letting him free violates the conditions 09:15:32 Did you tell anyone else? 09:16:11 No? 09:21:30 Bike: http://en.wikipedia.org/wiki/Thorne%E2%80%93%C5%BBytkow_object wow this is like. a cool thing 09:32:23 -!- intosh has quit (Ping timeout: 240 seconds). 09:34:36 Now, what about the Super ASCII MZX Town game? Did you answer this question yet? 09:35:12 What would the Olympics be like if the US had to send a different team for each state? 09:35:22 And each state had their own medal count 09:36:47 Taneb: They would change the country codes, I suppose. 09:50:48 -!- JesseH has left ("github.com/jessehorne"). 10:02:33 -!- heroux has quit (Ping timeout: 264 seconds). 10:04:11 -!- heroux has joined. 10:15:02 -!- AnotherTest has joined. 10:47:43 -!- MindlessDrone has joined. 10:57:32 -!- sacje has quit (Ping timeout: 246 seconds). 10:59:16 -!- lambdabot has quit (*.net *.split). 10:59:17 -!- Lymia has quit (*.net *.split). 10:59:17 -!- Gregor has quit (*.net *.split). 10:59:37 -!- dlackili has quit (Ping timeout: 250 seconds). 10:59:39 -!- Lymia has joined. 10:59:52 -!- Lymia has quit (Changing host). 10:59:52 -!- Lymia has joined. 11:00:25 -!- carado has joined. 11:10:41 -!- sacje has joined. 11:24:06 -!- heroux has quit (Ping timeout: 264 seconds). 11:25:02 -!- sacje has quit (Ping timeout: 256 seconds). 11:25:40 -!- heroux has joined. 11:35:44 -!- sacje has joined. 11:38:44 -!- fungot has joined. 11:43:54 -!- yorick has joined. 11:48:02 "s/PATTERN/REPLACEMENT/msixpodualgcer" so many flags they have these days. 11:49:48 That doesn't include 'ee' 11:50:05 It's implied by the e, I think. 11:50:09 -!- MindlessDrone has quit (Quit: MindlessDrone). 11:50:21 Probably; just saying that there's even one more. 11:55:26 "They have negotiated with the government and agreed on a system called "Active Choice +" in which customers opt in for filters [...] The leaked letter [...] suggests: "Without changing what you will be offering (ie active-choice +), the prime minister would like to be able to refer to your solutions [as] 'default-on'"." 11:55:40 the offness of the filters defaults to on 12:10:18 -!- dlackili has joined. 12:10:26 I have an idea for a puzzle 12:10:32 4 base64 numbers 12:10:38 4p2 is 8, i believe 12:10:42 er, i mean 12 12:10:51 GCD'ing all the possible combinations will give them 12 letters/numbers if we specially design the four digits, though I haven't thought that through yet 12:11:00 and I do something with those 12:11:09 not sure what though 12:11:28 if we could control 8 of the digits, we could get a pastebin link 12:11:36 and use the other 4 as a key 12:11:42 i think it would be constructible using primes 12:46:25 -!- mnoqy has quit (Quit: hello). 12:52:54 -!- carado has quit (Ping timeout: 245 seconds). 12:53:10 -!- carado has joined. 12:54:09 -!- copumpkin has quit (Ping timeout: 264 seconds). 12:54:46 -!- copumpkin has joined. 13:03:18 -!- boily has joined. 13:06:57 good humid morning! 13:07:17 -!- Frooxius has joined. 13:07:51 -!- oklopol has joined. 13:13:43 -!- yorick has quit (Remote host closed the connection). 13:18:59 -!- metasepia has joined. 13:27:02 -!- oerjan has joined. 13:27:18 -!- dlackili has quit (Quit: Page closed). 13:35:54 -!- nooodl has joined. 13:44:50 -!- sebbu3 has joined. 13:47:17 -!- sebbu has quit (Ping timeout: 246 seconds). 14:00:36 we, like, don't know if zeta(5) is irrational? imo, what the fuck. <-- the thing is iirc, there is a simple proof that only works for even arguments, and a completely unexpected special proof for 3. all larger odd numbers are unknown. 14:01:04 *odd arguments 14:01:33 @tell Bike we, like, don't know if zeta(5) is irrational? imo, what the fuck. <-- the thing is iirc, there is a simple proof that only works for even arguments, and a completely unexpected special proof for 3. all larger odd arguments are unknown. 14:01:41 wat. 14:01:56 elliott!!!!!!!!! 14:02:13 (hi) 14:02:29 -!- stuntaneous has joined. 14:02:33 ^tell oerjan Use a better bot. 14:02:33 I think you mean @tell instead? 14:02:39 fungot: I don't think that's helpful at all. 14:02:40 fizzie: i don't see how 99bob is related.) 14:02:48 fungot: neither do i 14:02:49 oerjan: most of them are much worse things in haskell syntax... as usual it's much simpler 14:03:25 fungot: okay 14:03:25 oerjan: final fantasy vii 14:03:57 oh, fungot is alive! hi fungot! 14:03:58 boily: as the parameter ft. 14:04:23 elliott, help 14:04:24 fungot turned into a parameter? :( 14:04:24 oerjan: what a joke. 14:04:29 I won myself an FF X2 poster from an... what's the word... auction? yesterday night. 14:04:35 Raffle? 14:04:42 «encan». 14:05:36 Auction 14:07:06 ("raffle" would be «tombola» 14:07:07 ) 14:08:36 /ɑ̃.kɑ̃/ is fun to say 14:10:05 !python print pow(3.14,pow(3.14,3.14)) 14:10:07 the Infamous French Nasal Vowels strike again. 14:10:09 1.14116774132e+18 14:10:26 (speaking of infamous things, what about the II? how's it going?) 14:10:51 it looks to me like pi^pi^pi^pi is just a little too large to check for integership? 14:11:35 ~eval pi ** pi 14:11:38 Error (1): 14:11:40 ~eval pi ** pi 14:11:40 36.4621596072079 14:12:41 oerjan, what would it mean for pi^pi^pi^pi to be an integer? 14:13:09 -!- AnotherTest has quit (Ping timeout: 268 seconds). 14:13:12 Taneb: that it has no fractional part? 14:13:26 Anything interesting beyond that? 14:13:32 also, it's an unknown problem mentioned earlier in the log and on wikipedia's tetration page 14:13:37 Aaaaah 14:13:46 It's one of the Everests of maths 14:14:17 yes, although it looks like it's just a _little_ out of reach and moore's law might catch it? 14:15:09 Does the function f(x)=n^^x have a well-defined derivative? 14:15:18 assuming it _isn't_ an integer, that is. if it is it'll probably take some serious proving. but i expect no one suspects that. 14:15:51 Taneb: you first have to define it for non-integers before the question makes sense. 14:16:16 True... 14:16:33 and any such definition would likely be made to have a derivative, and probably analytic. 14:18:31 "At this time there is no commonly accepted solution to the general problem of extending tetration to the real or complex values of n." 14:20:28 "There are two main approaches to extending tetration to real heights, one is based on the regularity requirement, and one is based on the differentiability requirement. These two approaches seem to be so different that they may not be reconciled, as they produce results inconsistent with each other." 14:22:08 :( 14:22:12 Regularity? 14:22:43 it's defined in the article 14:23:02 \left( \frac{d^2}{dx^2}f(x) > 0\right) for all x > 0 14:23:42 Its derivative is always an increasing function for x > 0 14:23:46 that still implies that it's differentiable twice though 14:24:07 but presumably you cannot have that and infinite times differentiable. 14:26:08 "There is a conjecture[10] that there exists a unique function F which is a solution of the equation F(z+1)=exp(F(z)) and satisfies the additional conditions that F(0)=1 and F(z) approaches the fixed points of the logarithm (roughly 0.31813150520476413531 ± 1.33723570143068940890i) as z approaches ±i∞ and that F is holomorphic in the whole complex z-plane, except the part of the real axis at z≤−2." 14:27:24 http://en.wikipedia.org/wiki/Tetration#Extension_to_complex_heights nice fractally picture 14:30:29 wtf did the logs turn black on grey... 14:34:25 does http://codu.org/logs/log/_esoteric/2013-07-23 look black on grey to anyone else? 14:35:18 it is. 14:35:41 it wasn't a few minutes ago... 14:36:26 let's see gregor isn't here, lambdabot isn't working, elliott isn't responding... 14:36:37 shall i just ban everyone and get it over with. 14:36:40 @tell elliott RESPOND! 14:37:16 oerjan, imo I should be op to create a balance of power 14:37:30 we should enquire the Voice of Kmc and request an Audience. 14:40:16 gregor has blocked memoserv... 14:41:03 i think today is the annoyance singularity. 14:42:02 ~metar EGNT 14:42:03 EGNT 231420Z 12006KT 080V170 9999 FEW020 23/17 Q1013 14:42:11 well, at least it's not raining. 14:42:24 thankfully there is tunes 14:42:42 ~duck tunes 14:42:43 tunes definition: loony. 14:43:57 ...that is my weather 14:45:29 Fiora: what the hecks. 14:46:36 Taneb: it is. 14:47:08 Bike: a supernovae lends a bunch of kinetic energy to the resulting remnant, so it will often launch the neutron star into a companion red giant 14:47:36 also the original paper is from 1977 @_@ 14:47:52 by kip thorne, even! 14:48:24 is that a name i should know 14:48:48 "he invented astrophysics and is the president of belgium" 14:48:57 I think he's a pretty famous physicist? like, along with hawking and stuff 14:49:32 Bike: sound plausible hth 14:49:58 but won't poor philippe get jealous 14:50:16 I remember his name was on like a book my dad gave me when I was little? I think 14:50:22 ... right! "Blac Holes and Time Warps" 14:50:24 *Black 14:51:32 so are you saying a supernova is like a loose cannon 14:51:49 aw man his doctoral advisor was fucking wheeler 14:52:47 * oerjan fails not to point out the ambiguous grammar in that 14:52:57 he did like, PBS popularity science stuff, like Sagan did 14:53:28 *popular science 14:53:38 oerjan: yes i am aware 14:54:03 Fucking Wheeler was doctoral advisor to many gifted individuals, despite his unfortunate forename 14:54:08 Bike: wow it is scary to see that like, wheeler's list of doctoral students is like, almost entirely wiki-linked 14:57:04 Fiora: you are like,-ing a little bit too much by this fine morning, I think. 14:57:14 well he is john archibald wheeler. 14:57:36 oh. in that case, please proceed along. 14:58:40 oerjan: re zeta(5): Yeah I was looking this up because a book said we didn't know shit about the odd values, but we actually don't, so 15:00:32 i vaguely recall that the difficult terms cancel each other when it's even, or so. 15:01:17 *very vaguely 15:01:32 well euler's proof only works for evens is all 15:01:48 btw euler's paper is pretty sad 15:02:03 they hadn't invented "pi" yet so he's all "the circumference of a circle whose diameter is 1" 15:11:23 "After Jones introduced the Greek letter in 1706, it was not adopted by other mathematicians until Euler started using it, beginning with his 1736 work Mechanica." 15:13:04 Jones, inventor of the Greek letter. 15:21:12 isn't elliott in charge of it now? i can pointlessly and unwarrantedly blame him, right <-- CORRECT 15:22:16 -!- kappabot has joined. 15:22:22 ooh 15:22:27 > pi^pi^pi 15:22:30 Ambiguous type variable `b0' in the constraints: 15:22:30 (GHC.Float.Floating b0)... 15:22:33 ... 15:22:40 > pi**pi**pi 15:22:43 1.3401641830063398e18 15:23:43 oerjan^oerjan^oerjan 15:23:51 glad it's not just me who fucks that up ;-( 15:24:10 Hi again 15:24:12 -!- Vorpal_ has changed nick to Vorpal. 15:24:13 > e 15:24:16 Yorpal 15:24:17 mueval-core: Time limit exceeded 15:24:19 and i was even reading the mess you made. hey i can blame you for corrupting me! 15:24:25 awesome 15:24:27 :t e 15:24:30 Not in scope: `e' 15:24:36 > let e = exp 1 in e ** e ** e ** e 15:24:39 Infinity 15:24:43 rite 15:24:50 > (exp . exp . exp . exp) 1 15:24:54 mueval-core: Time limit exceeded 15:25:30 oerjan: what's the biggest number 15:25:38 9 hth 15:26:10 Deewiant, Hm, I just tried out cfunge on cygwin, and discovered something weird... It prints floating point numbers using a fixed number of decimals (instead of skipping any trailing zeros as on Linux) 15:26:31 > exp . exp $ exp 1 15:26:34 3814279.104760214 15:26:35 Not really an issue, since I'm pretty sure FPDP/FPSP doesn't specify formatting details 15:26:38 but weird still 15:26:41 um 15:27:08 -!- tertu has joined. 15:27:16 "not that big right" 15:27:18 so e^e^e^e is presumably within reach 15:27:50 although possibly not with the bots 15:27:58 > iterate exp 1 15:28:02 mueval-core: Time limit exceeded 15:28:19 > 1 15:28:22 1 15:28:27 > 1^1^1^1 15:28:30 shachaf: it seems to time out rather fast ht 15:28:31 1 15:28:31 h 15:28:33 > 1**1**1**1 15:28:36 1.0 15:29:06 wel, (exp exp exp exp 1) is bigger than my 32 bit machine can handle 15:29:39 not in Double, Bike 15:29:41 http://www.wolframalpha.com/input/?i=e^e^e^e 15:29:54 -!- sebbu3 has changed nick to sebbu. 15:29:56 that's a lot of e's 15:30:57 can 64 bit doublees handle 22 bits of exponent 15:30:57 Deewiant, also there is now a 64-bit setup.exe download on the cygwin website, haven't tried it yet. No idea how stable it is an so on 15:31:03 > (exp . exp $ exp 1)/log 2 15:31:07 mueval-core: Time limit exceeded 15:31:14 Haven't used cygwin in ages, dunno 15:31:17 shachaf: I AM DISAPPOINTED 15:31:18 Hm 15:31:44 Deewiant, their website isn't exactly clear on stuff like "can you install both side by side?" or "how stable is this?" 15:31:53 Not clear as in I can't find that info at all 15:32:09 kappabot: @part #esoteric in shame 15:32:09 -!- kappabot has left ("in"). 15:32:15 I imagine there's nothing preventing side-by-side installation, just don't have both in PATH and whatever 15:32:26 Hm 15:32:39 I thought cygwin put stuff in the registry 15:32:53 Beats me 15:33:02 I've always thought of it as just like any other application 15:34:00 Deewiant, the output of 3DSP is really hard to read when cygwin prefers 0.000000 instead of 0 15:34:10 Which is very very strange still 15:34:15 oerjan: kappabot is sad :'( 15:34:17 23:56:19 @faq 15:34:17 23:56:19 The answer is: Yes! Haskell can do that. 15:34:20 -!- epicmonkey has quit (Remote host closed the connection). 15:34:22 -!- conehead has joined. 15:34:25 wat, i thought elliott had changed that 15:34:42 -!- epicmonkey has joined. 15:34:46 -!- epicmonkey has quit (Remote host closed the connection). 15:34:47 Nope. 16:08:34 -!- oerjan has quit (Quit: leaving). 16:15:06 -!- Nisstyre has quit (Ping timeout: 264 seconds). 16:20:48 -!- jsvine has quit (Quit: Leaving.). 16:22:55 -!- jsvine has joined. 16:30:49 shachaf: we're discussing whether the Rust unsafe raw pointer type should have mutable and immutable versions, like the other pointer types 16:30:52 what do you think 16:31:33 -!- AnotherTest has joined. 16:31:43 "immutable" just meaning that you personally can't mutate it, like const in C? 16:33:23 yeah 16:34:13 such a thing might be used when calling C libraries? 16:34:28 but if you import a C function and say that its rust type uses *c_char rather than *mut c_char, that's just unchecked documentation 16:34:48 so not a totally opaque pointer, but read-only.. 16:34:50 the C function could still mutate through that pointer 16:35:06 But you can define an unsafe Rust function and that could presumably be checked, right? 16:35:11 yeah 16:35:26 There isn't that much you can do with FFI, unless you're going to parse C headers or something. 16:36:00 well Rust does have a thing that parses C headerS: https://github.com/crabtw/rust-bindgen 16:36:09 -!- AnotherTest has quit (Ping timeout: 264 seconds). 16:36:23 Even parsing C headers isn't really checking C functions. 16:37:53 It seems like a useful distinction to make in a type, even if it's weaker than the normal immutable pointer types. 16:51:20 http://mxr.mozilla.org/mozilla-central/source/mfbt/DebugOnly.h neat hack 16:54:41 Hmm, I've seen that before. 16:56:00 where? 16:57:49 Something Mozilla-related, I think. 17:06:07 -!- `^_^v has joined. 17:15:45 -!- copumpkin has quit (Ping timeout: 264 seconds). 17:16:22 -!- copumpkin has joined. 17:18:58 kmc: hey, would you care to look at my unbreakable encryption scheme on pastebin.com 17:19:05 it's p. too hard for you tho 17:34:16 What is that logic puzzle called involving the guy who is hanged or shot if he tell the truth or a lie? 17:43:16 -!- Bike has quit (Ping timeout: 276 seconds). 17:44:20 -!- Bike has joined. 17:46:14 -!- epicmonkey has joined. 17:58:02 "If the plan involves someone injuring themselves in order play on someone's sympathies to gain an advantage, that's a Wounded Gazelle Gambit." What if the plan involves injuring yourself in order play on someone's lack of sympathies to gain an advantages? 17:59:00 zzo38: probably a batman gambit. 17:59:41 O, I suppose you are correct. 18:00:05 I still think there are a lot of gambit missing from their list, though. 18:00:22 and I think they renamed some, too. 18:00:26 zzo38: What about the Indefensible Gambit? 18:00:54 What is it called if you pretend to be someone else pretending to be you? (I don't mean they are pretending to be you; I mean that you are indirectly pretending to be you.) 18:04:27 I knew it: there's recursive crossdressing, even if that's not *quite* what you want, but close enough for me. 18:05:01 TTWRYL... 18:05:43 shachaf: Indefensible Gambit? 18:06:01 zzo38: Three undertrumps after an opponent's discard of a Trebled Fromp. 18:06:27 O, yes, that one. 18:06:45 ~duck fromp 18:06:45 --- No relevant information 18:07:01 I suppose you shouldn't discard a Trebled Fromp unless you have a good reason to believe that your opponent won't be able to make three undertrumps. 18:07:15 ~duck runcible spoon 18:07:15 A three-pronged fork, such as a pickle fork, curved like a spoon and having a cutting edge. 18:07:34 But such a gambit is too specific, unless it is widened perhaps. 18:10:21 -!- epicmonkey has quit (Ping timeout: 264 seconds). 18:11:29 Is there any Death Note fan story where someone is tricked into changing their name? 18:12:56 slash fiction where L must become Ł? 18:13:42 "L" isn't his real name so that doesn't count. 18:18:45 -!- tertu has quit (Ping timeout: 264 seconds). 18:20:38 solidus fiction 18:20:52 kmc: You're using Mac OS? 18:21:57 -!- Gregor has joined. 18:23:34 What is it called if in a Dungeons&Dragons game you try to make saving throw against a spell that although it is allowed you normally don't do so because it is marked as (harmless)? 18:23:55 A waste of time? 18:24:10 Deewiant: I don't think so. 18:24:23 I mean where you actually gain an advantage by doing so. 18:24:38 how do I remember copious numbers of non-ASCII Unicode symbol codes? 18:25:00 how copious are we talkin' 18:25:21 as much as I will need to be a first-class citizen of the world IRC 18:25:24 I have never had the opportunity myself to find it useful, although there was a situation where it would have been useful for one of the other players; I told them but they decided not to use it anyways. 18:25:50 Gracenotes: just memorize them as you use them hth 18:26:26 I have also once been in a situation where the opponent's used a magic item to extremely slow down my team; I figured out how to use that to my advantage, instead of a disadvantage as they intended it to be 18:26:43 okay what's the dual of hth 18:27:07 ɥʇɥ hth 18:27:34 What is *this* called? 18:27:54 zzo38: How did you use it to your advantage? 18:28:45 I fired a flaming projectile at them. (See if you understand. If not, I will continue to tell you anyways.) 18:28:50 shachaf: i'm not 18:28:54 shachaf: I just know this to be true 18:29:21 ah 18:29:32 zzo38: i'm not sure whether i understand!! go on 18:30:09 It give them more than enough opportunity that all of them will certainly get out of the way, so that they won't get hit. 18:30:10 what effect does speed have on projectiles and flaming and adjective-noun association 18:30:28 The building behind them was their hideout and was made of wood. 18:30:47 Therefore they quickly burned themself to death. 18:31:50 Couldn't you have fired a flaming projectile at the building anyway? 18:32:03 I mean, it's not as if they'd've stepped in front of it, presumably. 18:32:43 No; they were in the way and if I did they would have known that it is what I was trying to do and somehow stop it. This way I can take advantage of my slowness in order to trick them. 18:34:49 So they thought through your capabilities in much less detail (underestimating) that you did? 18:35:25 *than 18:36:08 Or actually my intention, I suppose, is what they didn't think of because I tricked them into believing it was something else. 18:36:27 zzo38: But if you had been fast, would they have managed to get into the way in time? 18:38:23 shachaf: Possibly; I want to consider their possibility that they have some power which I do not know about. Also, if I cancelled their slowness it would have wasted a spell to dispel their magic; the way I am doing requires not casting any spells, just using an arrow. 18:38:53 zzo38: I mean, if you'd've just not been slowed down in the first place. 18:39:03 The question is whether the slowness was really to your advantage. 18:39:33 it makes a much better narrative, at least 18:39:52 I understand that, but but yes it was to my advantage; it ensured that I could effectively trick them. (Otherwise it is unknown what the random variables would have in order that the plan might not end up working.) 18:39:54 which is partly what RPG-based games let you do 18:40:50 Yes, this is what I like about RPG. 18:42:11 If they hadn't used magic, I probably would have needed to use magic in order to beat them, but since they did use magic I did not have to. 18:43:41 I could have used magic, but not only might they have countered it but there are saving throws and stuff, and it would use up the spell, and I didn't want to waste it; there is also the factor of false intention so even ignoring these things magic would have been worse anyways. 18:45:52 So in other words, the slowness spell they cast ended up greatly diminishing their chances of winning. 18:46:43 Do you know when Washizu said after every two hanchan only he has the choice to decide to continue or to stop, and Akagi said that stupid move would end up defeating him? 18:47:40 -!- tertu has joined. 18:48:26 (This is a part of a story Fukumoto wrote, called "Akagi".) 18:50:44 There may be some other stories with a similar idea to what I described with the slowness, although they might have been tricked into activating the power in the first place. In my case, there was no such trick. 18:50:48 how do i evaluate combinators help 18:51:09 http://mjg59.dreamwidth.org/26535.html 18:51:20 you don't 18:51:54 So in Haskell, I've defined a type representing an expression built out of a certain set of combinators (Apply, Compose, Flip, Pair, Uncurry, WithPair, Fst, Snd, Lft, Rgt, Case, Gimme, Trash, Cancel), and I know what the semantics of each of these combinators ought to be. 18:52:04 I'd like to write a function that takes an expression and reduces it. 18:52:07 are they typed nicely 18:52:15 can you construct illegal expresions? 18:52:21 Yep, they're typed nicely. 18:52:51 so these combinators are constructors? 18:52:53 (In Akagi's case, it is unknown. He did increase the stakes, which Washizu considered stupid and Washizu's security guards agreed that since Akagi did that, that Washizu is correct in saying that only he has the right to decide when to stop after every two hanchan.) 18:52:56 Yeah. 18:53:43 well, you can have an eval function Expr -> ResultType, or Expr -> Reader Env ResultType if you need that 18:53:58 nortti: interesting 18:54:02 this is a basic way of doin it 18:54:06 I think Expr a -> a is what I want in this case. 18:54:45 when you want things like that, you usually need Expr to be a GADT 18:55:03 yeah.. GADTs are nice. 18:55:18 I take it you've seen this: http://vimeo.com/12208838 18:55:19 So, uh, lemme think. There are certain ways of rewriting an expression. I think I want to use non-strict evaluation. So this means finding the topmost possible rewrite and making it, over and over, until there are no more rewrites. 18:55:20 Right? 18:55:24 it goes through it slowly but wellly 18:55:24 Yeah, it's a GADT. 18:56:09 do you want to do normal order or also with sharing? 18:56:49 I don't think I want to do anything special for sharing. 18:57:06 I'll just hope, perhaps falsely, that Haskell will take care of that for me. 18:57:21 I expected it to be a GADT, since you said the types are correct 18:58:23 tswett: for a lot of the combinators, how to write it should be clear... sometimes you will need an environment; sometimes you will need both an environment and a store (with mutation) 18:58:38 Right, lemme try just diving in. 18:58:56 possibly a runtime datatype to be denoted within the environment 19:01:06 So here's the algorithm I'd use naively: 19:02:05 To evaluate f(x), first check whether it's top-level rewritable; if it is, rewrite it and evaluate it again; otherwise, evaluate f yielding f', then evaluate x yielding x', then evaluate f'(x'). 19:02:12 But that algorithm will never terminate. 19:02:39 I think I need to distinguish between things that are fully reduced and things that aren't fully reduced. 19:02:45 evaluating x without calling if is strict evaluation 19:02:56 s/if/f/ 19:03:00 Whoops, right. 19:05:46 although what you described is good for strict application; evaluating f'(x') means calling f' if it is callable, or giving up if it isn't 19:06:10 (giving up = no more rewriting) 19:07:28 A while ago in Dungeons&Dragons game we went to the demon's castle in order to try to beat the demon. I found that it was abandoned, except for a few vampires guarding one of the exits, an invoice for moving their posessions to another castle, and some silverware. 19:07:35 Maybe what I want to do is to write a function that performs just one reduction step. 19:08:01 zzo38: vampires and silverware??? 19:08:08 Immediately when I saw this I suspected that they are trying to do a Kansas City Shuffle on us (although at the time, I didn't know what it was called). I still do not know whether or not this is correct. 19:08:27 boily: The vampires were guarding an exit; an entirely different room to the silverware. 19:08:41 But I suppose I can see what you might be getting at... 19:08:43 But no. 19:08:58 :( 19:09:50 tswett: maybe you might start with a simpler language, like lambda calculus 19:09:52 I suspect they are trying to make us think that they think their vampires can beat us, but this isn't the Kansas City Shuffle I am talking about, and it has nothing to do with the silverware. 19:11:01 looks like their vampires are different. 19:11:23 I dunno. Otherwise, start with eval (Constr ...) env = ..., and recursion is your friend 19:11:28 boily: I don't know because I didn't try using the silverware against them. 19:11:47 (I actually didn't think of that, but even if I did I probably would have tried something else anyways.) 19:12:17 I think I did this for Unlambda once. 19:12:51 I ended up keeping the silverware in case we need the metal for something else later on. 19:13:32 unlambda also doesn't need an environment; it's a bit pathological 19:13:55 zzo38: that's what we usually do when we play d&d: loot everything, and I mean *everything*. 19:14:14 (and with proper creativity, you can cut a steak from just about any random material and/or monster) 19:14:45 "error: not all control paths return a value" is a somewhat poor error message for "you shouldn't have a semicolon on the last line of your function" 19:14:59 although, not weird; it's how Miranda worked (very enhanced SKI calculus) 19:15:06 "I loot every real number." "Sorry, you can only take countably many actions in a finite amount of time." 19:15:41 Gracenotes: really? elaborate? 19:15:50 is this Miranda the predecessor of Haskell? 19:15:56 tswett: not a problem. with enough charisma and an infinite line of peasants, you can achieve FTL travel. 19:16:19 Does charisma affect the DM? 19:16:24 kmc: rustc errors are not so great right now 19:16:27 yeah 19:16:30 If I have a charisma of 85, can I become the DM? 19:16:32 maybe i should fix it "patches welcome" 19:16:33 yes. It took inspiration from SASL in compiling lambda calculus down to combinators 19:16:33 did you see the Y thing i made 19:17:02 i was vaguely surprised that it worked 19:17:19 tswett: you must bribe them with valuable trinkets and sacred dice. 19:17:53 shachaf: no 19:18:34 http://shachaf.net/curry.rs.txt 19:18:45 kmc: in addition to SKI, it has B, C, P, U, E, Y... etc. 19:18:48 someone came to #rust asking about how to make it work 19:19:31 eek 19:19:51 I wrote the Y combinator in C++ once 19:19:55 this is noisier ;P 19:19:58 though fewer lines 19:20:16 the type is v. awkward 19:20:22 @where y 19:20:38 help 19:20:39 boily: I rarely loot anything, but do loot these kind of things. 19:20:52 -!- kappabot has joined. 19:21:06 this is just \f -> (\x -> f (unRec x x)) (\x -> f (unRec x x)) 19:21:12 reminds me, I promised to someone on this channel a long time ago the journals of our quests. 19:21:16 > (\f -> (\x -> f (unRec x x)) (\x -> f (unRec x x))) (1:) 19:21:22 Not in scope: `unRec'Not in scope: `unRec' 19:21:27 boily: Do you have it? 19:21:47 > (\f -> (\x -> f (outR x x)) (\x -> f (outR x x))) (1:) 19:21:47 zzo38: nah, at home. I think I have some of them in my inbox... 19:21:51 shachaf: I hear @fn may disappear soon anyway 19:21:54 The lambda expression `\ x -> f (L.outR x x)' has one argument, 19:21:54 but its ty... 19:22:01 kappabot: yw 19:22:06 oh no 19:22:29 kmc: what will we do instead!! 19:22:40 Actually as it turns out the number of human characters we had in our party was equal to the number of forks, so I gave them all away so each got one fork, so that they might eat. 19:22:55 But we can use them for other purposes too if it would help to do so. 19:23:03 Is it impossible to eat without a fork? 19:23:10 Some of the soldiers have since died so I got their forks back. 19:23:25 tswett: I don't think so, but I would expect they don't want to eat by hand. 19:23:29 > (\f -> (\x -> f (outR x x)) (Rec (\x -> f (outR x x)))) (1:) 19:23:33 Not in scope: data constructor `Rec' 19:23:39 > (\f -> (\x -> f (outR x x)) (InR (\x -> f (outR x x)))) (1:) 19:23:43 i can do it!! 19:23:43 mueval-core: Time limit exceeded 19:23:54 > (\f -> (\x -> f (outR x x)) (InR (\x -> f (outR x x)))) (1:) 19:23:54 There, I've implemented everything but Cancel. 19:23:58 mueval-core: Time limit exceeded 19:23:59 p. sure i won 19:25:45 -!- yorick has joined. 19:26:09 Which is the crappy thing to implement, because its semantics are Cancel f = (evaluate 'f g' and wait for g to be applied to some value x, and return x). 19:26:21 zzo38: I have an interesting sample. would you like the missive to be joyously sent by e-mail? 19:26:43 (I really can't garantee your understanding, unless you speak a very weird variety of French.) 19:26:58 boily: No; I don't speak French very well at all. 19:27:02 shachaf: @~fn maybe? I'm not sure 19:27:36 zzo38: darn. 19:27:40 m@~ 19:27:51 by roald.dahl.net 19:27:56 quelqu'un ici qui parle français à part moi? 19:28:21 I don't loot everything; in fact I rarely loot money. I also found a place where someone kept everything including the stuff they stole from us; I took nothing except the things they have taken from us. 19:29:47 I am not the kind of thief. 19:35:12 typically i either turn it off entirely or leave it in regular mode 19:35:24 well, depends 19:36:28 So I'm still trying to think how to implement Cancel... 19:36:28 sometimes that's not true 19:37:20 One thing you could do is grab the context and let g be that context. But the context has the wrong type; the context could return anything, whereas f expects something of type Bottom. 19:37:48 Maybe I should say "continuation" instead of "context". 19:50:12 -!- nooodl_ has joined. 19:53:22 -!- nooodl has quit (Ping timeout: 246 seconds). 19:54:42 What is it called when you write an encrypted message containing many true things but the crucial things are lies, in the expectation that your opponent's will catch you, steal the message (that they thought you were trying to deliver), and hire their team to crack the code... 19:55:24 usual counterintelligence practice :p 19:56:22 What is it called when you take this further; you expect that they expect you to do this? 19:56:54 a Princess Bride scene 19:57:27 speaking of counterintelligence http://en.wikipedia.org/wiki/Operation_Bertram was pretty badass 19:57:43 incl http://en.wikipedia.org/wiki/Operation_Bertram#Double_bluff 19:57:47 you can canary your messages, do classic traffic analysis, then expound on the breaches of information. 19:59:21 kmc: that's some surreal shit. 20:02:07 Double bluff? Akagi uses quintuple bluffs. 20:02:40 try to keep up, rommel-kun 20:03:44 I do not know if the demon and those who work for him are expecting that I am expecting it to be a Kansas City Shuffle. 20:05:09 let's consult the Old Wise One... 20:05:11 ~fortune 20:05:12 Okay ... I'm going home to write the "I HATE RUBIK's CUBE HANDBOOK FOR 20:05:12 DEAD CAT LOVERS" ... 20:05:36 * Bike nods 20:07:57 -!- tertu has quit (Ping timeout: 264 seconds). 20:09:52 Does an anticipated Kansas City Shuffle have a special name? 20:10:51 1,500 tanks fighting in the middle of the desert 20:10:57 it's insane to think about 20:11:31 zzo38: probably a violin scam, but I'm not sure. 20:12:01 kmc: have you read "Losing the War" (it's an essay about WWII and being insane) 20:12:08 kmc: Are you insane to think about 1,500 tanks fighting in the middle of the desert? 20:12:16 Bike: maybe 20:12:18 wait no 20:12:20 Bike: no 20:12:21 zzo38: maybe 20:12:25 help 20:12:28 http://leesandlin.com/articles/LosingTheWar.htm 20:12:30 it's pretty good. 20:12:49 there's a section on war reporters talking about things being "eerie" or "surreal" and such 20:12:55 Am I simultaneously sane and insane? 20:13:07 probably 20:13:13 zzo38: you are under the illusion that you are zzo38. everything is fine. 20:13:25 -!- augur has quit (Ping timeout: 276 seconds). 20:13:52 I don't think being under such illusion makes everything to be fine... 20:15:01 -!- tertu has joined. 20:28:42 Bike: so like, I like how wikipedia's list of stellar remnants is like 20:28:53 "white dwarf, neutron star, black hole.... EF Eridani B" 20:29:03 http://en.wikipedia.org/wiki/EF_Eridani it's apparently so unusual that they don't have a name for it 20:30:21 -!- augur has joined. 20:35:44 -!- nooodl_ has quit (Ping timeout: 246 seconds). 20:35:48 -!- augur_ has joined. 20:37:57 -!- augur has quit (Ping timeout: 264 seconds). 20:39:44 -!- oklopol has quit (Ping timeout: 260 seconds). 20:41:19 Eridanipoid 20:42:06 `learn eridanipoid is a category of uncategorifiable stellar remnants. 20:42:12 -!- augur has joined. 20:42:16 I knew that. 20:42:38 you're welcome, astronomers. 20:43:15 https://en.wikipedia.org/wiki/Epsilon_Eridani_in_fiction 20:43:40 so uh 20:43:45 what's this thing made out of exactly 20:44:05 it's a twentieth the size of the sun, has no fusion... 20:44:07 -!- augur_ has quit (Read error: Operation timed out). 20:45:45 http://arxiv.org/abs/astro-ph/0001183 maybe this might have it? 20:47:28 -!- augur_ has joined. 20:47:42 sorry for all the nerding out about astronomy things >_< 20:47:48 i wish someone would call /me/ a magnetic cataclysmic binary 20:47:53 that's true love 20:48:19 that sounds more like a fat joke 20:49:09 -!- augur_ has quit (Read error: Connection reset by peer). 20:49:16 i am not good enough at astrophysics to understand how that could possibly be a fat oke 20:49:35 -!- augur_ has joined. 20:50:12 well, like, a cataclysmic binary is one where a big star orbits a white dwarf that's sucking off mass 20:50:25 and keeps nova-ing as the mass accretes, then flash-fuses, and repeats, I think? 20:51:06 -!- augur has quit (Ping timeout: 264 seconds). 20:51:23 so um. I guess it means you're one big star and one small star, and you're exchanging mass, and the small one keeps exploding 20:51:28 I really don't know what this would imply I guess 20:52:07 sounds like an exciting thing to be called still! 20:53:17 “baby, let's exchange mass an go nova” 20:56:17 -!- augur has joined. 20:56:56 -!- augur_ has quit (Ping timeout: 256 seconds). 20:59:42 -!- nooodl_ has joined. 21:00:48 -!- metasepia has quit (Remote host closed the connection). 21:00:51 -!- boily has quit (Quit: Poulet!). 21:01:17 -!- oerjan has joined. 21:08:53 -!- sacje has quit (Ping timeout: 245 seconds). 21:11:16 -!- sacje has joined. 21:13:41 -!- tertu has quit (Ping timeout: 248 seconds). 21:14:35 -!- Taneb has quit (Ping timeout: 240 seconds). 21:18:48 -!- augur has quit (Remote host closed the connection). 21:19:52 -!- augur has joined. 21:21:38 -!- augur_ has joined. 21:25:18 -!- augur has quit (Ping timeout: 264 seconds). 21:31:34 http://www.cell.com/current-biology/retrieve/pii/S096098221300835X finally biologists speak up on the #drugz #warz 21:32:37 -!- Taneb has joined. 21:32:59 war, uh, yeah, what is it good for, misappropriating public funds 21:33:36 that doesn't scan :c 21:33:43 http://www.youtube.com/watch?v=5L2Gve7oh_4 21:38:23 i can't decide if the best part of that is sam and max's faces, or the pathetic little shuffly kicks in front of the flag 21:39:03 damn it! foiled by having to put -lxxx as the last arguments of gcc/the gcc-compatible clang frontend.. again! 21:41:43 kmc: Thank you for that; now I've got the Cannon Fodder intro song looping in my head. ("war / never been so much fun / ... / go to your brother / kill him with your gun / leave him lying in his uniform / dying in the sun / ...") 21:42:44 http://www.youtube.com/watch?v=xQhLRr0HRGI and so on. 21:45:56 Which is the crappy thing to implement, because its semantics are Cancel f = (evaluate 'f g' and wait for g to be applied to some value x, and return x). <-- isn't that just callCC 21:46:28 oerjan: sounds a lot like it. It's callCC with the type ((a -> Bot) -> Bot) -> a. 21:47:21 so i'd expect you need CPS 21:47:39 (or a Cont monad, which is just indirect CPS) 21:48:05 or possibly just ErrorT 21:48:19 Yeah, with Cont, wouldn't r have to be Bot? 21:48:45 :t callCC 21:48:46 Not in scope: `callCC' 21:48:54 SHEESH 21:49:03 hey oerjan 21:49:16 what's Foo such that class Functor f => Applicative f where applicative :: Foo f a -> f a 21:49:28 callCC :: MonadCont m => ((a -> m b) -> m a) -> m a 21:50:51 hm ok not the same type 21:51:01 shachaf: IDunno 21:51:24 It looks similar to this, however: 21:51:25 shift :: MonadDelimitedCont p s m => p b -> ((m a -> m b) -> m b) -> m a 21:51:47 ok 21:52:04 oerjan: dwfm htdh thx4n 21:52:59 shachaf: strč prst skrz krk 21:53:05 hth 21:53:48 So could I use CC? 21:53:54 oerjan: help 21:54:41 No, I don't think I could. There's the same problem again: a has to be Bot, so you can't return anything through it except for Bot. 21:55:05 shachaf: you are lost in a maze of unpronouncable syllables. dvořák is here. 21:55:43 Fiora: http://dx.doi.org/10.1016/j.cub.2013.03.057 some jellyfish have neural organization without cephalization 21:56:36 Hm. I can make Bot a type variable instead of a constant. 21:57:09 tswett: what about Bot = forall a. a 21:57:37 oerjan: you still can't return anything through it, because you can't convert stuff to forall a. a. 21:57:51 fiendish 21:58:07 Can you write id using only compose and flip? 21:58:11 i suppose you should ask someone who actually knows about typed continuation stuff hth 21:58:12 help what's the problem at hand 21:58:20 shachaf: my problem? 21:58:21 not that i know about typed continuations 21:58:29 what's the thing you're trying to do 21:58:45 :t cont 21:58:46 Not in scope: `cont' 21:58:47 Perhaps you meant `const' (imported from Prelude) 21:58:51 :t Control.Monad.Cont.cont 21:58:53 Couldn't find qualified module. 21:58:54 tswett: flip . flip hth 21:58:55 help 21:59:01 cont :: forall a r. ((a -> r) -> r) -> Cont r a 21:59:04 :t flip . flip 21:59:04 there you go!! 21:59:06 forall a b c. (b -> a -> c) -> b -> a -> c 21:59:21 Mm, its type isn't general enough. 21:59:30 your type isn't general enough :'( 21:59:31 shachaf: well, uh, I have this thing, and I'm trying to make it work. 22:00:00 http://lpaste.net/91160 22:00:14 I know, some of those equations are kind of atrocious. 22:00:21 ew hth 22:00:26 Well, no. These equations are pretty nice. 22:00:32 Some of my *old* equations were pretty atrocious. 22:00:35 "step (Apply (Apply Uncurry f) (Apply (Apply Pair x) y)) = Just (Apply (Apply f x) y)" 22:00:39 tswett: i am not sure if you can construct something that takes only one argument 22:00:51 I'll just add id as another combinator. 22:00:58 id do the same thing 22:01:05 Lol hth. 22:02:11 So, Cancel is supposed to pretty much be callCC. 22:02:30 "Apply Cancel (Apply (Apply Flip Id) Gimme)" should eventually reduce to Gimme. 22:02:45 isn't it dne 22:02:52 shachaf: does not exist? 22:02:58 double negation elimination hth 22:03:04 Yes, that's exactly what it is. 22:03:10 that's not the same as callcc 22:03:13 directed shotgun proteomics 22:03:15 (though you can write one in terms of the other) 22:03:17 Oh yeah. It's that. 22:03:25 So yeah. I'm trying to figure out how to write double negation elimination. 22:03:46 with continuations hth 22:03:58 tmh 22:04:36 tswett: one point is that you don't want the actual underlying type to be a -> Bot, since that's impossible 22:04:47 you want a -> m Bot or something 22:05:14 oerjan: well, this isn't really an "underlying type" 22:05:33 So "step (Apply Cancel f)" should be all like "hey dudes, what's the continuation?", and then, like, it ought to just reify the continuation and make Apply f g be the ultimate result, aye? 22:05:34 i mean, it's just the argument to the gadt. it's not "contained in"" the gadt 22:05:59 shachaf: i understood his combinators were typed. 22:06:17 The combinators are indeed typed, though the types currently have nothing to do with any underlying representations. 22:07:29 Y'all can see me now 'cause you don't see with your eye; you perceive with your mind. HTH 22:07:37 All right, what were we doing? 22:08:02 [Lag: 26.99] 22:08:06 coo-coo-coo-coo-coo 22:08:26 if this just descended into singing gorillaz off-key i'd be ok with that. 22:08:26 I could have something that says Coerce :: Expr a -> Expr b. 22:08:36 Is it possible to rap off-key? 22:08:41 everyone has perfect pitch on the internet 22:08:48 you fucking watch me, i'll mess it up somehow 22:09:23 But no, uh, continuations. 22:09:41 callcc is weird. it's scary, too. 22:09:55 is it like me 22:10:22 step (Apply Cancel f) cont = Just (Apply f cont)?????????? 22:10:53 tswett: i don't see how you can implement your g as something not containing a continuation 22:10:59 i m not quite sure what you 're after here 22:11:03 Yeah, it's certainly going to have a continuation. 22:11:05 containuiation 22:11:17 I'm pretty definitely after something involving continuations. 22:11:59 The question is how to implement this double negation elimination combinator, presumably using continuations. 22:14:17 kmc: i keep thinking rusti is a swiss potato dish 22:14:21 Okay, uhh. So we have Apply Cancel (Apply (Apply Flip Id) Gimme). So f = Apply (Apply Flip Id) Gimme, and the continuation is the identity function. So we can just reduce Apply f Id, and there we go. 22:14:21 kmc: sadly not 22:14:31 shachaf: rösti hth 22:14:37 oerjan: i know :'( 22:14:48 So apparently the continuation needs to be given as an Expr, not as a function. 22:14:52 Rodgrod med flode. 22:14:54 oerjan: there's a rust-evaluating bot in #rust called rusti hth 22:14:55 15:14 < strcat> rusti: let b = 5 as bool; (b, b == true) 22:14:55 15:14 -rusti:#rust- (true, false) 22:15:04 best boolean type ever 22:15:08 Or I guess it could be given as a function, as long as we can somehow turn that function into an Expr. 22:15:11 what the shit 22:15:12 shachaf: why would it be a swiss potato dish 22:15:14 km: is it unsafecoercing......................... 22:15:22 c 22:15:23 tswett: rødgrød med fløde you uneducated dolt 22:15:24 not exactly 22:15:24 kmc: because https://en.wikipedia.org/wiki/Rösti 22:15:26 -!- Frooxius has quit (Read error: Connection reset by peer). 22:15:32 oerjan: whøøps sørry 22:15:47 tasty 22:15:52 JAUSA! 22:15:54 let's use integer equality on booleans, what could go wrong 22:16:11 kmc: rösti is delicious hth 22:16:11 Let's say that every type is a subtype of Bool. 22:16:14 let's coerce numeric types, what could go wrong 22:16:17 oerjan can confirm (rightjan?) 22:16:26 google wants to translate rødgrød as rødgrød, I guess that's fair 22:16:50 also wait 22:16:53 does rusti actually use notices 22:16:58 yes 22:17:01 wow 22:17:06 most shocking part of that exchange imo 22:17:09 tswett: oh i'm thinking, your continuation for a type a should be a -> Expr, since you are doing steps 22:17:09 because rusti is a cool bot who follows the spec 22:17:16 or wait hm 22:17:21 i wish i was as cool as rusti 22:17:28 -!- Frooxius has joined. 22:17:30 but without the segfaults 22:17:44 segfaulting could be kinda rough yeah 22:17:45 tswett: um your step function needs to include the _next_ continuation in its result as well 22:17:54 kmc: It looks like it is pretty much unsafeCoercing? 22:18:23 otherwise you wouldn't know how do do the next step... 22:19:34 oerjan: do you mind if i use ø to mean the empty set 22:19:42 ∅ is so awkward to type 22:19:49 and they look p. much the same 22:19:58 is that \emptyset or \varnothing? 22:20:00 ø∅ 22:20:18 G̸racenotes 22:21:08 I see dead diacritic marks 22:21:17 why do people upvote the wrong answers on stack overflow 22:21:49 why do i have 20 points for answering "is putstrln thread-safe" with "yes" 22:22:04 god is real and hates you, hth. 22:22:07 haha 22:22:17 unsafeInterleavePutStrLn 22:22:29 also abu ghraib got military assaulted and a bunch of guys are out now. 22:22:37 shachaf: it's been too long since i tasted rösti, i've forgotten 22:24:56 oerjan: wow that's not v. swiss of you 22:24:57 tswett: step (Cancel f, cont) = Just (Apply f (ContE cont), cont) or something 22:25:07 i am indeed not very swiss 22:26:30 hm or wait... 22:26:42 oerjan: did you remember that you were swiss 22:26:54 i think the tricky part is what step (Apply (ContE cont) ...) should return 22:27:00 no. 22:27:11 oerjan: you remind me of swiss cheese hth 22:27:15 not that that's use in rösti 22:27:56 that's the step that requires changing the next step continuation. 22:28:50 shachaf: are you saying i am a very holy person? 22:31:04 I said it in Hebrew, I said it in Dutch, / I said it in German and Greek, / But I wholly forgot (and it vexes me much) / That English is what you speak. 22:31:19 (and norwegian) 22:31:30 (and maybe other languages?? what languages do you speak) 22:31:40 (are any of them hebrew/dutch/german/greek) 22:31:51 (i think if you speak english+german you speak dutch automatically) 22:36:17 -!- mnoqy has joined. 22:37:22 mnoqy: yo yo yo dawg 22:37:28 hi 22:37:33 c'mon 22:37:34 gimme a yo 22:37:44 ??? 22:37:59 c’mon 22:38:06 c‚mon 22:38:24 shachaf: i can do a little german 22:38:45 how much on a scale of 1 to 13 22:38:52 from there to pronouncing dutch is another galaxy. 22:39:25 yes but i have no evidence you know how to pronounce english either 22:39:43 well i had 4 years (i think) of german in school. i just haven't used it much since. 22:40:19 (also one year of french) 22:40:21 hm i had a few years of english in school 22:40:23 and french 22:40:25 and arabic 22:40:46 all before grade 6 though............... 22:41:38 shachaf: i have been known to be understood vocally by native english speakers. 22:42:22 including giving a few presentations 22:42:27 how vocally are we talkin' 22:42:39 I REALLY UNDERSTAND THIS OERJAN FELLOW 100% 22:42:41 VERY CLEAR 22:42:44 like that? 22:42:51 BUT MY EARS HURT 22:50:11 -!- jsvine has quit (Quit: Leaving.). 22:58:12 why do your ears hurt? 22:58:27 -!- Taneb has quit (Quit: Leaving). 23:00:09 BECAUSE PEOPLE ARE SHOUTING TOO VOCALLY HTH 23:00:22 STOP LISTENING TO THEM HTH 23:00:58 IMPOSSIBLE 23:01:41 I think you mean *un*possible 23:02:16 imlikely 23:03:35 unprobably 23:20:40 * olsner -> slep 23:22:12 http://nsaunders.wordpress.com/2013/07/16/interestingly-the-sentence-adverbs-of-pubmed-central/ btw this is great 23:23:53 http://nsaunders.files.wordpress.com/2013/07/adverbsopencloud20.png?w=300&h=300 wow 23:23:59 this article is great, thanks~ 23:25:03 "bmc immunology" is the most interesting journal 23:25:12 "Nature" has the most remarkable results 23:25:16 ow 23:25:24 "plos med" and "bioinformatics" are the most unfortunate 23:26:52 Grossly.... Histologically... Immunohistochemically... Ultrastructurally... 23:27:04 http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3173291/ help I am laughing at abstracts of papers I can't understand 23:28:07 bike what have you dooone 23:28:08 wow, that's just not good writing. 23:28:57 «You might imagine that very long adverbs stand a good chance of being ugly. Let’s find the longest: "electronmicroscopically". You'd be correct.» 23:30:38 that's too long for a double dactyl :'( 23:31:08 how about ethnopharmacologically 23:31:28 what does that even mean @_@ 23:31:47 probably related to ethnomedicine 23:32:00 which is where you ask people which plants they use to cure colds 23:32:23 ethno...? 23:33:02 there ethno medicine for cold 23:33:14 as in ethnology 23:34:18 the study of cultures, which frequently means ethnic groups 23:36:47 i have a little book on ethnomedicine, it's pretty cool, they lived with dominicans (as in dominica, not the dominican republic) for a while 23:37:15 one of the "traditional healers" was a guy who'd gotten a book on identifying plants in high school and thought it would be neat do try and cure diseases like his grandparents did 23:55:53 -!- sprocklem has joined. 23:58:55 oerjan: oh, duh, you were right, it's an alternating series and the signs only cancel for squares 23:59:29 yay for vague recall