00:00:10 The "Pickle" card can be played as a minor or as a major, depending on circumstances. 00:03:35 The player with the Title card must lead that card on the first turn at the beginning of the game (unless nobody has that card in case it is a face-down hidden card in the center of the table). 00:08:42 can you write up the full rules? 00:09:21 why is lambdabot in #esoteric? 00:09:26 Unfortunately I never have. I have never actually thought of the full rules, but I have thought of many ideas, a few of which I forget. 00:10:16 Although I did remember a few things of my ideas, and possibly even have new ideas I can write here. Other people can also make up ideas, since it is incomplete. 00:11:28 You score by the first trick, the last trick, sequences, and by taking tricks containing "rulers". 00:12:07 You must follow suit if possible, and sometimes follow ranks. 00:12:47 Majors beat minors (and miscellaneous suited cards), metas beat everything. However, some majors and metas have special powers. 00:13:04 -!- elliott_ has quit (Ping timeout: 260 seconds). 00:13:51 (The card with instructions for divinations is used too in this game, although after playing this game you cannot use the deck for divination since the divination rules require that the deck is never shuffled.) 00:14:23 @pl \x -> (x,x) 00:14:23 join (,) 00:15:20 @t join 00:15:20 Maybe you meant: tell thank you thanks thx ticker time todo todo-add todo-delete topic-cons topic-init topic-null topic-snoc topic-tail topic-tell type . ? @ ft v 00:15:27 @type join 00:15:28 forall (m :: * -> *) a. (Monad m) => m (m a) -> m a 00:15:43 -!- augur has quit (Remote host closed the connection). 00:15:55 -!- augur has joined. 00:20:35 i forgot how the function monad instance works 00:30:51 @pl (\x -> map (\y -> (tick*x, tick*y)) [-half..half]) 00:30:52 (line 1, column 37): 00:30:52 unexpected "[" 00:30:52 expecting variable, "(", operator or ")" 00:31:13 @pl \x -> map (\y -> (tick*x, tick*y)) [-half..half] 00:31:14 (line 1, column 36): 00:31:14 unexpected "[" 00:31:14 expecting variable, "(", operator or end of input 00:31:16 :( 00:31:32 @pl \x -> map (\y -> (tick*x, tick*y)) 00:31:33 map . (. (tick *)) . (,) . (tick *) 00:31:39 ok yeah not replacing that 00:31:55 @pl \x -> map (\y -> (tick*x, tick*y)) [negate half .. half] 00:31:56 flip map [negate half..half] . (. (tick *)) . (,) . (tick *) 00:32:01 * Lymee reaches for a barf bag 00:32:13 @pl \x -> map (\y -> (tick*x, tick*y)) (enumFromTo (-half) half) 00:32:14 flip map [negate half..half] . (. (tick *)) . (,) . (tick *) 00:33:51 \x -> map (\y -> (tick*x, tick*y)) = map . (join (***) (tick *) .) . (,) 00:35:33 barf barf barf 00:36:30 I'd write that as \x -> map (join (***) (tick*) . (,) x), or (x,) with -XTupleSections, or with both = join (***) defined somewhere 00:37:40 Or \x -> let tx = tick*x in map ((tx,) . (tick*)) 00:40:13 -!- FireFly has quit (Quit: swatted to death). 00:44:22 -!- esowiki has joined. 00:44:43 -!- esowiki has joined. 00:45:04 -!- esowiki has joined. 00:45:41 -!- esowiki has joined. 00:46:31 -!- esowiki has joined. 00:47:29 -!- esowiki has joined. 00:48:13 -!- esowiki has joined. 00:48:57 -!- esowiki has joined. 00:49:41 -!- esowiki has joined. 00:50:21 -!- esowiki has joined. 00:51:01 -!- esowiki has joined. 00:51:46 -!- esowiki has joined. 00:52:24 -!- esowiki has joined. 00:52:24 -!- glogbot has joined. 00:53:47 why is lambdabot in #esoteric? <-- because we asked nicely (well i assume it was nicely) 01:00:06 :t (*) `on` recip 01:00:07 forall a. (Fractional a) => a -> a -> a 01:00:31 @hoogle Fractional -> Integral 01:00:31 Warning: Unknown type Fractional 01:00:31 Unsafe.Coerce unsafeCoerce :: a -> b 01:00:31 Prelude ($) :: (a -> b) -> a -> b 01:00:46 @src Double 01:00:46 data Double = D# Double# 01:00:49 Lymee: floor, ceiling, round 01:00:54 I see. 01:01:07 :t floor 01:01:07 forall a b. (RealFrac a, Integral b) => a -> b 01:01:15 Hmm 01:01:20 fractional can be e.g. complex 01:01:20 I wanna be a Devil's Advocate 01:02:23 @pl \x -> map (\y -> (tick*x, tick*y)) [ -half..half] 01:02:23 (line 1, column 36): 01:02:23 unexpected "[" 01:02:23 expecting variable, "(", operator or end of input 01:02:28 huh 01:03:06 weird broken parser 01:03:15 (given that it accepts it without - 01:03:17 ) 01:17:56 Sgeo: Why do you want to be Devil's Advocate? 01:18:18 I've boredly given some thought to what I consider an inane position 01:18:38 I think I can make it "work" fsvo "work" 01:41:33 Bleh. 01:41:41 I'm doing the Mandelbrot set with this: length $ takeWhile ((<2) . magnitude) $ take maxIters $ iterate step $ 0.0 :+ 0.0 01:41:45 Can't figure out any optimizations. 01:41:58 Anybody have any ideas? =w= 01:41:58 Oh! 01:42:19 Um, no wait, can't do that. 01:42:29 Lymee: magnitude is somewhat expensive as it requires a square root 01:43:08 @hoogle Complex a -> a 01:43:08 Data.Complex imagPart :: RealFloat a => Complex a -> a 01:43:08 Data.Complex magnitude :: RealFloat a => Complex a -> a 01:43:08 Data.Complex phase :: RealFloat a => Complex a -> a 01:44:55 :t \(a :+ b) -> a*a + b*b < 4) 01:44:56 parse error on input `)' 01:44:57 er 01:45:00 :t \(a :+ b) -> a*a + b*b < 4 01:45:01 forall t. (RealFloat t) => Complex t -> Bool 01:45:08 that might be better 01:46:12 also perhaps findIndex is more efficient than length $ takeWhile ... 01:46:22 :t findIndex 01:46:22 forall a. (a -> Bool) -> [a] -> Maybe Int 01:46:53 (then again, maybe not) 01:47:52 and it all depends on ghc's list fusion being able to optimize away the intermediate lists 01:52:12 @pl \x -> ((double $ imagPart x) + (double $ realPart x)) < 4 01:52:12 (< 4) . ap ((+) . double . imagPart) (double . realPart) 01:52:50 :t ap 01:52:51 forall (m :: * -> *) a b. (Monad m) => m (a -> b) -> m a -> m b 01:52:56 @hoogle forall (m :: * -> *) a b. (Monad m) => m (a -> b) -> m a -> m b 01:52:56 Parse error: 01:52:56 --count=20 "forall (m :: * -> *) a b. (Monad m) => m (a -> b) -> m a -> m b" 01:52:56 ^ 01:53:04 @hoogle (Monad m) => m (a -> b) -> m a -> m b 01:53:04 Control.Monad ap :: Monad m => m (a -> b) -> m a -> m b 01:53:04 Control.Monad liftM :: Monad m => (a1 -> r) -> m a1 -> m r 01:53:05 Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b 02:00:20 -!- cheater_ has quit (Ping timeout: 255 seconds). 02:09:20 @pl \x -> xCenter+tick*x 02:09:20 (xCenter +) . (tick *) 02:13:25 -!- cheater_ has joined. 02:16:18 :t findIndex 02:16:18 forall a. (a -> Bool) -> [a] -> Maybe Int 02:16:26 :t (a->a)->a->Int 02:16:27 parse error on input `->' 02:16:33 :t (a -> a) -> a -> Int 02:16:33 parse error on input `->' 02:16:58 ?? 02:17:10 @hoogle (a -> a) -> a -> Int 02:17:10 Data.Generics.Schemes everywhere :: (a -> a) -> a -> a 02:17:10 Data.Generics.Schemes everywhere' :: (a -> a) -> a -> a 02:17:11 Prelude until :: (a -> Bool) -> (a -> a) -> a -> a 02:17:44 until doesn't count number of steps, alas 02:21:24 -!- MDude has joined. 02:21:24 -!- MDude has changed nick to MSleep. 02:28:59 A, doh. 02:29:12 I changed z^^2 into z*z 02:29:22 Suddenly, almost halved time! 02:29:39 Lymee: there was a reason i wrote it with that yeah :P 02:30:27 istr someone wondering why ghc doesn't optimize x^2 to x*x before 02:30:49 > x^2 02:30:50 x * x 02:31:21 ha. 02:31:21 they are absolutely identical 02:31:32 > x * 3 02:31:33 x * 3 02:31:44 :t x 02:31:45 Expr 02:31:49 Ooh 02:31:56 > x :: Num 02:31:57 Class `GHC.Num.Num' used as a type 02:31:59 (in final result) 02:32:03 > show x 02:32:04 "x" 02:32:10 Ooh 02:32:14 This is a good idea 02:32:20 ...I thought everyone already knew about Expr. 02:32:21 > y 02:32:22 y 02:32:25 > fix f 02:32:25 Ambiguous type variable `a' in the constraints: 02:32:25 `GHC.Show.Show a' 02:32:25 a... 02:32:29 > a 02:32:30 a 02:32:31 > fix f :: Expr 02:32:32 f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (... 02:33:36 > scanl1 (*) [a,b,c,d,e] 02:33:37 [a,a * b,a * b * c,a * b * c * d,a * b * c * d * e] 02:35:28 > a+b 02:35:29 a + b 02:35:32 Heh. 02:35:34 Didn't know that existed. 02:35:41 Any way to evaluate that? 02:35:47 > a+g 02:35:48 a + g 02:35:51 > (a+g) 1 1 02:35:52 Couldn't match expected type `t1 -> t2 -> t' 02:35:52 against inferred type ... 02:35:55 not to my knowledge 02:36:07 :t a 02:36:07 Expr 02:36:12 @src Expr 02:36:12 Source not found. 02:36:27 Lymee: it's in a package named simplereflect 02:36:31 iirc 02:37:14 http://hackage.haskell.org/package/simple-reflect 02:38:17 oh there's a reduction function 02:38:34 reduction (a+b+c+d) 02:38:37 er 02:38:39 > reduction (a+b+c+d) 02:38:40 Not in scope: `reduction' 02:38:42 oops 02:39:15 maybe lambdabot doesn't have the latest version 02:39:28 > reduce (1+2+3+4) 02:39:29 3 + 3 + 4 02:39:34 > reduction (1+2+3+4) 02:39:34 Not in scope: `reduction' 02:39:42 >reduce (a+b+c+d) 02:39:46 > reduce (a+b+c+d) 02:39:46 a + b + c + d 02:39:52 > reduce (a*b+a*c) 02:39:53 a * b + a * c 02:39:57 i guess it cannot reduce pure symbols 02:40:02 > reduce (a*(b+c)) 02:40:03 a * (b + c) 02:40:08 Bleh. 02:40:16 > iterate reduce (1+2+3+4) 02:40:16 [1 + 2 + 3 + 4,3 + 3 + 4,6 + 4,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10... 02:40:51 > iterate reduce (1*2+3*4) 02:40:52 [1 * 2 + 3 * 4,2 + 3 * 4,2 + 12,14,14,14,14,14,14,14,14,14,14,14,14,14,14,1... 02:41:58 > (\x -> fst $ head $ dropUntil (\x -> (fst x) == (snd x)) $ zipWith (,) x $ tail x) $ iterate reduce (1*2+3*4) 02:41:58 Not in scope: `dropUntil' 02:42:10 * Lymee runs 02:42:18 :t var 02:42:19 forall a. String -> Sym a 02:42:27 > (\x -> fst $ head $ dropWhile (\x -> (fst x) != (snd x)) $ zipWith (,) x $ tail x) $ iterate reduce (1*2+3*4) 02:42:28 Not in scope: `!=' 02:42:38 > (\x -> fst $ head $ dropWhile (\x -> !((fst x) == (snd x))) $ zipWith (,) x $ tail x) $ iterate reduce (1*2+3*4) 02:42:39 : parse error on input `!' 02:42:43 > (\x -> fst $ head $ dropWhile (\x -> not ((fst x) == (snd x))) $ zipWith (,) x $ tail x) $ iterate reduce (1*2+3*4) 02:42:43 1 * 2 + 3 * 4 02:42:47 Aww. 02:46:04 > dropWhile (uncurry (/=)) . ap zip tail $ iterate reduce (1*2+3*4) 02:46:05 [(1 * 2 + 3 * 4,2 + 3 * 4),(2 + 3 * 4,2 + 12),(2 + 12,14),(14,14),(14,14),(... 02:46:12 hm... 02:46:30 > ap zip tail $ iterate reduce (1*2+3*4) 02:46:31 [(1 * 2 + 3 * 4,2 + 3 * 4),(2 + 3 * 4,2 + 12),(2 + 12,14),(14,14),(14,14),(... 02:47:12 > 14 == (14 :: Expr) 02:47:13 True 02:47:25 > reduce (2+12) == (14 :: Expr) 02:47:26 True 02:47:54 > reduce (2+12) /= (14 :: Expr) 02:47:55 False 02:48:10 > 2+12 /= (14 :: Expr) 02:48:10 False 02:48:16 ooh 02:48:19 darn 02:48:38 it actually reduces when comparing 02:50:37 http://pastebin.com/PXcS0k5G < is my code horrible? 02:51:06 > reduce (2+12+4+5) /= (14 :: Expr) 02:51:07 True 02:51:16 > reduce (2+12+4+5) /= (25 :: Expr) 02:51:17 True 02:51:23 > (2+12+4+5) /= (25 :: Expr) 02:51:24 True 02:51:31 > iterate reduce (2+12+4+5) 02:51:32 [2 + 12 + 4 + 5,14 + 4 + 5,18 + 5,23,23,23,23,23,23,23,23,23,23,23,23,23,23... 02:51:35 opps 02:51:36 my math fail 02:51:39 :P 02:51:40 > (2+12+4+5) /= (23 :: Expr) 02:51:41 False 02:53:48 > reduce (i*i) 02:53:48 i * i 02:53:54 > reduce (i+i) 02:53:54 i + i 02:54:03 > reduce (i^3) 02:54:04 i * i * i 02:54:10 > reduce (i^(100^100)) 02:54:11 i * i * (i * i) * (i * i * (i * i)) * (i * i * (i * i) * (i * i * (i * i)))... 02:54:13 * Lymee runs 02:54:30 > map (\x -> take 10 $ show x) $ iterate reduce (i^(100^100)) 02:54:31 ["i * i * (i","i * i * (i","i * i * (i","i * i * (i","i * i * (i","i * i * ... 02:54:42 > drop 100 $ iterate reduce (i^(100^100)) 02:54:43 [i * i * (i * i) * (i * i * (i * i)) * (i * i * (i * i) * (i * i * (i * i))... 02:54:49 > drop 1000 $ iterate reduce (i^(100^100)) 02:54:49 [i * i * (i * i) * (i * i * (i * i)) * (i * i * (i * i) * (i * i * (i * i))... 02:54:52 Aww. 02:54:59 @redo map (\y -> map (\x -> fracf $ (xCenter+x) :+ (yCenter+y)) range) range 02:54:59 Maybe you meant: do read todo undo 02:55:03 argh 02:55:09 @list undo 02:55:09 undo provides: undo do 02:55:15 @do map (\y -> map (\x -> fracf $ (xCenter+x) :+ (yCenter+y)) range) range 02:55:15 map (\ y -> map (\ x -> fracf $ (xCenter + x) :+ (yCenter + y)) range) range 02:55:21 darn 02:55:28 What did you want to do? 02:55:31 @do x >>= f 02:55:31 do { a <- x; f a} 02:55:40 turn it into a list comprehension 02:55:48 Ah. 02:57:19 [ [ fracf $ (xCenter+x) :+ (yCenter+y)) | x <- range ] | y <- range ] 02:58:04 Already did it. 02:58:06 :) 02:59:08 you have some more parentheses than necessary, but fair enough 03:00:35 also double is usually called square 03:02:00 uh 03:02:01 wait why did i do that 03:02:15 >< 03:02:18 beats me :P 03:03:42 -cpp Run the C pre-processor on Haskell source files 03:03:42 [dynamic] 03:03:46 Is there any reason to ever do that? 03:04:17 haskell doesn't have much in the way of conditional compilation without it 03:04:27 well didn't use to, anyway 03:04:39 i guess you can use template haskell these days 03:05:21 From what I read about Haskell, C pre-processor doesn't seem like the best kind of preprocessor for Haskell (because of the meanings of # and ' in Haskell, as well as other things) 03:05:40 i think it's actually a slightly modified preprocessor 03:05:48 What might be improved is something like how the macro preprocessor stuff in WEB but changed for Haskell stuff. 03:06:46 when hugs was still alive, it shared a number of library source files with ghc, which sometimes used cpp 03:07:28 For various reasons, I doubt a C preprocessor would work well with Haskell. 03:08:18 as i said, it is a modified one. 03:08:20 [snip]:~/hs$ time ./mandelbrot 1000 0 0 1 300 output.png 03:08:20 real0m24.731s 03:08:21 user0m24.650s 03:08:21 sys0m0.036s 03:08:21 [snip]:~/hs$ time ./mandelbrot 1000 0 0 1 300 output.png 03:08:21 real0m7.606s 03:08:23 ...... 03:08:25 o.o 03:08:36 Is -O9 really that effective? 03:09:45 well -O2 is effective, iirc -O3 sometimes gets worse, and i don't think there's a difference beyond that 03:09:54 * Lymee boggles 03:09:56 oerjan: Yes, a modified one might work. 03:10:31 iirc -O3 uses some experimental optimizations that are not guaranteed to actually make things better. 03:10:46 The executable -O2 and -O3 generate are identical, so.. 03:11:42 oh wait it's actually -O1 and -O2 03:11:58 http://www.haskell.org/ghc/docs/latest/html/users_guide/options-optimise.html 03:12:21 "At the moment, -O2 is unlikely to produce better code than -O. 03:12:23 " 03:14:41 or wait, there's not actually a number for using those that make things worse. 03:18:24 -!- azaq23 has quit (Ping timeout: 260 seconds). 03:24:57 http://www.malevole.com/mv/misc/killerquiz/ 03:25:52 Not funny. 03:25:52 =p 03:29:49 Is IUP generally well-regarded? 03:34:34 -!- NihilistDandy has joined. 03:39:47 -!- azaq23 has joined. 03:39:48 -!- azaq23 has quit (Changing host). 03:39:48 -!- azaq23 has joined. 03:41:48 Ohai 03:47:25 hrm... crap 03:47:36 Wut 03:47:47 writing that script I wanted will be harder than I thought 03:48:08 since I have to account for translational symmetry too 03:48:49 not too hard, just annoying 03:49:18 * NihilistDandy nods 04:03:45 -!- pikhq_ has joined. 04:03:54 -!- pikhq has quit (Ping timeout: 260 seconds). 04:07:26 -!- BeholdMyGlory has quit (Remote host closed the connection). 04:33:50 coppro: sounds like you want some kind of ABSTRACTION 04:34:25 * NihilistDandy trumpets 04:34:56 honestly are there programmers out there who think abstraction is in general bad? 04:35:56 better not be 04:36:05 College C programmers 04:36:37 Oracle admins 04:46:46 What about COBOL programmers? 04:47:30 I AM FORTRAN AND I DISLIKE CHANGE 04:56:05 Whether you need abstraction as well as what kind of abstraction depends on a lot of stuff! 05:05:25 like the socioeconomic status of your target demographic, for instance 05:05:37 or...the price of oil in canada 05:06:02 and the age of the current pope of course 05:07:12 Also your favorite ice cream 05:07:25 The lactose intolerant have no need for abstraction 05:08:04 This is an obvious truth, whose proof is left as an exercise to the reader. 05:43:08 Once I wrote something as a joke for rules of a card game, the value of the Queen card is current age of the queen, and to figure out the value of a Joker card you tell a joke to your opponent, and the value of this card is however many times your opponent laughs. 05:44:26 How did a couple hours of magic turn into 8? 05:44:31 s/magic/Magic/ 05:45:07 Meh, whatever, I regret it not. 05:45:12 Do you have more information? 05:45:18 pikhq_: magic, of course 05:45:29 (Maybe question can be answered, then?) 05:46:40 I found the texts I wrote some jokes of rules for card game and stuff. Here is some of it: 05:46:55 This game can be played by any number of people, as long as the number of people is even and prime. First, shuffle the cards. The players can now make a deal, either an addition deal or a multiplication deal. And then you figure out the values of the cards, and then finally you deal the cards. 05:47:01 If the deck has 40 cards, then you get 3 cards. If the deck has 52 cards, then you get 4 cards. If you are a funny guy, then you get 5 cards. If your name is Aaron, then you get 6 cards. 05:48:24 This document also jokes about measuring the resistance of pokemon cards in ohms. 05:48:28 haha 05:48:35 link? 05:49:50 http://zzo38computer.cjb.net/GamesMadeStupid/cardgame.htm 05:50:35 I didn't write it completely by myself (I forget exactly which parts) although I did write much of it and I did put everything together. 05:52:03 Also, I'm not entirely sure why I *started* this, other than that someone said "lol if freebsd used git, they'd have to have a gigantic repo in /usr/src", but cvs2git of FreeBSD's repo has taken two days thus far. 05:53:22 I like the win condition for solitair 05:53:24 *solitaire 05:54:02 (FWIW, FreeBSD typically has a CVS checkout of the source used to build the system in /usr/src) 05:54:15 Ah 05:54:49 Personally, I'm going to be surprised if the git repo of all changes from '93 is larger than a CVS checkout. 05:56:26 Doesn't CVS put metadata in the file though? 05:57:15 Yes. 05:57:28 Well, actually, it's optional metadata in the file. 05:57:39 Does cvs2git strip it? 05:57:58 I *think* it just fills in the metadata. 05:58:21 Or maybe it leaves it alone? 05:58:25 I dunno, I'll look. 06:03:08 Crud, my eyes are going weird 06:03:22 I'm reading a Homestuck update, and some of the text looks like it's popping out 06:03:26 Depending on the color 06:04:44 Link? 06:06:48 NihilistDandy, have you read all of Homestuck? 06:06:58 No. 06:19:52 technically no one has. 06:21:33 andrew husey in the future 06:22:05 adnrew, sorry 06:24:02 I didn't find the character Evinrude's (in The Rescuers) name meaningful until I got older 06:24:07 Then it was funny for a second 06:24:22 I should finish PS 06:24:45 He's a dragonfly, you see, and he propels mouse sized boats around a bayou 06:29:53 i got the joke the first time i saw it 06:29:58 when i was like 7 06:30:08 How good are you at optimization algorithms and that stuff? I was trying to make some kind of optimization. However, I cannot quite figure it out. That is why, I would like some help too. And then I can learn. 06:30:26 quintopi1: I lived in a landlocked state 06:30:34 With no boating friends 06:30:39 aha 06:30:41 I'm sorry I didn't have a yacht like some people 06:30:44 :P 06:31:15 i'm sorry i was taken fishing from very young in tiny johnboats 06:31:39 I did all my fishing from land :D 06:32:13 -!- quintopi1 has changed nick to quintopia. 06:32:27 -!- quintopia has quit (Changing host). 06:32:27 -!- quintopia has joined. 06:35:57 -!- hagb4rd has joined. 06:41:16 -!- hagb4rd has quit (Read error: Connection reset by peer). 06:46:12 i wanna thank whoever linked me to: http://everything2.com/title/Using+Asteroids+to+explain+the+topological+classification+of+2-manifolds 06:46:31 just reading it now and the idea is making sense 06:47:20 :D 06:47:57 so now what we need is a torus shaped monitor 06:48:58 with uh.. touchscreen 06:49:34 and it would be incredibly boring and a stupid idea and i'll just let it go 06:49:35 -!- oerjan has quit (Quit: Good night). 06:51:04 I have seen a diagram in a book where they described a TV screen being shaped like torus. I think the reason is similar, too. 06:51:14 Being stupid? 06:51:53 (But it didn't have touchscreen) 06:52:08 (Nor would touchscreen help in the context it was given in) 06:52:41 NihilistDandy: Is that a question to me? Or to itidus20? 06:53:13 I meant was the reason for the toroidal TV screen "being stupid"? 06:53:51 No! The reason was to indicate having no edges and you can move one direction to end up in the same place, and so on things like that. 06:54:24 Of course you would not have such a TV screen, I don't think it would work very well for any circumstances I can understand. 06:54:50 Mostly a joke 06:55:36 -!- hagb4rd has joined. 06:59:00 I wish my last name were more palindrome friendly. 06:59:28 this panel setup for the scratch is making everything extremely difficult to follow 06:59:43 it also doesn't help that I've forgetting details of what happened.... 06:59:46 +been 07:01:37 -!- NihilistDandy has quit (Quit: sleep). 07:03:10 :( The Science of Discworld isn't available as an ebook 07:03:25 Or at least, not from B&N 07:04:33 Oh, eBooks.com has it 07:18:04 ok i was following it until the spehrical universes bit 07:18:36 is the idea that a sphere doesn't really need an edge? 07:21:20 nevermind.. im pretty sure i know what a sphere is :-s 07:21:21 -!- augur has quit (Remote host closed the connection). 07:22:30 I hope someone can understand my register optimization algorithm problem that I have had. And if there is other channel that they know this kinds of things better. 07:22:41 -!- zzo38 has quit (Quit: But for now I sleep). 07:44:16 -!- augur has joined. 08:07:33 -!- hagb4rd has quit (Ping timeout: 255 seconds). 08:19:05 :t Expr 08:19:06