00:21:48 -!- puzzlet has quit (Remote closed the connection). 00:21:50 -!- puzzlet_ has joined. 00:31:04 -!- pikhq has joined. 01:22:47 -!- Sgeo has quit (Connection timed out). 01:26:31 -!- faxathisia has quit (Connection reset by peer). 01:45:19 -!- faxathisia has joined. 01:54:00 -!- puzzlet has joined. 01:54:00 -!- puzzlet_ has quit (Remote closed the connection). 02:07:49 -!- puzzlet_ has joined. 02:07:49 -!- puzzlet has quit (Remote closed the connection). 03:04:04 -!- ihope has quit (Read error: 110 (Connection timed out)). 03:05:06 -!- oerjan has joined. 03:13:30 hey oerjan :D 03:14:12 my idea worked by 03:14:14 the way, http://rafb.net/p/j1qfFS49.txt 03:14:32 I can reverse life using minesweeper.. but I think I shall rewrite it so it runs faster 03:15:07 (the rube goldberg method) 03:15:15 It be oerjan. 03:15:24 oh it surely should work in principle, the point about NP-complete problems is that you _can_ reduce them to each other :) 03:15:50 You can. . . Reverse the Game of Life? 03:15:54 I didn't know that running game of life backwards is NP complete :p 03:15:58 although 1 step of life probably isn't NP-complete 03:16:12 * pikhq hands you a Garden of Eden position. 03:16:16 Reverse it. I dare you. 03:16:18 pikhq: I get a list of zero 03:16:20 :p 03:16:24 although I haven't tried any of those 03:16:35 we are talking about reversing to a set, of course 03:16:43 (possibly non-empty) 03:17:31 hmmm 03:17:37 I think I should try actually reversing it directly 03:17:42 instead of this stupid roundabout method :p 03:18:02 (though I'm not sure how to do that) 03:18:37 constraint solving is the keyword to look for i think 03:18:52 I'm reading about ECLiPSe now 03:19:03 seems amazing 03:19:50 i would not be surprised if running n steps backwards of GOL is NP-complete though 03:20:18 in fact, it almost surely is 03:20:27 what about 1 step? 03:20:34 I mean why do you say, n steps specifically? 03:20:55 i mean that you may need to have n on the order of the board size 03:21:18 because 1 step may not intertwine far-away parts 03:21:43 otoh it _might_, if there is a graph problem like 3-coloring encodable in just one step 03:22:06 ok, 1 step may or may not be NP-complete 03:22:18 :D 03:22:31 here's something I want to find out 03:24:23 -!- immibis has joined. 03:47:40 the esolangs.org wiki keeps giving me this error: http://pastebin.ca/801283 03:51:05 i'm getting it fine 03:51:51 mind you it has had errors in the past 03:52:46 it gives me that error quite often and it always works when i refresh it. 03:54:40 yeah I see that error a lot 03:54:45 sometimes goes away when you reload 04:34:38 -!- lament has joined. 04:34:48 oh man, you just reminded me about this channel 04:34:52 ayeeh 04:35:05 It's Lament's Laments! 04:35:22 hrr hrr 04:47:53 har de har har 04:48:10 if stephen hawking were here he would be laughing his ass off at that play on words 05:01:26 i would say that's a grey view of it 05:19:24 -!- puzzlet has joined. 05:25:48 * immibis found two ways to open the root of the C: drive and two ways to get to a command prompt (both of which are disabled) in his school network. 05:26:09 i mean, disabled = not supposed to be able to do it 05:29:36 -!- puzzlet_ has quit (Read error: 110 (Connection timed out)). 05:31:06 Cute. 05:31:15 (I've done the same. Not too difficult) 05:38:08 shortcuts and batch files have something to do with it. i won't tell you the rest in case you know people who go to that school. 05:45:38 -!- puzzlet has quit (Read error: 104 (Connection reset by peer)). 05:46:43 -!- puzzlet has joined. 05:46:49 -!- puzzlet has quit (Read error: 104 (Connection reset by peer)). 05:51:47 -!- puzzlet has joined. 05:55:00 -!- oerjan has quit ("Coffee (and brownie?)"). 06:08:27 -!- faxathisia has quit. 06:11:40 -!- puzzlet has quit (Remote closed the connection). 06:11:42 -!- puzzlet_ has joined. 07:40:43 * immibis waits patiently 07:49:22 -!- immibis has quit ("Hi Im a qit msg virus. Pls rplce ur old qit msg wit tis 1 & hlp me tk ovr th wrld of IRC. Clap on! , Clap off! Clap@#&$NO CAR). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:11:06 -!- puzzlet has joined. 08:21:19 -!- puzzlet_ has quit (Read error: 110 (Connection timed out)). 09:37:53 -!- jix has joined. 09:44:49 -!- clayrat has joined. 10:10:16 -!- Jontte has joined. 10:14:52 -!- Jontte has quit (Client Quit). 13:04:29 -!- oerjan has joined. 13:20:53 -!- tola has joined. 13:21:10 -!- tola has left (?). 13:23:56 -!- Sgeo has joined. 13:32:04 -!- SEO_DUDE has joined. 14:10:04 -!- maristo has joined. 14:10:18 -!- maristo has left (?). 14:12:32 http://www.vjn.fi/pb/p354454544.txt making a language for programming labyrinth explorers, i guess 14:13:19 made pattern matching first-class, as demonstrated in that code (creation of an Idle pattern inside Enter) 14:14:27 once again i've polluted the language with so much syntax and "intelligence", i'll prolly not manage to implement it. 14:14:39 but it's nice to code in 14:16:09 the program running the labyrinth explorers should send an Idle message at least a few times a second, enter should be sent after a move, and so on 14:17:04 if a (Move Direction)-pattern is returned, the guy should be moved to given direction 14:21:12 hmm 14:21:46 so its like the guy moves according to language restrictions and the programmer supplies the maze? 14:24:12 well, the language has nothing to do with labyrinths, it's just made for creating AI's for exploring labyrinths 14:24:58 if Move [1 0] is returned, the guy will move east, but that is just convention 14:25:25 the labyrinth is external to the labyrinth, and will be supplied in a different program 14:27:16 basically, a guy will get messages like [Enter [room coords]] and [Idle 5.09], and may return a message like [Move [0 -1]] or [Commit Suicide] 14:27:49 [EatenBy Grue] 14:28:05 -!- RedDak has joined. 14:29:40 a guy would prolly not be told he's been eaten, since being eaten is lethal, though 14:29:54 that though was a bit out of place 14:30:23 (a guy would prolly not be told he's been eaten, since being eaten is lethal), though 14:30:43 hmm... that doesn't work either... 14:30:53 [Enter BrightTunnelOfLight] 14:31:48 so... first-class pattern matching, is that a new idea? 14:32:28 i've been trying to come up with something new for ages, i just always later find out it's already been come up with 14:32:42 i guess that happens to everyone 14:33:10 probably not new 14:33:56 well, there's only a thin line between that and just having... well, variables 14:34:15 that's a bit like a generalization of 'em 14:34:21 first-class patterns is one of the things some people would like in haskell but which they never agree on the precise syntax and semantics for 14:34:30 oh 14:34:46 i don't just have them first-class, i also have them mutable, btw :) 14:34:51 also, views 14:34:56 as you can *clearly* see in the code 14:35:03 well haskell usually does not do that :) 14:35:07 views? 14:35:12 yes, that's why i meantioned it 14:35:18 meanaem 14:35:35 (palindrome not intended.) 14:35:41 views are like definable pattern matching 14:36:06 hmm, interesting, wanna enlighten me about them? 14:36:07 since ordinary haskell only has the patterns that come with each data type definition 14:36:27 yeah 14:36:38 err umm 14:36:44 and... function definition? 14:37:01 but sometimes you would like to define some pattern matching that is not just the internal data representation 14:37:37 function definitions don't define new pattern types, they only use those already defined 14:38:29 for example the Data.Sequence module defines |> and <| patterns iirc to match only the left or right end of a sequence 14:39:20 but because haskell does not have views you need to apply a function to a Seq to make it into the data type that has the pattern 14:39:41 ah, i now realize what is confusing me is i do not know how to make new patterns in haskell. 14:39:45 :P 14:40:21 in haskell each data type defines new constructors that automatically give both a constructing function and a deconstructing pattern 14:40:28 oh 14:40:33 like x:xs is 14:40:40 yep 14:41:12 that's so awesome i wanna cry 14:41:16 well 14:41:21 not that awesome, but quite. 14:42:18 hmmmm 14:42:38 however if the data structure is abstract and you don't want to expose its _real_ constructors (like with Sequence which is internally a kind of tree), then haskell gives you no way of defining a different set of patterns directly on that data type 14:43:04 i see 14:43:07 so you instead must do something like 14:43:34 case viewl seq of x :< rest -> ... 14:43:45 sad :< 14:44:31 what's viewl? 14:44:43 viewl :: Seq a -> ViewL a 14:45:15 it take a sequence and turns into the ViewL data type for which :< is a constructor 14:45:19 *takes 14:46:02 so it's a hack around the fact you cannot define the :< pattern directly on Seq a 14:47:06 there is also viewr and :> for the other end 14:47:18 nice :> 14:47:49 happy code 14:48:49 i'd like to start implementing, but i need to leave in an hour anyway 14:48:53 * oklopol is not happy 14:51:36 bad event upcoming? 14:55:34 -!- Jontte has joined. 14:55:50 -!- Jontte has quit (Remote closed the connection). 15:14:15 it's relatively nice for an event, it's just i generally dislike events. 15:14:28 band practise 15:15:00 um, why are you in a band if you don't like it :D 15:15:48 i like being in a band, and i like practising, i just don't like going to the practise 15:15:54 the same thing with school 15:16:02 except that some classes are very boring 15:17:39 same thing with anything really, i hate going out, would prefer just sitting here 15:18:55 wonder if i could retire when i turn 19... 15:20:30 * oerjan wants to protest but is too lazy himself... 15:21:06 hmm, what exactly do you wanna protest? 15:22:25 your apparent desire to physically isolate yourself 15:24:01 well, actually, i have nothing against going places, what i dislike is having to go somewhere 15:24:10 that better= 15:24:11 ? 15:24:52 i suppose so :) 15:24:57 usually, if someone spontaneously asks me to take a 10 hours walk with them, i say yes 15:25:27 this is not as rare as you might think, given my circle of friends 15:26:22 wonder if "circle of friends" is correct 15:26:31 i think so 15:27:15 sounds right to me, but i always get a bit paranoid when i realize a saying is the exact same in Finnish 15:27:30 had to uppercase it because i seem to have a typing checker in this client 15:30:05 also, i think finland has the greatest people-here/overall-population -rate 15:30:33 ? 15:31:00 fiz, me and jontte, who i now realize isn't here anymore 15:31:11 oh on the channel 15:31:36 yep 15:32:14 some wicked little voice in my head said "yeah, they all sit in their forest huts drinking and no one ever travels" 15:32:17 a friend of mine has been meaning to start regularing here, but he's too lazy to put the chan on autojoin 15:32:21 that would make 4 :\ 15:33:04 (interpreting here=in-finland) 15:33:21 -!- Sgeo has quit (Read error: 110 (Connection timed out)). 15:34:22 well, finland definately has the greatest people-in-finland/overall-population-in-finland rate 15:34:33 definitely 15:34:54 ah yes indeed 15:35:11 then again, so does any other country. 15:36:37 i am not so sure, there are some countries that have more immigrants than natives 15:37:11 Qatar i think 15:37:13 -!- Tritonio_ has joined. 15:37:40 yes, unfortunately those countries still have the same people-in-finland/overall-population-in-finland rate 15:37:48 (haw haw) 15:38:15 hey wait a minute 15:38:30 constant functions are no fun 15:39:17 sure they are 15:39:20 i interpreted people-in-finland as people from that country in finland 15:39:22 didn't your see my haws? 15:40:55 well, out of finland's population, over 50% is finns, so finland's rate would still be the greatest. 15:41:31 english's lambda support is pretty bad :\ 15:47:51 -!- RedDak has quit (Remote closed the connection). 16:16:04 -!- sebbu has joined. 17:53:23 -!- Tritonio_ has quit (Read error: 104 (Connection reset by peer)). 17:53:35 -!- puzzlet has quit (Remote closed the connection). 17:53:37 -!- puzzlet_ has joined. 17:54:10 -!- Tritonio_ has joined. 18:09:14 -!- oerjan has quit ("No, more madness!"). 18:12:34 -!- sebbu2 has joined. 18:31:49 -!- faxathisia has joined. 18:39:26 -!- sebbu has quit (Connection timed out). 18:53:30 -!- SEO_DUDE has quit (Read error: 104 (Connection reset by peer)). 19:12:34 -!- SEO_DUDE has joined. 19:15:43 -!- Slereah has quit (Read error: 110 (Connection timed out)). 19:48:10 -!- Tritonio_ has quit (Remote closed the connection). 20:01:58 -!- puzzlet_ has quit (Remote closed the connection). 20:01:59 -!- puzzlet has joined. 20:11:52 -!- UnrelatedToQaz has joined. 20:16:06 -!- RedDak has joined. 20:18:37 -!- jix has quit (Read error: 104 (Connection reset by peer)). 20:27:20 -!- jix has joined. 20:43:48 -!- UnrelatedToQaz has quit ("ChatZilla 0.9.79 [Firefox 2.0.0.10/2007111504]"). 21:44:10 -!- Jontte has joined. 21:53:38 geh 21:53:41 my wine is smelling 21:56:42 ... or does it have an ODOR? 21:58:06 yes 21:58:19 :) 22:00:15 -!- jix has quit ("CommandQ"). 22:23:29 :( 22:27:26 the world is a sad place 22:27:48 one problem with band practise is the other guys don't really have a life outside the band 22:27:50 very 22:27:59 life as in need to code and irc 22:31:20 (regarding the fact i was gone for well over 6 hours) 22:41:16 -!- Sgeo has joined. 22:41:19 -!- RedDak has quit (Remote closed the connection). 22:54:04 -!- ihope_ has joined. 22:55:19 -!- BoredCollegeGuy has joined. 22:57:23 Please find the greatest contiguous sum of the following sequence: -1, 2, -3, 2, 0, 5, -11 22:57:26 -!- Tritonio_ has joined. 22:58:08 7, I'd say. 22:58:43 2 and 2, 0, 5 are the only "islands" of positive. You can include one or the other, or you can include both. Including just 2, 0 and 5 gives you a higher sum than including both. 23:01:55 yeah it's 7 23:10:00 is that general problem NP-complete? 23:10:24 no wait, i guess there's no way it could be 23:10:25 I think so yes.. 23:10:30 really? why? 23:10:33 well it's NP complete for rectangles 23:10:35 I think I read that.. 23:10:52 rectangles? 23:11:06 if you have a matrix of numbers what's the submatrix with biggest tota 23:11:12 l 23:12:16 if you brute-force the one-dimensional version, isn't it O(n^2)? 23:12:32 greatest contiguous sum can be solved in O(n) 23:12:59 no wonder you're a bored college guy, you need a more interesting problem 23:13:16 do I? 23:14:08 http://acm.uva.es/problemset/v1/108.html 23:14:57 is maximal sub-rectangle NP complete? :( 23:16:08 dunno. I just had my 4th day of theory of comp this morning. 23:16:10 well, to brute force it, you'd have to try rectangles starting at each of n*m origins 23:17:07 ok it's certainly NP hard 23:17:13 I guess it's not NP complete 23:17:27 and I'm wrong http://en.wikipedia.org/wiki/Subset_sum_problem 23:18:24 wait. but then, from each origin at column a, row b, you have to try rectangles with each of (n-a+1) widths and (m-b+1) heights, so (n-a+1)*(m-b+1) rectangles 23:18:34 so it's O(n^2m^2), no? 23:18:37 at worst? 23:26:26 Yeah, seems so. 23:28:28 A problem that's in P is in NP if and only if P = NP. 23:59:58 -!- Corun has joined.