00:00:05 oerjan: well, k=1(mod k-1), so k^n = 1^n (mod k-1), done. 00:00:12 ... 00:00:14 ..... 00:00:18 I feel redundant. 00:00:19 I shall have to prove this so-called standard result myself at some point 00:00:23 Thank you all 00:00:25 int-e: is there a terrible lag between us 00:00:26 oerjan++ 00:00:28 int-e++ 00:00:59 oerjan: no, I pressed the return key before reading what you wrote. 00:01:33 timestamps: 01:59:46 02:00:04 00:02:50 http://en.wikipedia.org/wiki/Mersenne_prime#Theorems_about_Mersenne_numbers it's also #2 here 00:11:25 Hmm... show that if 4^a + b^4 is prime then either a = b = 1 or a is even. 00:11:38 Taneb: for you ;-) 00:12:44 Awww it's quarter past one in the morning 00:12:57 I should really sleep so I can hand this assignment in before my 10:30 lecture 00:12:58 int-e: that looks very difficult 00:13:17 quintopia: it has an elementary solution 00:13:26 (short, too) 00:13:34 "I returned the iPhone to Apple because it didn't have a "back" button." 00:13:41 Sounds like a feature, not a bug, to me 00:13:57 (In case anyone hadn't noticed, I hate the back button) 00:14:25 int-e: it's not at all obvious to me 00:14:27 quintopia: but yeah, it's not easy to find. 00:15:03 i mean, like it's not even obvious at first glance that 4^3+5^4=689 is composite! 00:15:30 i quickly found that b had to be divisible by 5, anyhow 00:15:33 int-e: is it based on one of those factoring tricks 00:15:50 quintopia: of course 00:16:05 yeah i can never see those stupid things 00:16:12 2,3,4,6,9,8,12,18,27,... 00:16:16 QUINTHELLOPIAAAAAAAA! 00:16:26 hi boily 00:17:54 what did you today? 00:18:00 saw a weird play 00:19:07 quite uncommon. 00:21:14 and you 00:22:11 int-e: i think i see it. has to do with the fact you can write 4^a as 4*(2^k)^4 for a odd, where k>0? 00:22:25 quintopia: yes. 00:22:29 chinese fooded with a friend, then we went to the other side of the city to go see an insect exhibition, then beer and snacks. 00:23:28 sounds fun 00:23:31 were the insects the snacks twh 00:23:48 oerjan: don't knock it if you haven't tried it 00:24:03 sorry, insects are not cricket around here 00:24:16 boily: i also "finished" my password generator prototype 00:24:55 oerjan: in fact, I tasted some grasshopers (and bough a jar of salsa) at a kiosk, but the snacks that we ordered with the beers were more conventional (chorizo, chutney and bread) 00:25:17 that's not conventional around here. 00:25:19 wish it were. 00:25:21 quintopia: finishing a prototype is an oxymoron. 00:25:31 boily: but "finishing" is not 00:25:50 the chorizo was deliciously smokey, and the chutney mustardey. 00:26:02 indeed, a subtle but important vocabulary difference. 00:26:33 on friday i went with a friend to a bar and we started a game of cards against humanity with random strangers 00:26:42 oooooh :D 00:26:44 then ate indian tacos 00:27:15 i feel like i should just quit my job 00:27:22 and go visit people in places 00:27:27 hmm... iirc there's a taco-serving bar in the Mile End, but reviews agree that the place is beyond terrible. 00:27:39 quintopia: do as lexande did, and visit me ^^ 00:27:58 ok now i just have 2 chars more than int-e 00:28:19 i would totally visit you. i will visit everyone that wants to be visited. (sorry oerjan.) 00:35:06 quintopia: do you yourself want to be visited, and does this mean you will visit yourself? 00:44:19 ah tied with int-e 00:45:33 -!- FreeFull has quit (Ping timeout: 260 seconds). 00:45:42 Sgeo: quintopia visits everyone who does not visit themself 00:46:41 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 00:48:51 and then shave their beards. 00:53:07 my beard is hard to shave. it'd be the Challenge Boss Beard at the end of the Visit Quest. 00:53:29 each man thinks that. 00:53:50 i'd have to grow one first. 00:54:35 will :t always show what a function does? 00:54:39 in haskell 00:54:45 :t fmap 00:54:46 Functor f => (a -> b) -> f a -> f b 00:54:47 it shows its type 00:56:05 yeah, i messed up... for stuff like :t (a,b) it coincidentally show's what it does 00:56:34 but :t (==) just shows bool after a couple -> 00:56:36 okay. 00:56:40 it is pretty good for seeing what a function does. 00:56:42 :t (==) 00:56:43 Eq a => a -> a -> Bool 00:56:56 :t (/=) 00:56:58 Eq a => a -> a -> Bool 00:57:00 It takes an a, and gives you a thing that takes an a and returns a Bool, where a has to be in the "Eq" class. 00:57:05 :t (Eq) 00:57:06 Not in scope: data constructor ‘Eq’ 00:57:06 Perhaps you meant ‘EQ’ (imported from Data.Ord) 00:57:10 :i Eq 00:57:12 aww. 00:57:15 meh. 00:57:17 Eq is a class, not a type 00:57:21 lambdabot doesn't have :i 00:57:23 well, a "typeclass" i guess 00:57:31 * boily mapoles lambdabot 00:57:32 AndoDaan: you can try :i Eq in GHCi 00:57:35 -!- applybot has joined. 00:57:39 okay 00:57:51 A typeclass is just an abstract definition, a very little bit like a virtual class definition in OOP Language Du Jou 00:57:54 r 00:57:56 oh wow, big definition. 00:58:15 things in the Eq class have to have == defined, and probably some other crap 00:58:21 ah, for all the types. 00:58:28 oh right :i Eq will give a big list of known instances 00:58:33 *classes 00:58:46 Bike: only (==) is necessary, because (/=) has a default implementation. that's about it for Eq. 00:58:58 he said it was long and i'm too lazy to pull up local ghci 00:59:56 it's the instance list that's long. 01:00:16 mostly because of all the tuple lengths. 01:00:16 oh, that makes sense. the definition is short, but lots of things have == work on them. 01:01:11 anyway so if you have your own type you can define an == method on it, and then other functions already defined in terms of == will work with your type. 01:01:23 Bike: careful about comparing haskell typeclasses to OO classes, soon you'll be teaching AndoDaan bad habits >:) 01:01:30 way ahead of you 01:01:56 if you don't stop me i'll tell andodaan that haskell is a programming language and not homotopy type theory. mwa ha ha ha ha 01:02:16 * oerjan doesn't know homotopy type theory anyway 01:02:24 nor me. 01:02:35 something to do with topological mapping> 01:02:37 ? 01:02:47 sounds like good words to guess at. 01:02:53 very vaguely 01:04:16 a homotopy in "ordinary" math is a topological mapping of a sort. also a _path_ between two other topological mappings. 01:04:27 -!- conehead has joined. 01:05:03 but how that's got analogized/transfered into type theory of programming languages (not really haskell, though) i'm very unsure about. 01:05:22 i think category theory got involved in the middle :P 01:05:39 above my paygrade. 01:05:56 i mean, i kinda know what those things are. 01:06:16 oerjan: just, like, ∞ groupoids, man 01:06:42 OKAY 01:09:58 -!- AndoDaan_ has joined. 01:10:21 -!- AndoDaan has quit (Ping timeout: 246 seconds). 01:16:37 ah cool, just wrote a fibonacci equation, on my own. 01:16:43 i'm advancing. 01:16:51 learning. growing stronger. 01:18:09 now make one that doesn't have exponential blowup hth (tdnh) 01:18:23 hth? 01:18:27 ` 01:18:27 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 01:18:31 oops 01:18:35 `? hth 01:18:36 hth is help received from a hairy toe. It is not at all hambiguitous. 01:18:47 hope that clears it up 01:19:06 `? tdnh 01:19:06 absolutely... 01:19:07 tdnh does not help 01:19:29 oh wait 01:19:36 hope that helps. 01:19:41 i'm dense 01:19:43 okay. 01:20:29 what'd i miss 01:20:50 is there a way to define fib n without recursion? like using an approximation of the golden ratio? 01:21:07 AndoDaan_: there's a closed-form formula that calculates it directly 01:21:12 and exactly 01:21:12 hmm 01:21:12 Sgeo: i visit myself whenever the urge overtakes me. and no one's looking, of course. 01:23:51 mind you, that closed formula uses floating point, so you might get rounding errors. 01:24:15 (it has the golden ratio and its inverse in it) 01:24:37 i thought phi was a real number but it turns out it was a floating point all along :'( 01:25:04 real numbers are just points in R hth 01:26:00 real numbers are, like, crazy, man 01:26:01 there is also a formula using matrix exponentiation, which can use exact integers. 01:28:38 :t mapM 01:28:40 Monad m => (a -> m b) -> [a] -> m [b] 01:31:04 @let instance Num a => Num [[a]] where m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:31:05 .L.hs:159:10: Warning: 01:31:05 No explicit implementation for 01:31:05 ‘+’, ‘abs’, ‘signum’, ‘fromInteger’, and (either ‘negate’ or ‘-’) 01:31:05 In the instance declaration for ‘Num [[a]]’ 01:31:05 01:31:23 don't tell me that means it won't take 01:31:36 > [[1]]*[[1]] 01:31:38 No instance for (GHC.Show.Show t0) 01:31:39 arising from a use of ‘M650974571118004358930528.show_M6509745711180043589... 01:31:39 The type variable ‘t0’ is ambiguous 01:31:39 Note: there are several potential instances: 01:31:39 instance [safe] GHC.Show.Show L.Poles -- Defined at L.hs:157:1 01:31:53 > [[1]]*[[1::Int]] 01:31:55 No instance for (GHC.Num.Num [[GHC.Types.Int]]) 01:31:55 arising from a use of ‘GHC.Num.*’ 01:32:01 OKAY 01:32:24 whoa, MINIMAL 01:33:06 best pragma or bester pragma? 01:33:24 -!- ais523 has quit. 01:33:33 -!- ais523 has joined. 01:33:38 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:33:41 Defined. 01:33:46 > [[1]]*[[1]] 01:33:49 [[1]] 01:34:05 > [[1,0],[1,1]]^10 01:34:07 [[1,0],[10,1]] 01:34:19 hm not so good 01:34:22 oh wait 01:34:41 > [[1,1],[1,0]]^10 01:34:43 [[89,55],[55,34]] 01:34:46 there you go 01:35:30 @let fib n = head$head$[[1,1],[1,0]]^n 01:35:32 Defined. 01:35:44 i'm a way off from constructing something like that. 01:35:44 > [fib n | n <- [1..20]] 01:35:46 [1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946] 01:36:20 AndoDaan_: making matrix multiplication work with lists may be a _tiny_ bit non-recommended. 01:36:33 although i could figure it had something to do with the sum of tails. 01:36:38 -!- AndoDaan_ has changed nick to AndoDaan. 01:36:41 hoorærjan for making fib 0 = 1 01:36:46 no addition... 01:36:54 SORRY 01:36:54 shachaf: æ? not even œ? 01:37:15 hooræœrjan? 01:37:15 Bike: i only implemented what was needed to make ^ work 01:37:16 still waiting on inner products btw 01:37:18 Doesn't really work. 01:37:31 Bike: what's an inner product 01:37:38 like dot product, but moreso\ 01:37:46 shachaf: i wasn't sure which matrix element was the right one, sorry 01:37:51 ? 01:37:56 I like fib 0 = 1 01:38:07 fun fib 0 = 1 01:39:39 boily: gah work is going to be a PITA this week 01:39:44 that is a fun fib 01:39:51 shachaf: fib 0 = 0 is prettier, you get fib (gcd m n) = gcd (fib m) (fib n) 01:40:40 then fix it? 01:40:40 and also abs(fib (-n)) == abs(fib n) 01:40:45 quintopia: ? 01:40:56 @undef 01:40:56 Undefined. 01:41:07 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:41:09 Defined. 01:41:16 oerjan: but the children's book i learned about fib from started it off with 1,1 01:41:21 so that's how it is hth 01:41:24 @let fib n = [[1,1],[1,0]]^n!!1!!1 01:41:27 Defined. 01:41:31 boily: should i feel bad if i just leave the dog unwalked, and get up early tomorrow? 01:41:41 > [fib n | n <- [0..20]] 01:41:43 Could not deduce (GHC.Real.Integral b0) 01:41:43 arising from a use of ‘L.fib’ 01:41:43 from the context (GHC.Num.Num t) 01:41:43 bound by the inferred type of it :: GHC.Num.Num t => [[[t]]] 01:41:43 at Top level 01:41:51 argh 01:42:29 wrong fixities 01:42:32 @undef 01:42:32 Undefined. 01:42:38 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:42:40 Defined. 01:42:51 oerjan: cadadr hth 01:43:14 @let fib n = ([[1,1],[1,0]]^n)!!1!!0 01:43:16 Defined. 01:43:21 > [fib n | n <- [0..20]] 01:43:22 [*Exception: Prelude.undefined 01:43:28 isnt it spelled cddr 01:43:28 oh hm 01:43:33 > [fib n | n <- [1..20]] 01:43:35 [1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765] 01:43:41 oh 01:43:43 wait 01:43:44 nvm 01:43:52 it won't work for 0 because i didn't define fromIntegral. 01:45:19 quintopia: only meanies unwalk dogs. 01:45:48 (unless it's a chihuahua; then it permanently walks only by cumulative vibration.) 01:46:08 @undef 01:46:08 Undefined. 01:46:35 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger n=[[n,0],[0,n]];m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:46:36 .L.hs:159:27: 01:46:36 Could not deduce (a ~ Integer) 01:46:36 from the context (Num a) 01:46:36 bound by the instance declaration at .L.hs:154:10-29 01:46:36 ‘a’ is a rigid type variable bound by 01:46:41 oops 01:46:58 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger n=[[fromInteger n,0],[0,fromInteger n]];m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:47:00 Defined. 01:47:07 @let fib n = ([[1,1],[1,0]]^n)!!1!!0 01:47:10 Defined. 01:47:12 > [fib n | n <- [0..20]] 01:47:14 [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765] 01:47:18 there you go 01:47:53 > fib 10000 01:47:54 3364476487643178326662161200510754331030214846068006390656476997468008144216... 01:51:36 > sqrt 5 01:51:37 2.23606797749979 01:51:38 [ fib =: 3 :'{: {: (+/ .*)^:y~ 1 1,.1 0' 01:51:39 FireFly: |ok 01:51:46 [ fib 5 01:51:47 FireFly: 5 01:51:54 [ fib"0 i.10 01:51:55 FireFly: 0 1 1 2 3 5 8 13 21 34 01:52:39 > let phi = (1 + sqrt 5)/2 in fib 10000 - (phi ** 10000 - (1 - phi) ** 10000) / sqrt 5 01:52:40 NaN 01:52:45 Noice 01:52:50 and, i suppose, obvious 01:55:37 > let phi = (1 + sqrt 5)/2 in fib 100 - (phi ** 100 - (1 - phi) ** 100) / sqrt 5 01:55:38 -1179648.0 01:56:18 > let phi = (1 + sqrt 5)/2 in (fib 10, (phi ** 10 - (1 - phi) ** 10) / sqrt 5) 01:56:19 (55,55.000000000000014) 01:56:28 nifty. 01:59:40 -!- boily has quit (Quit: EXPRESSED CHICKEN). 02:29:42 -!- stuntaneous has joined. 02:32:08 -!- AndoDaan has quit (Ping timeout: 258 seconds). 02:32:27 -!- FreeFull has joined. 02:32:36 -!- FreeFull has quit (Changing host). 02:32:36 -!- FreeFull has joined. 02:49:58 -!- AndoDaan has joined. 03:02:22 -!- AndoDaan has quit (Ping timeout: 255 seconds). 03:03:13 -!- oerjan has quit (Quit: leaving). 03:05:42 -!- AndoDaan has joined. 03:39:46 -!- MDude has changed nick to MDream. 03:59:35 -!- ais523 has quit. 03:59:46 -!- ais523 has joined. 04:16:31 [wiki] [[OrthINTERCAL]] http://esolangs.org/w/index.php?diff=40629&oldid=25606 * 157.182.186.93 * (+36) Changed dead link to archive.org link 04:47:57 -!- copumpkin has joined. 04:51:03 -!- Sprocklem has quit (Quit: [). 04:52:44 -!- AndoDaan has quit. 04:58:09 -!- weissschloss has quit (Remote host closed the connection). 04:59:32 -!- weissschloss has joined. 05:04:50 -!- ais523 has quit. 05:04:57 -!- ais523 has joined. 05:11:57 -!- ais523 has quit. 05:12:06 -!- ais523 has joined. 05:22:45 -!- ais523 has quit. 05:22:56 -!- ais523 has joined. 05:30:21 -!- AndoDaan has joined. 05:36:28 -!- augur has quit (Read error: Connection reset by peer). 05:36:42 -!- augur has joined. 05:53:32 -!- augur_ has joined. 05:53:38 -!- augur has quit (Read error: Connection reset by peer). 06:17:05 -!- S1 has joined. 06:32:06 -!- S1 has quit (Ping timeout: 240 seconds). 06:38:12 -!- S1 has joined. 06:38:48 If I keep suddenly getting interest in things I hate, does this mean someday I will be interested in (and potentially attempt to defend) PHP? 06:39:17 yes, when PHP 10 comes true. 06:41:22 Sgeo: you should do that, watching you attempting to defend PHP would be hilarious 06:43:43 -!- MoALTz has quit (Read error: Connection reset by peer). 06:45:00 -!- MoALTz has joined. 06:53:56 -!- MoALTz has quit (Quit: Leaving). 07:06:50 "These loosely-typed variables are one of the properties that make PHP such an easy and powerful language, although they can sometimes also cause interesting problems 07:14:32 Huh. PHP variables are copy-on-write. That's actually interesting. 07:15:03 -!- S1 has quit (Quit: S1). 07:20:53 Sgeo: did you know the real reason behind PHPs odd, inconsistent function naming schemes? 07:21:43 Because different things were added by different people? Oh, wait, the whole 'we want certain number of functions with different lengths of names'/ 07:21:50 originally, PHP's function dispatch used string length for a hash-function 07:22:13 so it was more optimized to have a smoother distribution across 07:22:51 of course, I haven't cleaned any gutters lately so I can't say if they've finally got a saner or a zanier naming scheme 07:23:49 Ok. If I'm understanding PHP references properly... it's hard to mix both the normal COW behavior and the reference behavior, because each zval either has references or not? 07:24:29 Yay I guessed right "Something interesting—and perhaps unexpected— happens if you mix an assign-by-value call and an assign-by-reference call. " 07:26:28 Oh, no I didn't 07:26:42 PHP tries to keep things sane, by considering it a write, I guess? 07:27:16 Well, done reading for now 07:27:34 -!- J_Arcane has quit (Remote host closed the connection). 07:29:00 I guess PHP isn't that bad if you code it on your time off 07:29:05 kind of like QBasic 07:29:20 just competing with the other kids, seeing who can make the biggest sand castle 07:29:50 -!- Patashu has joined. 07:37:07 -!- AndoDaan_ has joined. 07:39:12 -!- AndoDaan has quit (Ping timeout: 248 seconds). 07:49:45 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 07:57:19 -!- AndoDaan has joined. 08:01:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:11:50 @tell oerjan I figured that already out :) 08:11:50 Consider it noted. 08:13:24 -!- conehead has quit (Quit: Computer has gone to sleep). 08:16:46 -!- AndoDaan_ has joined. 08:18:41 -!- AndoDaan has quit (Ping timeout: 248 seconds). 09:00:41 -!- ais523 has quit (Ping timeout: 260 seconds). 09:10:26 InvalidCo: Re QBasic http://gamma.zem.fi/~fis/qbc.html 09:10:52 (I did that HTMLization of the help file a way back, and want to get maximum use out of it.) 09:14:32 -!- AndoDaan has joined. 09:15:44 fizzie: excellent :D 09:16:51 -!- ais523 has joined. 09:17:07 -!- AndoDaan_ has quit (Ping timeout: 265 seconds). 09:44:00 Does PHP have an @deprecated or something? 09:44:35 people are still using mysql_* for new apps 09:45:49 also books in CS schools are still using PHP 4 09:45:50 but 09:46:27 that's not surprising :) 09:46:49 our maps in geography in Sekundarschule still had the sowjet union on it :) 10:39:42 -!- boily has joined. 10:50:16 -!- J_Arcane has joined. 10:53:20 > w 10:53:21 w 10:53:30 >["world",w++"!"] 10:53:37 > ["world",w++"!"] 10:53:38 Couldn't match expected type ‘[GHC.Types.Char]’ 10:53:38 with actual type ‘Debug.SimpleReflect.Expr.Expr’ 10:54:01 ah 10:54:05 it defines w:l 10:54:07 i see 10:54:58 -!- ais523 has quit. 10:55:09 -!- ais523 has joined. 11:11:17 elliott: Bad news, I got a second job offer too. 11:14:47 -!- Makadon has joined. 11:14:56 -!- Makadon has left. 11:15:07 -!- ais523 has quit. 11:15:18 -!- ais523 has joined. 11:19:29 -!- boily has quit (Quit: HYPERGEOMETRIC CHICKEN). 11:43:14 -!- ais523 has quit. 11:44:54 -!- Patashu has quit (Ping timeout: 258 seconds). 12:00:30 You could give one of them away. 12:01:08 Of course, the difficulty is choosing which one. 12:02:38 Throw a coin, then decide whether to accept its decision or not :P 12:03:33 (It's funny. I believe this could actually help me in making decisions, simply by establishing a default option.) 12:04:39 Throw a coin, then set the upper face to represent the decision you wanted to make 12:15:21 Jafet: that would defeat the purpose. 12:15:31 But I think you knew that. 12:15:57 And of course you should use whatever self-deception tricks that work for *you*. 12:22:00 int-e: That's kinda why I have http://mroman.ch/cgi/whichlang.pl 12:23:54 Hah hah. 12:25:25 I know that self-deception doesn't really work, but believing it just makes life easier. 12:31:36 -!- AndoDaan_ has joined. 12:32:58 -!- AndoDaan has quit (Ping timeout: 255 seconds). 12:35:42 J_Arcane: By visiting the link above your legally bound to actually use the language it suggested . 12:35:46 *you're 12:35:54 Heh heh. 12:36:01 I don't even know 90% of those. 12:36:06 I hope you got COBOL!!! 12:36:56 or BANCSTAR 12:36:59 BANCSTAR is in there too 12:41:57 ahahahaha. http://www.i-programmer.info/news/204-challenges/6474-cobol-code-contest-challenge.html 12:44:35 http://academic.microfocus.com/code/ 12:45:37 -!- oerjan has joined. 12:46:29 -!- polytone has quit (Quit: restarting server). 12:53:05 -!- Slereah_ has quit (Ping timeout: 260 seconds). 12:53:32 -!- monotone has joined. 12:53:35 -!- Slereah_ has joined. 13:05:08 BANCSTAR 13:08:58 Become a star programmer with BANCSTAR. 13:09:18 BANCSTAR. Only $9.95. (+ Manual for $99) 13:09:24 Bankster? 13:15:33 @messages- 13:15:33 mroman said 5h 3m 43s ago: I figured that already out :) 13:16:28 there's a manual? 13:20:01 There was one at least. 13:20:54 I've never heard from jloughry again 13:21:03 so I suspect he didn't find it and he also couldn't restore the floppy 13:27:29 hmm... 13:27:40 so people who try to figure out bancstar disappear? 13:27:59 probably has something to do with the moon landing 13:28:07 mroman: more likely with boojums 13:28:08 People say BANCStar was involved in the hoax. 13:29:37 duh, BANCStar is the moon's _real_ name 13:31:29 also, today's xkcd is relevant. 13:31:54 presidential alert? 13:32:07 i recommend reloading hth 13:33:17 (maybe xkcd has regional obnoxious caching. _that_ would be weird.) 13:33:44 it could be a misconfigured proxy. 13:36:02 -!- Phantom_Hoover has joined. 13:50:01 -!- drdanmaku has joined. 14:02:17 -!- S1 has joined. 14:03:07 -!- AndoDaan has joined. 14:03:30 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 14:03:37 -!- TieSoul has joined. 14:18:51 -!- AndoDaan_ has joined. 14:19:44 -!- AndoDaan has quit (Ping timeout: 248 seconds). 14:19:56 One of my lecturers has sent me a couple of esolang-like things used in PhDs 14:21:02 http://strlen.com/aardappel-language is one 14:21:14 Concurrent tree-reduction, at a glance 14:21:29 With... inter-tree communication? 14:22:31 http://synrc.com/publications/cat/Category%20Theory/Type%20Theory/Hagino%20T.%20A%20Categorical%20Programming%20Language.pdf is the other, seems to have a lot of Category Theory in it 14:23:16 "Data types are declared using F,G-dialgebras and each data type is associated with its own control structure." 14:26:50 * oerjan remembers hearing about aardappel here before 14:40:42 -!- Sprocklem has joined. 14:55:00 -!- Sprocklem has quit (Quit: Changing server). 14:55:34 -!- Sprocklem has joined. 14:56:47 i brought it up once 14:57:41 it's by the guy who made FALSE 15:17:43 -!- nycs has joined. 15:17:50 -!- nycs has changed nick to `^_^v. 15:18:40 -!- MDream has changed nick to MDude. 15:20:04 -!- AndoDaan has joined. 15:21:12 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 15:26:17 Lobster looks really neat 15:32:01 -!- oerjan has quit (Quit: Later). 16:03:46 -!- Sprocklem has quit (Ping timeout: 240 seconds). 16:08:24 -!- S1 has quit (Quit: S1). 16:23:47 -!- AndoDaan_ has joined. 16:25:22 -!- AndoDaan has quit (Ping timeout: 240 seconds). 16:32:03 -!- Bike has quit (Quit: leaving). 16:33:35 -!- Bike has joined. 17:31:18 -!- conehead has joined. 17:46:07 -!- TieSoul has quit (Ping timeout: 245 seconds). 18:09:07 -!- Sprocklem has joined. 18:40:02 So is this esoteric or just plain retarded http://hal.inria.fr/hal-00762330/PDF/paper-ieee.pdf 18:40:35 (Blazy and Giacobazzi, "Towards a formally verified obfuscating compiler") 18:53:49 -!- FreeFull has quit (Ping timeout: 260 seconds). 18:54:59 ah. 18:55:07 AndoDaan_: Fibonacci Numbers is hard :) 18:55:27 oh wait 18:55:27 no 18:55:34 Fibonacci Numbers is easy 18:55:38 Fibonacci Number is hard 18:55:43 (two different challenges) 18:56:16 http://golf.shinh.org/p.rb?Fibonacci+Number <- the hard one 18:56:25 http://golf.shinh.org/p.rb?Fibonacci+Numbers <- the easy one 18:57:10 hmm, that hard one asks for the 71th fibonacci number. that's too large to compute with my regex solution 18:59:52 -!- Sprocklem has quit (Ping timeout: 240 seconds). 18:59:53 -!- FreeFull has joined. 19:00:23 Fibonacci is just a Continuation of Addition 19:03:44 not even gs2 beats Burlesque at Fibonacci 19:04:05 but I think mauris will push an update to gs2 to get <10B :( 19:04:41 AndoDaan_: The trick is to do something like this 19:04:44 !blsq 1 1.+ 19:04:45 2 19:04:54 !blsq 1 1^^j^^.+#s 19:04:54 {2 1 1} 19:05:02 !blsq 1 1^^j^^.+^^j^^.+#s 19:05:02 {4 2 1 1} 19:05:10 hm wait 19:05:30 no 19:05:30 In a specialised stack-based language, fibbonacci would be 2]1]+d. 19:05:46 !blsq 1 2q.+10C!#s 19:05:47 {233 144 89 55 34 21 13 8 5 3 2 1} 19:06:12 Actually, probably 2]2]+d. 19:06:47