| --- Log opened Wed Dec 14 00:00:48 2011 |
| 00:06 | < Reiver> | Android apps/settings query: Is it possible to have the phone rigged to talk to WiFi #1 first, Wifi #2 second, Cellphone third? |
| 00:10 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 00:15 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 00:29 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 00:30 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 00:32 | | Lingerance [rstamer@Nightstar-e681a855.org] has joined #code |
| 00:48 | | Derakon[AFK] is now known as Derakon |
| 00:59 | | gnolam [lenin@Nightstar-202a5047.priv.bahnhof.se] has quit [[NS] Quit: Z?] |
| 01:00 | | gnolam [lenin@Nightstar-202a5047.priv.bahnhof.se] has joined #code |
| 01:05 | < Eri> | I wish, but I've had no luck finding that option |
| 01:05 | < Eri> | Maybe there's some kind of a connection manager app? |
| 01:07 | < Reiver> | It would be good indeed if there was... |
| 01:07 | < Reiver> | I shall have to investigate, I suppose |
| 01:07 | < Reiver> | (Query: Once you're on WiFi, does it stick internet through there automatically, at least?) |
| 01:08 | < Eri> | Yeah |
| 01:08 | < celticminstrel> | You're assuming the WiFi has internet. :P |
| 01:08 | < Eri> | I think it still tries, and fails |
| 01:09 | < Eri> | I know that mine connects to wifi, and just sits if I haven't authenticated at the school |
| 01:09 | < Eri> | That may be the college's network doing something stupid, though |
| 01:11 | < Reiver> | celticminstrel: For the purposes of this discussion, I am making that assumption, yes. |
| 01:12 | | * Reiver is trying to figure out how best to rig smartphones to use Cellular Broadband as little as leeging possible |
| 01:12 | < Reiver> | My three options are connected to the home wifi, for 20gig/mo; university/city centre wifi, for $10/GB; and finally cellular broadband... for $10/mb. |
| 01:12 | < Reiver> | You see my concern. ?? |
| 01:13 | < Reiver> | (Well, $1/mb once I rig it, but still suck) |
| 01:15 | | * gnolam ouches at Reiver's caps. |
| 01:15 | < Reiver> | The home connection isn't too bad - it does include unmetered bandwidth from 4-8AM so none of that really counts the Big Stuff downloads. |
| 01:16 | < Reiver> | It means we have to wait 'till tomorrow' for big things, but hell I grew up on broadband I used to put up with 'till next week' :P |
| 01:17 | | gnolam [lenin@Nightstar-202a5047.priv.bahnhof.se] has quit [[NS] Quit: Z?] |
| 01:22 | < sshine_> | you grew up on broadband? |
| 01:22 | | sshine_ is now known as sshine |
| 01:23 | < sshine> | I grew up with 56k and ISDN. |
| 01:24 | <~Vornicus> euler 44. Okay, let's fight with this thing a while. |
| 01:25 | < Reiver> | snrk |
| 01:25 | < Reiver> | s/broadband/dialup |
| 01:25 | < Reiver> | A word so terrifying my brain autocorrected~ |
| 01:26 | | * Reiver grew up with 28.8, but that was mostly the fault of rural dialup sucking. Gorram kids in the city with their fancypants 56k connections... |
| 01:27 | | * Vornicus grew up with 14.4, then got broadband, skipping the 56k |
| 01:27 | < Derakon> | I remember 9.6k being an upgrade. |
| 01:29 | | * Alek got his first internet-capable computer in 99. with a 56k modem. |
| 01:52 | | Kindamoody[zZz] is now known as Kindamoody |
| 01:56 | | Attilla [Obsolete@Nightstar-b8e915be.as43234.net] has quit [Ping timeout: 121 seconds] |
| 02:25 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 02:25 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 03:05 | | Alek [omegaboot@Nightstar-10752b3e.il.comcast.net] has quit [[NS] Quit: ni] |
| 03:30 | | Derakon is now known as Derakon[AFK] |
| 03:43 | | Stalker [Z@Nightstar-3602cf5a.cust.comxnet.dk] has quit [Ping timeout: 121 seconds] |
| 03:46 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 03:46 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 03:54 | | Derakon[AFK] is now known as Derakon |
| 04:11 | | cpux [cpux@Nightstar-c5874a39.dyn.optonline.net] has quit [Ping timeout: 121 seconds] |
| 04:15 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has joined #code |
| 04:25 | | * Vornicus fiddles with various possible thingies. Hm... |
| 04:38 | < Eri> | Eigh~, that's not the stick shift |
| 04:48 | | eckse [eckse@Nightstar-a95b7594.dsl.sentex.ca] has joined #code |
| 05:07 | | * Vornicus baps Eri |
| 05:10 | < Eri> | I realized after the fact that you guys probably don't share the same sense of humour as the guys in DP |
| 05:10 | < Eri> | But it was already too late |
| 05:12 | <~Vornicus> This math, it is not working. |
| 05:13 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 05:14 | <~Vornicus> (I know that I need the smallest pentagonal number n such that there exist a pentagonal number k such that n, n+k, and n+2k are all pentagonal numbers. That's... all the progress i've made.) |
| 05:15 | < Eri> | Project Euler? |
| 05:15 | <~Vornicus> Problem #44. |
| 05:16 | <~Vornicus> My current code is 1. the most spaghetti-tastic code I have ever had the displeasure of seeing in python, never mind that I wrote it, and 2. I don't remember how it works. |
| 05:16 | <~Vornicus> oh, and 3. still really slow. |
| 05:16 | < AnnoDomini> | (Brute Force Everything!) |
| 05:18 | <~Vornicus> That and a knowledge of binary search in an infinite space got me where I am. I am not eager to try that again. |
| 05:21 | | eckse [eckse@Nightstar-a95b7594.dsl.sentex.ca] has quit [Client closed the connection] |
| 05:22 | | eckse [eckse@Nightstar-a95b7594.dsl.sentex.ca] has joined #code |
| 05:46 | | Syloqs-AFH [Syloq@NetworkAdministrator.Nightstar.Net] has quit [Connection closed] |
| 05:47 | | PinkFreud [WhyNot@NetworkAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 05:49 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 05:59 | | Syloqs_AFH [Syloq@NetworkAdministrator.Nightstar.Net] has joined #code |
| 06:00 | | Syloqs_AFH is now known as Syloqs-AFH |
| 06:00 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has quit [[NS] Quit: Leaving] |
| 06:01 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has joined #code |
| 06:03 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 06:05 | | Reivles [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 06:07 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 06:07 | | eckse [eckse@Nightstar-a95b7594.dsl.sentex.ca] has quit [Client closed the connection] |
| 06:08 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 06:09 | | Reivles [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 06:12 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 06:25 | | Syloqs-AFH [Syloq@NetworkAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 06:33 | | Derakon is now known as Derakon[AFK] |
| 06:44 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has quit [Connection closed] |
| 07:06 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 07:06 | < jerith> | http://www.flickr.com/photos/girliemac/sets/72157628409467125/ |
| 07:08 | < jerith> | Vornicus: My solution in Erlang isn't that big. |
| 07:09 | < jerith> | I have a somewhat opaque is_pent() function, though. |
| 07:10 | < jerith> | Vornicus: Also, you may get a speed boost from using pypy instead of cpython. |
| 07:32 | <~Vornicus> 414 wins |
| 07:34 | <~Vornicus> also 500. |
| 07:41 | < jerith> | My solution for 44 only takes about four seconds to run. |
| 07:42 | < jerith> | I don't really follow my solution, but that's possibly because I've forgotten most of my Erlang. |
| 07:42 | <~Vornicus> On mine it is the second longest problem (after the absolutely deadly 60, though I suspect that's more to do with the fact that I'm doing a large number of prime tests instead of seiving and membership...), and I have no fucking idea how my code works at all. |
| 07:45 | <~Vornicus> I'm not sure at the moment how I am to reject a particular n -- I don't see a sensible upper limit on k. |
| 08:01 | < jerith> | Vornicus: Here's my algorithm, if you want to look at it: http://paste.ubuntu.com/769788/ |
| 08:03 | < jerith> | Looks like I reverse the pentagonal number function to solve for N and then check that it's an integer. |
| 08:03 | | Kindamoody is now known as Kindamoody|out |
| 08:03 | < jerith> | Or something. |
| 08:06 | <~Vornicus> I don't understand erlang at all. |
| 08:06 | < jerith> | The syntax is... eclectic. |
| 08:08 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 08:09 | <~Vornicus> hng. No, I don't see how I can limit k for a given n, but obviously I succeeded at it once. |
| 08:09 | <~Vornicus> Why didn't I write comments describing my solution in the first place? |
| 08:12 | < jerith> | Because you're like me? |
| 08:15 | < jerith> | Looks like I generate pentagonal numbersa and keep them in a biggest-first list. |
| 08:17 | < jerith> | I also keep track of the smallest difference I've seen and bail when the smallest possible difference between the next two pentagonal numbers is greater than the smallest I've found. I think. |
| 08:44 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 08:52 | | Attilla [Obsolete@Nightstar-b8e915be.as43234.net] has joined #code |
| 09:06 | < jerith> | Okay, I've deciphered this thing. |
| 09:07 | < jerith> | I track N and P(N), along with all prior pentagonal numbers I've seen. |
| 09:08 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has joined #code |
| 09:08 | < jerith> | For every P(N), I run through the list of prior pentagonal numbers and test whether the sum and difference are pentagonal. |
| 09:10 | < jerith> | If they are, I replace the "smallest matching difference I've seen so far" with the new one. |
| 09:12 | | You're now known as TheWatcher |
| 09:13 | < jerith> | One boundary condition tests whether the difference between the current P(J) and P(K) is greater than the smallest difference I've seen, I bail and move to the next P(N). |
| 09:14 | < jerith> | If the difference between P(N) and P(N-1) is greater than the smallest difference I've seen, there's no possibility of a smaller solution, so I'm done. |
| 09:26 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [Client closed the connection] |
| 09:27 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 09:27 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [Connection reset by peer] |
| 09:29 | | AbuDhabi [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 09:29 | | AbuDhabi [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [[NS] Quit: leaving] |
| 09:29 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 10:03 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 10:08 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 10:42 | | gnolam [lenin@Nightstar-202a5047.priv.bahnhof.se] has joined #code |
| 10:59 | | * TheWatcher eughs, has reached the point where he's relying on his own documentation just to keep this code straight in his head (luckily, it is 30% comment at this point, so) |
| 11:03 | < gnolam> | Perl? |
| 11:03 | < TheWatcher> | yep |
| 11:04 | < TheWatcher> | Just a smidge over 10k lines of it now |
| 11:05 | < TheWatcher> | (across 26 files, I note) |
| 11:49 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 12:07 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 12:07 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has quit [Ping timeout: 121 seconds] |
| 12:08 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has quit [Connection closed] |
| 12:20 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has joined #code |
| 12:45 | | * TheWatcher eyes this email from work about an upcoming workshop; "... The themes of the workshop include program verification, runtime verification, and formal methods in general." |
| 12:46 | < TheWatcher> | Ooh, I better miss that one, I might pass out from all the excitement otherwise. |
| 12:48 | < Lingerance> | Is it titled "how to slow down development"? |
| 12:49 | < TheWatcher> | Alas not. |
| 12:52 | | Lingerance is now known as Ling |
| 12:54 | | Ling is now known as Shoat |
| 13:00 | | Shoat is now known as Ling |
| 13:02 | | Alek [omegaboot@Nightstar-10752b3e.il.comcast.net] has joined #code |
| 13:03 | | Stalker [Z@Nightstar-3602cf5a.cust.comxnet.dk] has joined #code |
| 13:04 | | Kindamoody|out is now known as Kindamoody |
| --- Log closed Wed Dec 14 13:08:00 2011 |
| --- Log opened Wed Dec 14 13:10:41 2011 |
| 13:10 | | TheWatcher [chris@Nightstar-3762b576.co.uk] has joined #code |
| 13:10 | | Irssi: #code: Total of 25 nicks [3 ops, 0 halfops, 0 voices, 22 normal] |
| 13:11 | | Irssi: Join to #code was synced in 39 secs |
| 13:11 | | RichardBarrell [mycatverbs@Nightstar-3b2c2db2.bethere.co.uk] has joined #code |
| 14:03 | <@Namegduf> | TheWatcher: I guess you better start formally proving everything you do! |
| 14:29 | | Kindamoody is now known as Kindamoody|out |
| 14:46 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 14:50 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 15:01 | | PinkFreud [WhyNot@NetworkAdministrator.Nightstar.Net] has joined #code |
| 15:23 | | Kindamoody|out is now known as Kindamoody |
| 15:35 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has quit [Ping timeout: 121 seconds] |
| 15:48 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has joined #code |
| 15:58 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Client closed the connection] |
| 15:59 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 16:05 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 16:15 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 16:38 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 16:44 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 16:45 | < iospace> | i hate Linux serial programming.. |
| 16:48 | | ToxicFrog [ToxicFrog@ServerAdministrator.Nightstar.Net] has joined #code |
| 16:58 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 17:04 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 17:04 | | * Vornicus examines euler44. Okay, that's much easier to understand, but it goes a loooong way to verify the answer. |
| 17:05 | <~Vornicus> oh. it does finish in plenty of time. |
| 17:06 | <~Vornicus> Okay, simple program, just cache the results of pent so it doesn't check the same thing over and over. Daaah. |
| 17:29 | | Derakon [chriswei@Nightstar-f68d7eb4.ca.comcast.net] has joined #code |
| 17:31 | < Derakon> | What was that language that was the recent new hotness? |
| 17:31 | < Derakon> | It wasn't Erlang, was it? |
| 17:38 | < sshine> | Dart? |
| 17:38 | < sshine> | Erlang is a slightly older beauty. |
| 17:40 | < Derakon> | Well, basically what I'm thinking is, I should revisit the Euler problems as an excuse to learn a new language, so the question is, which one? |
| 17:40 | < Derakon> | Given that I know all of the industry standards already, well, excepting Ruby. |
| 17:40 | < Derakon> | And C#. |
| 17:42 | <~Vornicus> Haskell showed up. |
| 17:43 | < Derakon> | Ah, Haskell, that was it. Thanks. |
| 17:43 | | RichardBarrell [mycatverbs@Nightstar-3b2c2db2.bethere.co.uk] has quit [Ping timeout: 121 seconds] |
| 17:43 | < Derakon> | And I could definitely stand to brush up on my functional programming. |
| 17:44 | < Derakon> | Any recommendations for resources for learning it? |
| 17:45 | < Derakon> | Just head to haskell.org and start hitting up links? |
| 17:48 | <~Vornicus> I don't know, really. I started trying to learn it but the stuff I've seen is so basic it didn't feel like I was doing anything, and then I couldn't find an intermediate tutorial that was any good. |
| 17:49 | < sshine> | Derakon, there are two popular books available online: Learn You A Haskell and Real World Haskell. |
| 17:49 | < Derakon> | ..."Learn You A Haskell"? Really? |
| 17:49 | < sshine> | Derakon, my experience is that for university students, LYAH is good in the beginning, and the late chapters in RWH are good as well. |
| 17:49 | < Derakon> | I'm a bit past university these days... |
| 17:50 | < sshine> | well, I preferred the writing style of LYAH, although it irritated me a little that the author is always being funny. I suppose it works for some people. |
| 17:50 | <~Vornicus> But my experience was "Okay, so, the basic haskell stuff goes like this, but you're going to need a lot more tools to actually do anything, and we haven't even showed you show to build an if" |
| 17:50 | < sshine> | yup |
| 17:52 | < sshine> | I recently learned Haskell to some level. I'd used Standard ML for quite a while, so the elementary functional programming stuff that LYAH IMO teaches best wasn't really the issue. learning the standard library for writing little code that does a lot, and learning how to use various combinators for monad and functor composition, that took and still takes some time. |
| 17:53 | < Derakon> | I did some SML back in college, but it's been a long time since then. |
| 17:53 | < sshine> | like... I'd go from constructing my own monad to using the built-in State monad, to using the StateT monad transformer, using do-notation and eventually almost eliminating it by using combinators and higher-order operators. |
| 17:53 | < sshine> | ok |
| 17:54 | < sshine> | much of the essential FP is just like in SML, except for laziness and some advanced type-theoretic differences I don't fully understand. |
| 17:54 | <~Vornicus> I've never used a functional language. |
| 17:55 | < sshine> | just laziness alone changes a lot of strategies on how you'd solve stuff, but I think the online books demonstrate it with simple examples. abstracting it to larger examples is something I've searched a little more for. |
| 17:55 | < Derakon> | Hunh, I would've thought you'd be all over them, Vorn. |
| 17:55 | < Derakon> | They can be quite elegant. |
| 17:55 | < sshine> | Vornicus, not learned one as part of education, either? |
| 17:55 | | * sshine has never used C++. |
| 17:55 | < Derakon> | Have you used C? |
| 17:55 | <~Vornicus> sshine: The only 200-level compsci course I've taken is data structures. |
| 17:56 | < sshine> | Derakon, yeah. |
| 17:56 | < Derakon> | C++ is C with more complicated structs and several massive and useful libraries, more or less. |
| 17:56 | < Derakon> | Grossly oversimplifying, mind you. |
| 17:56 | < sshine> | Derakon, I prefer to think of C++ as this over-complicated OO abstraction. |
| 17:58 | <~Vornicus> I'd like to be all over them, but my experience so far has been much like haskell's: I have the very bare-bones basics and then I have to run to the references that I don't know how they're organized or even what half the symbols mean. |
| 17:58 | < sshine> | isn't there something about the C standard being renewed with a larger standard library? |
| 17:58 | | * Derakon must duck out a bit. |
| 17:58 | <~Vornicus> In contrast, by the time I finished the Python tutorial I had the entire syntax in my head. |
| 17:59 | < sshine> | Vornicus, yup. for Haskell the syntax isn't the hard part. |
| 17:59 | < sshine> | I learned a lot about writing compressed Haskell code when doing parser generators for a course |
| 18:02 | < sshine> | like... I'd start with something like: foo = do { c <- cmd; e <- expr; return (Cmd c e) } <|> do { decl; v <- var; e <- expr; return (Decl v e) } |
| 18:03 | < sshine> | and then I'd optimize it to: foo = (liftM Cmd cmd expr) <|> (decl >> liftM Decl var expr) |
| 18:05 | < sshine> | and now I think I'd write it as: foo = (Cmd <$> cmd <*> expr) <|> (Decl <$> (decl >> var) <$> expr) |
| 18:05 | < sshine> | oops, liftM2 |
| 18:06 | < sshine> | the moment a pattern of function application becomes something that everyone does, someone writes a function or an operator to abstract it. |
| 18:07 | < sshine> | like... do { x <- get; let y = f x; put y; return () } to change the internal state of a monad can also be done like... modify f |
| 18:11 | < sshine> | there's lots of really nice syntax sugar in Haskell. |
| 18:11 | < sshine> | since all operators are functions, you can partially apply them |
| 18:13 | < sshine> | and the syntax for doing so is very nice: (/) is a function that takes two curried arguments and divides one by another, (2 /) is synonymous to (\x -> 2 / x) and (/ 2) is synonymous to (\x -> x / 2). |
| 18:14 | < sshine> | so you can do: map (** 2) somelist, whereas in Standard ML you have to do: map (fn x => x ** 2) somelist |
| 18:16 | < sshine> | one of my friends at university often uses SML operators \< and \> to partially apply a function that takes a tuple by inserting a value in one of the fields. |
| 18:16 | < sshine> | fun f \< x = fn y => f (x, y) |
| 18:16 | < sshine> | fun f \> y = fn x => f (x, y) |
| 18:17 | < sshine> | but it's not as elegant. |
| 18:17 | <~Vornicus> Okay that there you've lost me |
| 18:17 | <~Vornicus> WHat is the difference between those two |
| 18:18 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 18:19 | <~Vornicus> or rather, what the hell just happened. |
| 18:19 | < sshine> | well, if you wanna square all numbers in a list, map (** 2) somelist will do that. |
| 18:20 | < sshine> | in Standard ML, map (op** \> 2) somelist could do it as well. |
| 18:21 | < sshine> | in Haskell they decided that a certain subset of characters are always infix operators |
| 18:21 | <~Vornicus> --and the other would be like, powers of two. |
| 18:22 | < sshine> | yup |
| 18:22 | <~Vornicus> So the first one, given a function f(a,b) and a value y, it gives f_y(a) = f(a,y). |
| 18:23 | < sshine> | yup |
| 18:23 | < Derakon> | Wait, are we in SML or Haskell now? |
| 18:23 | < sshine> | I used SML syntax, but you could define the operator in either language. only Haskell has syntax sugar for it that looks nicer already. |
| 18:25 | < sshine> | I don't know if any other language than Haskell does this: /[:!#$%&*+./<=>?@\\^|~-]+/ are infix operators, and they behave like nonfix when enclosed in parenthesis. |
| 18:26 | | * Derakon installs Haskell, tries to run it, gets a dyld error. |
| 18:26 | < sshine> | what's dyld? |
| 18:27 | < Derakon> | Dynamic library load, I think. |
| 18:27 | | * sshine is contemplating moving away from Arch Linux. |
| 18:27 | < sshine> | ugh |
| 18:27 | < Derakon> | "dyld: unknown required load command 0x800000022" |
| 18:27 | < sshine> | do you use a package manager? |
| 18:28 | < Derakon> | I used the OSX installer. |
| 18:28 | < sshine> | oh. I never tried that. |
| 18:31 | | Kindamoody is now known as Kindamoody[zZz] |
| 18:37 | < Derakon> | So, so much for Haskell I guess. |
| 18:38 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 18:44 | < iospace> | sshine: i usually use arch for a linux distro :P |
| 18:47 | | * sshine had this weird idea of installing Mono and a C# compiler the other day. |
| 18:48 | < sshine> | iospace, so do I, but I find some aspects a bit tedious. |
| 18:48 | < iospace> | like what? |
| 18:48 | < sshine> | iospace, running release requires me to update so often. |
| 18:49 | < sshine> | iospace, things are generally not working until I manually set them up. like IPP for printing. |
| 18:49 | < iospace> | ah |
| 18:49 | < sshine> | iospace, python3 is the default, so much of my python crap that I rarely touch doesn't work out of the box unless I use virtualenv or something. |
| 18:50 | < iospace> | heh |
| 18:53 | | * AnnoDomini wonders: is it possible to change flash rendering quality in Linux? Especially in Opera. |
| 18:59 | < sshine> | AnnoDomini, right-click on the applet should give you a menu, assuming you use Adobe's flash? |
| 19:01 | < AnnoDomini> | Yes, I see the quality gauge when I rclick on YT videos. |
| 19:01 | < AnnoDomini> | (Submenu, not gauge.) |
| 19:01 | < AnnoDomini> | WTF. This wasn't there before. |
| 19:02 | < AnnoDomini> | Previously, trying to rclick on a flash game gave me something completely different. |
| 19:07 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 19:12 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 19:13 | <~Vornicus> and the straightforward method, with caching of results, takes 36 seconds and has a 1.8M element set. |
| 19:14 | < iospace> | sshine: we actually use gentoo here |
| 19:14 | < iospace> | (where i work) |
| 19:16 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [Client closed the connection] |
| 19:17 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 19:17 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [Connection reset by peer] |
| 19:18 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has joined #code |
| 19:18 | | AnnoDomini [annodomini@Nightstar-4ea39ceb.212.getinternet.no] has quit [Connection reset by peer] |
| 19:19 | | AnnoDomini [annodomini@Nightstar-7772b630.84-49-12.nextgentel.com] has joined #code |
| 19:19 | < sshine> | iospace, they use gentoo on the university computers as well, but they've got system administrators who care to maintain a system, unlike I do. ;-) |
| 19:20 | < iospace> | :P |
| 19:41 | < iospace> | actually our linux releases are gentoo based |
| 20:05 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 20:09 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 20:29 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 20:34 | | Red_Queen [Z@Nightstar-3602cf5a.cust.comxnet.dk] has joined #code |
| 20:35 | | Attilla_ [Obsolete@Nightstar-ee112cec.as43234.net] has joined #code |
| 20:35 | | Red_Queen [Z@Nightstar-3602cf5a.cust.comxnet.dk] has quit [[NS] Quit: Into the hole again, we hurried along our way, into a once-glorious garden now seeped in dark decay.] |
| 20:36 | | Attilla [Obsolete@Nightstar-b8e915be.as43234.net] has quit [Ping timeout: 121 seconds] |
| 20:37 | | Attilla_ is now known as Attilla |
| 20:41 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 20:57 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has quit [Ping timeout: 121 seconds] |
| 21:09 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has joined #code |
| 21:26 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 21:26 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 21:48 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 21:53 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 21:54 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has quit [Ping timeout: 121 seconds] |
| 22:03 | | * Vornicus finishes adding descriptive comments to euler problems 41-50, discovers that project euler is down so he can't get the problem descriptions of 51-60. |
| 22:06 | < Derakon> | What's all this in aid of, anyway? |
| 22:07 | | Eri [Eri@Nightstar-3e5deec3.gv.shawcable.net] has joined #code |
| 22:08 | <~Vornicus> I want my project euler solutions to have the problem statements and a description of how I got there. |
| 22:08 | <~Vornicus> er, how I got to the solution. |
| 22:09 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has quit [Ping timeout: 121 seconds] |
| 22:09 | | Reiver [orthianz@3CF3A5.E1CD01.C6689C.33956A] has joined #code |
| 22:09 | < AnnoDomini> | "The problem involves lots of calculation. I used a pay-per-minute computing cluster to brute-force this." (:V) |
| 22:14 | <~Vornicus> Some of them are pretty obvious: "the last ten digits of sum(k**k for k in range(1,1001)" for instance is a one liner, where the solution looks exactly like the problem statement. However, some are totally befuddling; see 137, where the problem looks nothing at all like the solution: I've got an infinite power series and I need to find rational inputs that would give integer outputs, and I have |
| 22:14 | <~Vornicus> three tiny calculations, none of which look like the original power series. |
| 22:27 | < Derakon> | Heh. |
| 22:27 | < Derakon> | Sounds like you did a proof in the margin somewhere and then recycled the paper in question. |
| 22:31 | | Stalker [Z@Nightstar-3602cf5a.cust.comxnet.dk] has quit [[NS] Quit: Into the hole again, we hurried along our way, into a once-glorious garden now seeped in dark decay.] |
| 22:34 | <~Vornicus> Well, in that case I know what I did: I built the generating funciton for the power series and figured out how it falls together. |
| 22:35 | < jerith> | Did you figure out your p44? |
| 22:37 | < Derakon> | I should probably review my solutions at some point. Or re-do them. |
| 22:38 | < Derakon> | I kinda feel like my skills are stagnating, which is why I was looking into learning Haskell earlier. |
| 22:38 | <~Vornicus> I scrapped what I had and went to a very simple solution where the only interesting thing I did was cache the known pentagonal numbers in a set for easy checking. |
| 22:38 | | * jerith is looking into writing a language using the pypy stack. |
| 22:39 | < jerith> | And I might write one optimised for solving pe problems. |
| 22:39 | <~Vornicus> this avoids calling int(depentagon(x)) = depentagon(x) |
| 22:40 | <~Vornicus> (well, properly spelled out, because python doesn't recognize a const function when it sees it, and won't optimize that to one call) |
| 22:40 | < jerith> | pypy will, if you tell the JIT. |
| 22:44 | <~Vornicus> So I only ever call depentagon once for each k, replacing nearly every call to it with a set.__contains__ |
| 22:47 | | Stalker [Z@Nightstar-3602cf5a.cust.comxnet.dk] has joined #code |
| 22:50 | | AnnoDomini [annodomini@Nightstar-7772b630.84-49-12.nextgentel.com] has quit [[NS] Quit: leaving] |
| 23:03 | | * Vornicus pokes the pe guys. c'mon, fix yer shit |
| 23:04 | < Derakon> | How dare they not keep their free CS/math-nerd entertainment online~ |
| 23:04 | <~Vornicus> Exactly~ |
| 23:26 | < Derakon> | Hm, I appear to have signed myself up to completely rework how combat is done in Angband. |
| 23:26 | < Derakon> | Me and my big mouth. |
| 23:26 | <~Vornicus> You fool |
| 23:27 | < McMartin> | wate wut |
| 23:27 | < Derakon> | I theorycrafted a new system that would rather neatly do away with several annoying quirks (most notably, that the first thing your hulking fighter wants to do as soon as he enters town is go buy the smallest weapon he can find). |
| 23:27 | < Derakon> | Then I expounded on the theory in more detail. |
| 23:28 | < Derakon> | That was a mistake, clearly~ |
| 23:28 | < McMartin> | OK, I'm curious about the theorycraft behind that particular quirk. |
| 23:28 | < Derakon> | That quirk comes from the calculations that drive the number of attacks you get each round, which is f(strength, dexterity, weapon weight). |
| 23:29 | < Derakon> | That and how much damage you deal, which is (dice roll + damage bonuses). |
| 23:29 | < McMartin> | So more attacks beats out all else, so lightest weapons is the most important thing |
| 23:29 | | cpux [cpux@Nightstar-c5874a39.dyn.optonline.net] has joined #code |
| 23:29 | < Derakon> | So if your STR gives you +2 to damage and you get 3 blows per round with a 1d4 dagger, then you're looking at 3d4+6 damage...vs, say, 2d5+2 for a longsword. |
| 23:29 | < Derakon> | Yeah. |
| 23:30 | < Derakon> | This issue sticks around until you get the stats to get multiple blows even with the heavier weapons, or unless you start with bad enough stats that you can't get multiple blows even with daggers. |
| 23:30 | < Derakon> | Though in the latter case, it just gets delayed until you pump your stats up. |
| 23:30 | < Derakon> | (Still, I had a hobbit paladin wandering around swinging a gigantic maul for awhile because his 16 STR was too puny to multistrike with light weapons) |
| 23:31 | < Derakon> | So the new theory is that you get "finesse" from DEX, "power" from STR, and each weapon has a multiplier for same. E.g. a dagger would be .8 finesse and .2 power. |
| 23:31 | < Derakon> | Multiply your finesse and power scores by the value on the weapon. |
| 23:32 | < Derakon> | For finesse, that tells you how many blows you get (plus the default 1 blow). |
| 23:32 | < Derakon> | For power, that tells you how much extra damage you deal. |
| 23:32 | < Derakon> | So with that dagger and scores of 200 finesse / 200 power, you'd get (200 * .8 = 1.6) + 1 = 2.6 blows/round. |
| 23:32 | < Derakon> | And each blow would deal (200 * .2 = .4) + 1 = 1.4x the dice damage. |
| 23:55 | | * Vornicus pokes the internet. project euler is the only site he can't reach in his usual trawl, and downforeveryoneorjustme.com says it's up. |
| 23:58 | < Derakon> | I tried loading it earlier and couldn't. |
| 23:58 | <~Vornicus> wtfx |
| 23:58 | < TheWatcher> | Not working for me, either |
| 23:59 | < Derakon> | DfEoJM presumably doesn't have any kind of distributed check; it's just a third-party that can ping the site in question. |
| --- Log closed Thu Dec 15 00:00:17 2011 |